Adaptive searching in succinctly encoded binary relations and tree-structured documents

The methods most heavily used by search engines to answer conjunctive queries on binary relations (such as one associating keywords with web-pages) are based on computing the intersection of postings lists stored as sorted arrays and using variants of binary search. We show that a succinct representation of the binary relation permits much better results, while using less space than traditional methods. 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.

Authors

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

Keywords

• Adaptive algorithms
• Conjunctive queries
• Intersection problem
• Labeled trees
• Multi-labeled trees
• Path queries
• Succinct data structures