Показать сокращенную информацию

A Graphical Filter/Flow Representation of Boolean Queries: A Prototype Implementation and Evaluation

dc.contributor.authorYoung, Degien_US
dc.contributor.authorShneiderman, Benen_US
dc.description.abstractOne of the powerful applications of Boolean expression is to allow users to extract relevant information from a database. Unfortunately, previous research has shown that users have difficulty specifying Boolean queries. In an attempt to overcome this limitation, a graphical Filter/Flow representation of Boolean queries was designed to provide users with an interface that visually conveys the meaning of the Boolean operators (AND, OR and NOT). This was accomplished by implementing a graphical interface prototype that uses the metaphor of water flowing through filters. Twenty subjects with no experience with Boolean logic participated in an experiment comparing the Boolean operations represented in the Filter/Flow interface with a text-only SQL interface. The subjects independently performed five comprehension tasks and five composition tasks in each of the interfaces. A significant difference (p < 0.05) in the total number of correct queries in each of the comprehension and composition tasks was found favoring Filter/Flow. (Also cross-referenced as CAR-TR-627)en_US
dc.format.extent5887826 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-2905en_US
dc.titleA Graphical Filter/Flow Representation of Boolean Queries: A Prototype Implementation and Evaluationen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtComputer Science Department Technical Reportsen_US

Файлы в этом документе


Данный элемент включен в следующие коллекции

Показать сокращенную информацию