Chapter

Combinatorial Pattern Matching

Volume 4009 of the series Lecture Notes in Computer Science pp 24-35

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

  • Jérémy BarbayAffiliated withLancaster UniversityDavid R. Cheriton School of Computer Science, University of Waterloo
  • , Alexander GolynskiAffiliated withLancaster UniversityDavid R. Cheriton School of Computer Science, University of Waterloo
  • , J. Ian MunroAffiliated withLancaster UniversityDavid R. Cheriton School of Computer Science, University of Waterloo
  • , S. Srinivasa RaoAffiliated withLancaster UniversityComputational Logic and Algorithms group, IT University of Copenhagen

* Final gross prices may vary according to local VAT.

Get Access

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