Skip to main content

Aiming for Efficiency by Detecting Structural Similarity

  • Conference paper

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

Abstract

When applying XML-Retrieval in a distributed setting, efficiency issues have to be considered, e.g. reducing the network traffic involved in an swering a given query. The new Efficiency Track of INEX gave us the opportu nity to explore the possibility of improving both effectiveness and efficiency by exploiting structural similarity. We ran some of the track’s highly structured queries on our top-k search engine to analyze the impact of various structural similarity functions. We applied those functions first to the ranking and based on that to the query routing process. Our results indicate that detection of structural similarity can be used in order to re duce the amount of messages sent between distributed nodes and thus lead to more efficiency of the search.

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. Amer-Yahia, S., Koudas, N., Marian, A., Srivastava, D., Toman, D.: Structure and Content Scoring for XML. In: Proc. of VLDB, Trondheim, Norway (2005)

    Google Scholar 

  2. Carmel, D., Maarek, Y., Mandelbrod, Mass, Y.: Soffer: Searching XML Documents via XML Fragments. In: Proc. of the 26th Int. ACM SIGIR, Toronto, Canada (2003)

    Google Scholar 

  3. Ciaccia, P., Penzo, W.: Adding Flexibility to Structure Similarity Queries on XML Data. In: Andreasen, T., Motro, A., Christiansen, H., Larsen, H.L. (eds.) FQAS 2002. LNCS (LNAI), vol. 2522. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10, 707–710 (1966)

    MathSciNet  MATH  Google Scholar 

  5. Vinson, A., Heuser, C., Da Silva, A., De Moura, E.: An Approach to XML Path Matching. In: WIDM 2007, Lisboa, Portugal, November 9 (2007)

    Google Scholar 

  6. Winter, J., Drobnik, O.: University of Frankfurt at INEX2008 – An Approach For Distributed XML-Retrieval . In: Preproc. of INEX 2008, Dagstuhl, Germany (2008)

    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

Winter, J., Jeliazkov, N., Kühne, G. (2009). Aiming for Efficiency by Detecting Structural Similarity. In: Geva, S., Kamps, J., Trotman, A. (eds) Advances in Focused Retrieval. INEX 2008. Lecture Notes in Computer Science, vol 5631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03761-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03761-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03760-3

  • Online ISBN: 978-3-642-03761-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics