Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
Rank/select operations on large alphabets: a tool for text indexing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Theoretical Computer Science
Optimal lower bounds for rank and select indexes
Theoretical Computer Science
Rank and select revisited and extended
Theoretical Computer Science
On the Redundancy of Succinct Data Structures
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An experimental investigation of set intersection algorithms for text searching
Journal of Experimental Algorithmics (JEA)
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
k2-Trees for Compact Web Graph Representation
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
Theoretical Computer Science
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Compact rich-functional binary relation representations
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Succinct Representation of Labeled Graphs
Algorithmica
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Extended compact web graph representations
Algorithms and Applications
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
On compressing and indexing repetitive sequences
Theoretical Computer Science
Space-efficient data-analysis queries on grids
Theoretical Computer Science
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Binary relations are an important abstraction arising in many data representation problems. The data structures proposed so far to represent them support just a few basic operations required to fit one particular application. We identify many of those operations arising in applications and generalize them into a wide set of desirable queries for a binary relation representation. We also identify reductions among those operations. We then introduce several novel binary relation representations, some simple and some quite sophisticated, that not only are space-efficient but also efficiently support a large subset of the desired queries.