Skip to main content
SpringerLink
Log in
Book cover

An Introduction to XML Query Processing and Keyword Search pp 233–265Cite as

XML Keyword Pattern Refinement

  • Chapter
  • First Online:

  • 1139 Accesses

Abstract

In XML keyword search, users’ queries usually contain irrelevant or mismatched terms, typos, etc., which may easily lead to empty or meaningless results. In this chapter, we first introduce the problem of content-aware XML keyword query refinement, aiming to integrate the job of finding the desired refined queries and generating their matching results as a single problem. Furthermore, a statistics-based query ranking model, which takes into account of both keyword dependencies and the relevance, is proposed. The ranking model evaluates the quality of a refined query, which captures the morphological/semantic similarity between the original query and refined queries and the dependency of keywords of the refined queries over the XML data. In addition, two adaptive query refinement algorithms are also proposed. Finally, we experimentally demonstrate the efficiency and effectiveness of the approach presented in this chapter.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    To facilitate our discussion, the dissimilarity score of a single term deletion rule is 2 throughout all examples in this chapter.

  2. 2.

    http://www.ibiblio.org/xml/books/biblegold/examples/baseball/

  3. 3.

    http://xmldb.ddns.comp.nus.edu.sg

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, Washington, DC (1993)

    Google Scholar 

  2. Bao, Z., Chen, B., Ling, T.W., Lu, J.: Demonstrating effective ranked XML keyword search with meaningful result display. In: DASFAA 2009, Brisbane (2009)

    Google Scholar 

  3. Bao, Z., Ling, T.W., Chen, B., Lu, J.: Effective XML keyword search with relevance oriented ranking. In: ICDE, Shanghai (2009)

    Google Scholar 

  4. Fellbaum, F.C.: WordNet: a electronic lexical database. Cambridge, MA: MIT Press (1998)

    Google Scholar 

  5. Fain, D.C., Pedersen, J.O.: Sponsored search. In: Bulletin of the American Society for Information Science and Technology (2005)

    Google Scholar 

  6. Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: ranked keyword search over XML documents. In: SIGMOD, San Diego (2003)

    Google Scholar 

  7. Guo, J., Xu, G., Li, H., Cheng, X.: A unified and discriminative model for query refinement. In: SIGIR, Singapore (2008)

    Google Scholar 

  8. Jarvelin, K., Kekalainen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20(4), 422 (2002)

    Google Scholar 

  9. Jones, R., Rey, B., Madani, O., Greiner, W.: Generating query substitutions. In: WWW (2006)

    Google Scholar 

  10. Liu, Z., Chen, Y.: Identifying meaningful return information for XML keyword search. In: SIGMOD, Beijing (2007)

    Google Scholar 

  11. Liu, Z., Chen, Y.: Reasoning and identifying relevant matches for XML keyword search. PVLDB 1(1), 921–932 (2008)

    Google Scholar 

  12. Li, Y., Yu, C., Jagadish, H.V.: Schema-free XQuery. In: VLDB, Toronto, pp. 72–83 (2004)

    Google Scholar 

  13. Mass, Y., Mandelbrod, M.: Component ranking and automatic query refinement for XML retrieval. In: INEX, Dagstuhl (2004)

    Google Scholar 

  14. Pan, H., Theobald, A., Schenkel, R.: Query refinement by relevance feedback in an XML retrieval system. In: ER, Shanghai (2004)

    Google Scholar 

  15. Pu, K.Q., Yu, X.: Keyword query cleaning. In: VLDB, Auckland (2008)

    Google Scholar 

  16. Jones, R., Fain, D.: Query word deletion prediction. In: SIGIR, Toronto (2003)

    Google Scholar 

  17. Ruthven, I.: Re-examining the potential effectiveness of interactive query expansion. In: SIGIR, Toronto (2003)

    Google Scholar 

  18. Sun, C., Chan, C.Y., Goenka, A.K.: Multiway SLCA-based keyword search in XML data. In: WWW, 2007, Banff (2007)

    Google Scholar 

  19. Theobald, M., Bast, H., Majumdar, D., Schenkel, R., Weikum, G.: Topx: efficient and versatile top-k query processing for semistructured data. VLDB J. 17(1), 81–115 (2008)

    Google Scholar 

  20. Xu, J., Croft, W.B.: Improving the effectiveness of information retrieval with local context analysis. ACM Trans. Inf. Syst. 18(1), 79–112 (2000)

    Google Scholar 

  21. Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest LCAs in XML databases. In: SIGMOD, Baltimore (2005)

    Google Scholar 

  22. Xu, Y., Papakonstantinou, Y.: Efficient LCA based keyword search in XML data. In: EDBT, Nantes (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information, Renmin University of China, Beijing, People’s Republic of China

    Jiaheng Lu

Authors
  1. Jiaheng Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Tsinghua University Press, Beijing and Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Lu, J. (2013). XML Keyword Pattern Refinement. In: An Introduction to XML Query Processing and Keyword Search. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34555-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34555-5_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34554-8

  • Online ISBN: 978-3-642-34555-5

  • eBook Packages: Computer Science

Publish with us

Policies and ethics

Search

Navigation