Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

  • Jérémy Barbay
  • Alexander Golynski
  • J. Ian Munro
  • S. Srinivasa Rao
Conference paper

DOI: 10.1007/11780441_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4009)
Cite this paper as:
Barbay J., Golynski A., Munro J.I., Rao S.S. (2006) Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. In: Lewenstein M., Valiente G. (eds) Combinatorial Pattern Matching. CPM 2006. Lecture Notes in Computer Science, vol 4009. Springer, Berlin, Heidelberg

Abstract

The most heavily used methods to answer conjunctive queries on binary relations (such as the one associating keywords with web pages) are based on inverted lists stored in sorted arrays and use variants of binary search. We show that a succinct representation of the binary relation permits much better results, while using space within a lower order term of the optimal. We apply our results not only to conjunctive queries on binary relations, but also to queries on semi-structured documents such as XML documents or file-system indexes, using a variant of an adaptive algorithm used to solve conjunctive queries on binary relations.

Keywords

conjunctive queries intersection problem succinct data structures labeled trees multi-labeled trees 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jérémy Barbay
    • 1
  • Alexander Golynski
    • 1
  • J. Ian Munro
    • 1
  • S. Srinivasa Rao
    • 2
  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooCanada
  2. 2.Computational Logic and Algorithms groupIT University of CopenhagenDenmark

Personalised recommendations