Constructing queries from tokens

ABSTRACT

A database token is a value of either the data or the metadata. Usually, such tokens are combined with formal language constructs to form queries. In this paper we show how a given set of tokens may be completed to a proper query. This process provides a useful means of communication between naive users and databases, allowing them to express simple requests by listing several tokens. As the inferred query is always shown to the user, this process has a side effect of instructing the user in the proper use of the query language. The method is described and demonstrated with relational databases, but its principles may be implemented with other databases as well.

REFERENCES

• 1: C. Robert Carlson , Robert S. Kaplan, A generalized access path model and its application to a relational data base system, Proceedings of the 1976 ACM SIGMOD international conference on Management of data, June 02-04, 1976, Washington, D.C.
• 2: Shimon Even, Graph Algorithms, W. H. Freeman & Co., New York, NY, 1979
• 3: P J Hayes and J G Carbonell Multi-Strategy Constructmn Specific Parsing for Flexible Data Base Query and Update In Proccedtngs of the Seventh International Joint Conference on Arts fsctal Intelligence, pages 432-439 Vancouver, B C, 1981
• 4: Henry F. Korth , Gabriel M. Kuper , Joan Feigenbaum , Allen van Gelder , Jeffrey D. Ullman, SYSTEM/U: a database system based on the universal relation assumption, ACM Transactions on Database Systems (TODS), v.9 n.3, p.331-347, Sept. 1984 [doi>10.1145/1270.1209]
• 5: Stan C. Kwasny , Norman K. Sondheimer, Ungrammaticality and extra-grammaticality in natural language understanding systems, Proceedings of the 17th annual meeting on Association for Computational Linguistics, June 29-July 01, 1979, La Jolla, California [doi>10.3115/982163.982170]
• 6: David Maier, Theory of Relational Databases, Computer Science Pr, 1983
• 7: A Motro BAROQUE A Browssng Interface to Relational Database8 Technical Report TR-8-312, Computer Science Department, Umverslty of Southern Cahforma, August, 1984 To appear m the ACM Transactions on Office Information Systems
• 8: S L Osborne Towards a Universal Relation Instance In Proceedings of the Fifth International Conference on Very Large Data Bases, pages 52-60 Rm de Janelro, Brazd, 1979
• 9: Michael Stonebraker , Gerald Held , Eugene Wong , Peter Kreps, The design and implementation of INGRES, ACM Transactions on Database Systems (TODS), v.1 n.3, p.189-222, Sept. 1976 [doi>10.1145/320473.320476]
• 10: UNIFY Reference Manual 3 0 edltmn, UNIFY Corporatmn, 1983
• 11: Ralph M. Weischedel , John E. Black, Responding intelligently to unparsable inputs, Computational Linguistics, v.6 n.2, p.97-109, April-June 1980

INDEX TERMS

Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Query processing

General Terms:
Design, Languages, Management