XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
DBXplorer: A System for Keyword-Based Search over Relational Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Indexing Relational Database Content Offline for Efficient Keyword-Based Search
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Effective keyword search in relational databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Spark: top-k keyword query in relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Effective keyword-based selection of relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Keyword search on relational data streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient IR-style keyword search over relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Effective keyword search for valuable lcas over xml documents
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficiently answering top-k typicality queries on large databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Depth estimation for ranking query optimization
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Anytime measures for top-k algorithms
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient keyword search over virtual XML views
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
Proceedings of the 17th international conference on World Wide Web
Sailer: an effective search engine for unified retrieval of heterogeneous xml and web documents
Proceedings of the 17th international conference on World Wide Web
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Progressive Ranking for Efficient Keyword Search over Relational Databases
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
An effective and versatile keyword search engine on heterogenous data sources
Proceedings of the VLDB Endowment
KESOSD: keyword search over structured data
KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
Hi-index | 0.00 |
The existing approaches of keyword search over relational databases always identify the relationships between tuples on the fly, which are rather inefficient as such relational relationships are very rich in the underlying databases. Alternatively, this paper proposes an alternative way by retrieving and materializing tuple units for facilitating the online processing of keyword search. We first propose a novel concept of tupleunits, which are composed of the relevant tuples connected by the primary-foreign-key relationships. We then demonstrate how to generate and materialize the tuple units, and the technique for generating the tuple units can be done by issuing SQL statements and thus can be performed directly on the underlying RDBMS without modification to the database engine. Finally, we examine the techniques of indexing and ranking to improve the search efficiency and search quality. We have implemented our method and the experimental results show that our approach achieves much better search performance, and outperforms the alternative literatures significantly.