Toward industrial-strength keyword search systems over relational data

– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions have been proposed and many prototypes have been developed. Building on this rapid progress and on growing user needs, recently several RDBMS and Web companies as well as academic research groups have started to examine how to build industrial-strength keywords search systems. This task clearly requires addressing many issues, including robustness, accuracy, reliability, and privacy, among others. A major emerging issue, however, appears to be performance related: current KWS systems have unpredictable run time. 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 begin by examining the above problem and arguing that it is a fundamental problem unlikely to be solved in the near future by sof...

• Type: Conference
• Year: 2010
• Where: ICDE
• Authors: Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Naughton
• Keywords: Current Kws Systems, Database, ICDE 2010, KWS Solution Approach, KWS Systems