Best-match querying in general database systems-a language approach

We reason in this paper that many queries in general database systems are best-match in nature: to a user, some records are more useful than others, and when the best records cannot be found or when there are not a sufficient number of them, the next best records should be retrieved. The heterogeneity of general databases will require different treatment on such queries than that in some special-purpose systems where the concept of best-match has been exploited. Language features are proposed to augment typical query languages in order to accommodate best-match querying. This is intended as another effort toward the design of convenient, expressive user interface to facilitate decision making via database systems.

[1]  Walter A. Burkhard,et al.  Some approaches to best-match file searching , 1973, Commun. ACM.

[2]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[3]  J. Bentley.  A survey of techniques for fixed radius near neighbor searching. , 1975 .

[4]  Gary G. Hendrix,et al.  Developing a natural language interface to complex data , 1977, TODS.

[5]  C. Levinthal.  Molecular model-building by computer. , 1966, Scientific American.

[6]  E. F. Codd,et al.  Seven Steps to Rendezvous with the Casual User , 1974, IFIP Working Conference Data Base Management.

[7]  Manfred Kochen,et al.  Principles of information retrieval , 1974 .

[8]  S. Peter de Jong,et al.  The System for Business Automation (SBA): Programming language , 1976, Commun. ACM.

[9]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[10]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[11]  Forest Baskett,et al.  An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

[12]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[13]  Michael Stonebraker,et al.  The design and implementation of INGRES , 1976, TODS.

[14]  E. F. Codd,et al.  A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[15]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.