Skip to main content

EasyKSORD: A Platform of Keyword Search Over Relational Databases

  • Conference paper
Book cover Web Information Systems and Mining (WISM 2009)

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

Included in the following conference series:

  • 997 Accesses

Abstract

Keyword Search Over Relational Databases (KSORD) enables casual users to use keyword queries (a set of keywords) to search relational databases just like searching the Web, without any knowledge of the database schema or any need of writing SQL queries. Based on our previous work, we design and implement a novel KSORD platform named EasyKSORD for users and system administrators to use and manage different KSORD systems in a novel and simple manner. EasyKSORD supports advanced queries, efficient data-graph-based search engines, multiform result presentations, and system logging and analysis. Through EasyKSORD, users can search relational databases easily and read search results conveniently, and system administrators can easily monitor and analyze the operations of KSORD and manage KSORD systems much better.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Wang, S., Zhang, K.L.: Searching Databases with Keywords. J. Comput. Sci. Tech. 20(1), 55–62 (2005)

    Article  Google Scholar 

  2. Wang, S., Zhang, J., Peng, Z.H., Zhan, J., Wang, Q.Y.: Study on Efficiency and Effectiveness of KSORD. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds.) APWeb/WAIM 2007. LNCS, vol. 4505, pp. 6–17. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Bhalotia, G., Hulgery, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword Searching and Browsing in Databases using BANKS. In: Agrawal, R., et al. (eds.) Proc. of the 18th Int’l. Conf. on Data Engineering, pp. 431–440. IEEE Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  4. Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional Expansion for Keyword Search on Graph Databases. In: Böhm, K., et al. (eds.) Proc. of the 31st Int’l. Conf. on Very Large Data Bases, pp. 505–516. ACM, New York (2005)

    Google Scholar 

  5. Balmin, A., Hristidis, V., Papakonstantinou, Y.: ObjectRank: Authority-Based Keyword Search in Databases. In: Nascimento, M.A., et al. (eds.) Proc. of the 30th Int’l. Conf. on Very Large Data Bases, pp. 564–575. Morgan Kaufmann Publishers, San Francisco (2004)

    Google Scholar 

  6. Wang, S., Peng, Z.H., Zhang, J., Qin, L., Wang, S., Yu, J., Ding, B.L.: NUITS: A Novel User Interface for Efficient Keyword Search over Databases. In: Dayal, U., et al. (eds.) Proc. of the 32nd Int’l. Conf. on Very Large Data Bases, pp. 1143–1146. ACM, New York (2006)

    Google Scholar 

  7. Ding, B.L., Yu, J., Wang, S., Qin, L., Zhang, X., Lin, X.M.: Finding Top-k Min-Cost Connected Trees in Databases. In: Proc. of the 23rd Int’l. Conf. on Data Engineering, pp. 836–845. IEEE Press, Los Alamitos (2007)

    Chapter  Google Scholar 

  8. Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: A system for keyword-based search over relational databases. In: Agrawal, R., et al. (eds.) Proc. of the 18th Int’l. Conf. on Data Engineering, pp. 5–16. IEEE Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  9. Hristidis, V., Papakonstantinou, Y.: DISCOVER: Keyword search in relational databases. In: Bernstein, P.A., et al. (eds.) Proc. of the 28th Int’l. Conf. on Very Large Data Bases, pp. 670–681. Morgan Kaufmann Publishers, San Francisco (2002)

    Chapter  Google Scholar 

  10. Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: Freytag, J.C., et al. (eds.) Proc. of the 29th Int’l. Conf. on Very Large Data Bases, pp. 850–861. Morgan Kaufmann Publishers, San Francisco (2003)

    Google Scholar 

  11. Wen, J.J., Wang, S.: SEEKER: Keyword-based Information Retrieval Over Relational Databases. Journal of Software 16(7), 1270–1281 (2005)

    Article  Google Scholar 

  12. Luo, Y., Lin, X.M., Wang, W., Zhou, X.F.: SPARK: Top-k Keyword Query in Relational Databases. In: Chan, C.Y., et al. (eds.) Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 115–126. ACM, New York (2007)

    Google Scholar 

  13. Peng, Z.H., Zhang, J., Wang, S., Qin, L.: TreeCluster: Clustering Results of Keyword Search over Databases. In: Yu, J.X., Kitsuregawa, M., Leong, H.-V. (eds.) WAIM 2006. LNCS, vol. 4016, pp. 385–396. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Peng, Z.H., Zhang, J., Wang, S.: S-CBR: Presenting Results of Keyword Search over Databases Based on Database Schema. Journal of Software 19(2), 323–337 (2008)

    Article  MathSciNet  Google Scholar 

  15. Peng, Z.H.: A Study on New Result Presentation Technology of Keyword Search over Databases. Doctoral Thesis, Renmin University of China (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peng, Z., Li, J., Wang, S. (2009). EasyKSORD: A Platform of Keyword Search Over Relational Databases. In: Liu, W., Luo, X., Wang, F.L., Lei, J. (eds) Web Information Systems and Mining. WISM 2009. Lecture Notes in Computer Science, vol 5854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05250-7_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05250-7_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05249-1

  • Online ISBN: 978-3-642-05250-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics