A graph method for keyword-based selection of the top-K databases

While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to perform effective retrieval. Since these requirements pose a problem to lay or occasional users, several methods incorporate keyword search (KS) into relational databases. However, most of the existing techniques focus on querying a single DBMS. On the other hand, the proliferation of distributed databases in several conventional and emerging applications necessitates the support for keyword-based data sharing and querying over multiple DMBSs. In order to avoid the high cost of searching in numerous, potentially irrelevant, databases in such systems, we propose G-KS, a novel method for selecting the top-K candidates based on their potential to contain results for a given query. G-KS summarizes each database by a keyword relationship graph, where nodes represent terms and edges describe relationships between ...

• Type: Conference
• Year: 2008
• Where: SIGMOD
• Authors: Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, Anthony K. H. Tung
• Keywords: Database, Databases General Terms, Keywords Distributed Databases, Relational Databases, SIGMOD 2008