Progressive Ranking for Efficient Keyword Search over Relational Databases

Authors:
Guoliang Li;Jianhua Feng;Feng Lin;Lizhu Zhou
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084;Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084;Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084;Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084
Venue:
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
Year:
2008

Citing 9
Cited 1

Keyword Searching and Browsing in Databases using BANKS

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Bidirectional expansion for keyword search on graph databases

VLDB '05 Proceedings of the 31st international conference on Very large data bases
BLINKS: ranked keyword searches on graphs

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
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
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
EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data

Proceedings of the 2008 ACM SIGMOD international conference on Management of data

Retune: Retrieving and Materializing Tuple Units for Effective Keyword Search over Relational Databases

ER '08 Proceedings of the 27th International Conference on Conceptual Modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The existing approaches of keyword search over relational databases usually first generate all possible results composed of relevant tuples and then sort them based on their individual ranks. These traditional methods are inefficient to identify the top-kanswers with the highest ranks. This paper studies the problem of progressively identifying the top-kanswers from the relational databases. The approach of progressively identifying the answers is very desirable as it generates the higher ranked results earlier thereby reducing the delay in responding to the user query. We have implemented our proposed method, and the experimental results show that our method outperforms existing state-of-the-art approaches and achieves much better search performance.