Improving User Performance on Boolean Queries

Citation:
J.F. Pane and B.A. Myers, "Improving User Performance on Boolean Queries," CHI 2000 Extended Abstracts: Conference on Human Factors in Computing Systems, G. Szwillus and T. Turner, Eds. The Hague, Netherlands: ACM Press, April 1-6, 2000, pp. 269-270.

Abstract:
The accurate formulation of boolean expressions is a notorious problem in programming languages as well as database and web query tools. Users have demonstrated great difficulty with the common textual method for specifying these queries, which uses the boolean operators AND, OR, and NOT, partly because these words are used inconsistently in natural languages. This paper proposes a tabular boolean query language that avoids the need to use named operators, provides a concrete distinction between conjunction and disjunction, and makes grouping more explicit. A study comparing this tabular language with textual boolean expressions found that untrained users perform better when they express their queries in the tabular language, and about equally well when interpreting queries written in either language. We conclude that systems can benefit by adopting a tabular notation for query formulation.

Full text of this short paper:
PaneMyersBooleanQueries.pdf (22 KB).

Longer paper on this topic:
J.F. Pane and B.A. Myers, Tabular and Textual Methods for Selecting Objects from a Group, Proceedings of VL 2000: IEEE International Symposium on Visual Languages, Seattle, WA: IEEE Computer Society, September 10-13, 2000, pp. 157-164.

John Pane's Home Page
Natural Programming Project Page