Sanjay Agrawal, Surajit Chaudhuri, and Gautam Das
Internet search engines have popularized keyword based search.
While relational database systems offer powerfifl structured query
languages such as SQL, there is no support for keyword search
over databases. The simplicity of keyword search as a querying
paradigm offers compelling values for data exploration.
Specifically, keyword search does not require a priori knowledge
of the schema. The above is significant as much information in a
corporation is increasingly being available at its intranet.
However, it is unrealistic to expect users who would browse and
query such information to have detailed knowledge of the schema
of available databases. Therefore, just as keyword search and
classification hierarchies complement each other for document
search, keyword search over databases can be effective.
|Published in||ACM SIGMOD 2002|
|Publisher||Association for Computing Machinery, Inc.|
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.