Toward Scalable Keyword Search over Relational Data

Keyword search (KWS) over relational databases has recently received significant attention. Many solutions and many prototypes have been developed. This task requires addressing many issues, including robustness, accuracy, reliability, and privacy. An emerging issue, however, appears to be performance related: current KWS systems have unpredictable running times. In particular, for certain queries it takes too long to produce answers, and for others the system may even fail to return (e.g., after exhausting memory). In this paper we argue that as today’s users have been “spoiled” by the performance of Internet search engines, KWS systems should return whatever answers they can produce quickly and then provide users with options for exploring any portion of the answer space not covered by these answers. Our basic idea is to produce answers that can be generated quickly as in today’s KWS systems, then to show users query forms that characterize the unexplored portion of the ans...

• Type: Journal
• Year: 2010
• Where: PVLDB
• Authors: Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, Jeffrey F. Naughton
• Keywords: Answer Space, Current Kws Systems, KWS Systems, PVLDB 2010