Skip to main content

Evaluating Interconnection Relationship for Path-Based XML Retrieval

  • Conference paper
Web Information Systems – WISE 2006 (WISE 2006)

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

Included in the following conference series:

Abstract

As one of popular solutions for meaningful result determination, interconnection relationship has been accepted widely by search engines. However, it suffers from heavy storage overhead and serious time complexity of index construction and query evaluation. We extend the retrieval syntax to support path query for partial structural information, propose a variant of interconnection relationship, and present an efficient evaluation algorithm with the extended structural summaries. The experiments show that with the promise of meaningful answers, our approach offers great performance benefits of evaluating interconnection relationship at run time.

Supported by the National Natural Science Foundation of China (No. 60573090).

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. Cohen, S., Mamou, J., Kanza, Y., Sagiv, Y.: XSearch: a semantic search engine for XML. In: Proc. of VLDB, pp. 45–56 (2003)

    Google Scholar 

  2. Li, X.G., Gong, J., Wang, D.L., Yu, G.: An effective and efficient approach for keyword-based XML retrieval. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol. 3739, pp. 56–67. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Goldman, R., Widom, J.: DataGuides: enabling query formulation and optimization in semistructured databases. In: Proc. of VLDB, pp. 436–445 (1997)

    Google Scholar 

  4. Kaushik, R., Shenoy, P., et al.: Exploiting local similarity for indexing paths in graph-structured data. In: Proc. of ICDE, pp. 129–140 (2002)

    Google Scholar 

  5. Schmidt, A., Kersten, M., Windhouwer, M.: Querying XML document made easy: nearest concept queries. In: Proc. of ICDE, p. 321 (2001)

    Google Scholar 

  6. GuoL., Shao, F., Botev, C., Shanmugasundaram, J.: XRank: ranked keyword search over XML documents. In: Proc. of SIGMOD, pp. 16–27 (2003)

    Google Scholar 

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

    Google Scholar 

  8. Fuhr, N., Grobjoham, K.: XIRQL: a query language for information retrieval in XML document. In: Proc. of SIGIR (2001)

    Google Scholar 

  9. Theobald, A., Weikum, G.: The index-based XXL search engine for querying XML data with relevance ranking. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, p. 477. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Cohen, S., Kanza, Y., Kogan, Y., et al.: EquiX: a search and query language for XML. In: Proc. of JASIST (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, X., Yu, G., Wang, D., Song, B. (2006). Evaluating Interconnection Relationship for Path-Based XML Retrieval. In: Aberer, K., Peng, Z., Rundensteiner, E.A., Zhang, Y., Li, X. (eds) Web Information Systems – WISE 2006. WISE 2006. Lecture Notes in Computer Science, vol 4255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11912873_52

Download citation

  • DOI: https://doi.org/10.1007/11912873_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48105-8

  • Online ISBN: 978-3-540-48107-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics