Skip to main content
SpringerLink
Log in

Indexed Tree Matching with Complete Answer Representations

  • Conference paper
  • First Online:
Principles of Digital Document Processing (PODDP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1481))

Included in the following conference series:

Abstract

This paper picks up the Tree Matching approach to integrate the paradigm of structured documents into the field of Information Retrieval. The concept of Tree Matching is extended by the notion of complete answer representations (CARs), which makes it possible to avoid the combinatorial explosion in the number of solutions (and thus complexity). An algorithm is presented that combines a class of Tree Matching problems with index-based search and returns a CAR in linear time.

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

Access this chapter

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Kilpeläinen. Tree Matching Problems with Applications to Structured Text databases. PhD thesis, Dept. of Computer Science, University of Helsinki, 1992.

    Google Scholar 

  2. P. Kilpeläinen and H. Mannila. Retrieval from hierarchical texts by partial patterns. In Proc. ACM SIGIR’93, pages 214–222, 1993.

    Google Scholar 

  3. A. Loeffen. Text databases: A survey of text models and systems. SIGMOD Record, 23(1):97–106, March 1994.

    Article  Google Scholar 

  4. G. Navarro and R. Baeza-Yates. A language for queries on structure and contents of textual databases. In Proc. ACM SIGIR’95, pages 93–101, 1995.

    Google Scholar 

  5. G. Navarro and R. Baeza-Yates. Integrating contents and structure in text retrieval. SIGMOD Record, 25(1):67–79, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Information and Language Processing, University of Munich, Munich

    Holger Meuss

Authors
  1. Holger Meuss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI, 53211, USA

    Ethan V. Munson

  2. Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, 1000 Hilltop Circle, Baltimore, MD, 21250, USA

    Charles Nicholas

  3. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR

    Derick Wood

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meuss, H. (1998). Indexed Tree Matching with Complete Answer Representations. In: Munson, E.V., Nicholas, C., Wood, D. (eds) Principles of Digital Document Processing. PODDP 1998. Lecture Notes in Computer Science, vol 1481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49654-8_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-49654-8_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65086-7

  • Online ISBN: 978-3-540-49654-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation