REL: A Rapidly Extensible Language system
ACM '69 Proceedings of the 1969 24th national conference
English as a very high level language for simulation programming
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Cognitive style, categorization, and vocational effectss on performance of REL database users
CHI '81 Proceedings of the Joint Conference on Easier and More Productive Use of Computer Systems. (Part - II): Human Interface and the User Interface - Volume 1981
Query-by-example: operations on hierarchical data bases
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
Query-by-example: a data base language
IBM Systems Journal
Human factors in communication
IBM Systems Journal
IBM Journal of Research and Development
Query language feature analysis by usability
Computer Languages
Reusable decision space for mashup tool design
Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems
An overview of recent data base research
ACM SIGMIS Database
| Hi-index | 0.00 |
Many different query systems have been proposed. One way to partition extant and hypothetical query systems is on the basis of how English-like they are. One approach for an easy-to-use query system is to allow the user to state a question in natural English. The system may then disambiguate the possible interpretations of this question on the basis of context or on the basis of feedback questions to the user. A second approach is to require the user to state his question in a formal language system, but one that uses an English-like grammar and vocabulary. IBM's Interactive Query Facility (IQF) and SEQUEL exemplify this type of approach. A third approach is to require the user to state his question in a formal language system that does not attempt to appear "English-like." Zloof's Query By Example language is best described by this third approach. In this paper we demonstrate experimentally the ease and accuracy with which nonprogrammers learned and used this powerful Query By Example language.