Publication:4828998

From MaRDI portal


zbMath1093.68588MaRDI QIDQ4828998

No author found.

Publication date: 29 November 2004



68P05: Data structures

68P20: Information storage and retrieval of data


Related Items

Forty Years of Text Indexing, Unnamed Item, Spaces, Trees, and Colors, Succinct Color Searching in One Dimension, Practical Compact Indexes for Top-kDocument Retrieval, Unnamed Item, Compressed indexes for approximate string matching, Ranked Document Retrieval in External Memory, Enumerating Range Modes, Linear-space data structures for range frequency queries on arrays and trees, Document retrieval with one wildcard, Reporting consecutive substring occurrences under bounded gap constraints, Indexing and querying color sets of images, Compact binary relation representations with rich functionality, Colored range queries and document retrieval, On compressing and indexing repetitive sequences, Top-\(k\) document retrieval in optimal space, Cross-document pattern matching, A new efficient indexing algorithm for one-dimensional real scaled patterns, New algorithms on wavelet trees and applications to information retrieval, Improved space-time tradeoffs for approximate full-text indexing with one edit error, Efficient index for retrieving top-\(k\) most frequent documents, Cache oblivious algorithms for the RMQ and the RMSQ problems, On space efficient two dimensional range minimum data structures, Fast set intersection and two-patterns matching, Tree path majority data structures, Succinct data structures for flexible text retrieval systems, Text indexing with errors, Property matching and weighted matching, Optimal prefix and suffix queries on texts, Approximate colored range and point enclosure queries, Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines, Space-efficient indexes for forbidden extension queries, Universal compressed text indexing, Ranked document retrieval for multiple patterns, A simple algorithm for computing the document array, New space/time tradeoffs for top-\(k\) document retrieval on sequences, Range majorities and minorities in arrays, Internal dictionary matching, Lempel-Ziv compressed structures for document retrieval, Indexing weighted sequences: neat and efficient, Ranked document selection, On hardness of several string indexing problems, Improved and extended locating functionality on compressed suffix arrays, Top-\(k\) term-proximity in succinct space, On succinct representations of binary trees, Indexing factors with gaps, Algorithms to compute the Burrows-Wheeler similarity distribution, Wavelet trees for all, Fast relative Lempel-Ziv self-index for similar sequences, Languages with mismatches, Document listing on repetitive collections with guaranteed performance, I/O-optimal categorical 3-sided skyline queries, General Document Retrieval in Compact Space, Orthogonal Range Searching for Text Indexing, Array Range Queries, Indexes for Document Retrieval with Relevance, Ranked Document Retrieval with Forbidden Pattern, Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints, Efficient range searching for categorical and plain data, Time-Optimal Top-$k$ Document Retrieval, Self-indexing Based on LZ77, Counting Colours in Compressed Strings, Space-Efficient Frameworks for Top- k String Retrieval