The Community for Technology Leaders
2009 IEEE 25th International Conference on Data Engineering (2009)
Mar. 29, 2009 to Apr. 2, 2009
ISSN: 1084-4627
ISBN: 978-0-7695-3545-6
pp: 1183-1186
ABSTRACT
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as the minimum Steiner tree problem is known to be NP-hard. Further, these methods cannot benefit from DBMS capabilities. We propose a new concept called Compact Steiner Tree (CSTree), which can be used to approximate the Steiner tree problem for answering top-k keyword queries efficiently. We propose a structure-aware index, together with an effective ranking mechanism for fast, progressive and accurate retrieval of $top$-$k$ highest ranked CSTrees. The proposed techniques can be implemented using a standard RDBMS to benefit from its indexing and query processing capability. The experimental results show that our method achieves high search efficiency and result quality comparing to existing state-of-the-art approaches.
INDEX TERMS
Progressive Search; Database; Compact Steiner Tree
CITATION

X. Zhou, J. Feng, J. Wang and G. Li, "Progressive Keyword Search in Relational Databases," 2009 IEEE 25th International Conference on Data Engineering(ICDE), vol. 00, no. , pp. 1183-1186, 2009.
doi:10.1109/ICDE.2009.196
95 ms
(Ver 3.3 (11022016))