Efficient Storage and Retrieval by Content and Address of Static Files
From MaRDI portal
Publication:4404423
DOI10.1145/321812.321820zbMath0278.68028OpenAlexW2057223122MaRDI QIDQ4404423
Publication date: 1974
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321812.321820
Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)
Related Items (33)
Optimal encodings for range majority queries ⋮ Compressed string dictionary search with edit distance one ⋮ Optimal In-place Algorithms for Basic Graph Problems ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Grammar index by induced suffix sorting ⋮ Integer representation and counting in the bit probe model ⋮ Range selection and predecessor queries in data aware space and time ⋮ Fast and simple compact hashing via bucketing ⋮ Graph compression by BFS ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Space-efficient B trees via load-balancing ⋮ Ranked Document Retrieval with Forbidden Pattern ⋮ Engineering Practical Lempel-Ziv Tries ⋮ Compressed string dictionaries via data-aware subtrie compaction ⋮ Sorting and ranking of self-delimiting numbers with applications to tree isomorphism ⋮ Optimal indexes for sparse bit vectors ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Improved space-time tradeoffs for approximate full-text indexing with one edit error ⋮ Efficient Compression and Indexing of Trajectories ⋮ A grouping approach for succinct dynamic dictionary matching ⋮ Minimum times and memories needed to compute the values of a function ⋮ Ranked document retrieval for multiple patterns ⋮ Faster and Space-Optimal Edit Distance “1” Dictionary ⋮ Locally Compressed Suffix Arrays ⋮ Fast Compressed Tries through Path Decompositions ⋮ An Encoding for Order-Preserving Matching. ⋮ Rainbowfish: A Succinct Colored de Bruijn Graph Representation ⋮ Minimal storage representations for binary relations ⋮ Time-space trade-offs for compressed suffix arrays. ⋮ Improved and extended locating functionality on compressed suffix arrays ⋮ New compression schemes for natural number sequences ⋮ Space-efficient substring occurrence estimation ⋮ Adaptive succinctness
This page was built for publication: Efficient Storage and Retrieval by Content and Address of Static Files
