Skip to main content

Progressive Ranking for Efficient Keyword Search over Relational Databases

  • Conference paper
Sharing Data, Information and Knowledge (BNCOD 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5071))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Ding, B., Yu, J.X., Wang, S., et al.: Finding top-k min-cost connected trees in databases. In: ICDE (2007)

    Google Scholar 

  3. He, H., Wang, H., Yang, J., Yu, P.: Blinks: Ranked keyword searches on graphs. In: SIGMOD (2007)

    Google Scholar 

  4. Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient ir-style keyword search over relational databases. In: VLDB, pp. 850–861 (2003)

    Google Scholar 

  5. Hristidis, V., Papakonstantinou, Y.: Discover: Keyword search in relational databases. In: VLDB, pp. 670–681 (2002)

    Google Scholar 

  6. Kacholia, V., Pandit, S., et al.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505–516 (2005)

    Google Scholar 

  7. Li, G., Feng, J., Wang, J., Zhou, L.: Efficient keyword search for valuable lcas over xml documents. In: CIKM (2007)

    Google Scholar 

  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. 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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alex Gray Keith Jeffery Jianhua Shao

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, G., Feng, J., Lin, F., Zhou, L. (2008). Progressive Ranking for Efficient Keyword Search over Relational Databases. In: Gray, A., Jeffery, K., Shao, J. (eds) Sharing Data, Information and Knowledge. BNCOD 2008. Lecture Notes in Computer Science, vol 5071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70504-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70504-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70503-1

  • Online ISBN: 978-3-540-70504-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics