Skip to main content

Efficient SLCA-Based Keyword Search on XML Databases: An Iterative-Skip Approach

  • Conference paper
  • 1030 Accesses

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

Abstract

Keyword search is a popular way to discover information from XML data. To return meaningful results, SLCA (smallest lowest common ancestor) has been proposed to identify interesting data nodes. Since the SLCAs are obtained from a series of intermediate LCAs, it can often incur many unnecessary LCA computations even when the size of final results is small. In this paper, we propose an Iterative-Skip approach to address this challenge. We first study the relation between SLCA candidates and propose a series of properties. Then based on these properties, we design a novel skip strategy to skip more SLCA computations. Experimental results show the effectiveness of our approach.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 123–125. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Fischer, J., Heun, V.: Theoretical and practical improvements on the rmq-problem, with applications to lca and lce. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36–48. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: Xrank: Ranked keyword search over xml documents. In: SIGMOD 2003 (2003)

    Google Scholar 

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

    Google Scholar 

  5. Berkeley DB: http://www.oracle.com/database/berkeleydb/index.html

  6. XMark Project, http://www.xmlbenchmark.org/

  7. Liu, Z., Chen, Y.: Identifying meaningful return information for xml keyword search. In: SIGMOD 2007 (2007)

    Google Scholar 

  8. DBLP XML records, http://dblp.unitrier.de/xml/

  9. Sun, C., Chan, C.-Y., Goenka, A.K.: Multiway slca-based keyword search in xml data. In: WWW 2007 (2007)

    Google Scholar 

  10. Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest lcas in xml databases. In: SIGMOD 2005 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, J., He, Z., Tao, Y., Wang, X., Hu, H., Wang, W. (2010). Efficient SLCA-Based Keyword Search on XML Databases: An Iterative-Skip Approach. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds) Database and Expert Systems Applications. DEXA 2010. Lecture Notes in Computer Science, vol 6261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15364-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15364-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-15364-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics