Speed and Accuracy using Four Boolean Query Systems

Speed and Accuracy using Four Boolean Query Systems,Michael Chui,Andrew Dillon

Speed and Accuracy using Four Boolean Query Systems   (Citations: 4)
BibTex | RIS | RefWorks Download
Existing research has shown that naive users find it difficult to correctly express queries using the standard Boolean connectives AND, OR, and NOT. We conducted an empirical study examining the query production performance of naive users on four different systems: One of these systems was non-procedural textual (Boolean connectives); another was procedural textual (If-Then-Else), another non-procedural graphical (based on Venn diagrams), and the last was procedural graphical (Filter-Flow). We found significant differences in both the accuracy and speed of users' query production based on the underlying Boolean forms of the queries they were required to generate. User performance in accuracy and speed was highest for the system using Boolean connectives, followed by Venn, Filter-Flow, and then If- Then-Else. No overall speed/accuracy tradeoff was observed. However, interactions were discovered amongst the factors of Boolean form, procedurality, and text vs. graphics. These results suggest lines of further work that can be used to improve Boolean interfaces to Web search engines.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: