Advertisement

Progressive Ranking for Efficient Keyword Search over Relational Databases

  • Guoliang Li
  • Jianhua Feng
  • Feng Lin
  • Lizhu Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5071)

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-k answers with the highest ranks. This paper studies the problem of progressively identifying the top-k answers 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431–440 (2002)Google Scholar
  2. 2.
    Ding, B., Yu, J.X., Wang, S., et al.: Finding top-k min-cost connected trees in databases. In: ICDE (2007)Google Scholar
  3. 3.
    He, H., Wang, H., Yang, J., Yu, P.: Blinks: Ranked keyword searches on graphs. In: SIGMOD (2007)Google Scholar
  4. 4.
    Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient ir-style keyword search over relational databases. In: VLDB, pp. 850–861 (2003)Google Scholar
  5. 5.
    Hristidis, V., Papakonstantinou, Y.: Discover: Keyword search in relational databases. In: VLDB, pp. 670–681 (2002)Google Scholar
  6. 6.
    Kacholia, V., Pandit, S., et al.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505–516 (2005)Google Scholar
  7. 7.
    Li, G., Feng, J., Wang, J., Zhou, L.: Efficient keyword search for valuable lcas over xml documents. In: CIKM (2007)Google Scholar
  8. 8.
    Li, G., Feng, J., Wang, J., Zhou, L.: Race: Finding and ranking compact connected trees for keyword proximity search over xml documents. In: WWW (2008)Google Scholar
  9. 9.
    Li, G., Feng, J., Wang, J., Zhou, L.: Sailer: An effective search engine for unified retrieval of heterogeneous xml and web documents. In: WWW (2008)Google Scholar
  10. 10.
    Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: 3-in-1: Efficient and adaptive keyword search on unstructured, semi-structured and structured data. In: SIGMOD (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Guoliang Li
    • 1
  • Jianhua Feng
    • 1
  • Feng Lin
    • 1
  • Lizhu Zhou
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations