Partial-Match Retrieval Algorithms
From MaRDI portal
Publication:4096474
DOI10.1137/0205003zbMath0331.68064OpenAlexW2155631901MaRDI QIDQ4096474
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fd18fc67eb131d9224cf53bfe3eb609f2ca62bda
Symbolic computation and algebraic computation (68W30) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (32)
A note on allocating k-ary multiple key hashing files among multiple disks ⋮ Optimal multidisk partial match file designs ⋮ Some properties of optimal cartesian product files for orthogonal range queries ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ Simple, compact and robust approximate string dictionary ⋮ Fast circular dictionary-matching algorithm ⋮ Multi-attribute hashing with multiple file copies for high performance partial-match retrieval ⋮ Partial-match retrieval for dynamic files ⋮ The FX distribution method for parallel processing of partial match queries ⋮ Optimality criteria of the disk modulo allocation method for Cartesian product files ⋮ Searching and Indexing Circular Patterns ⋮ String-Matching and Alignment Algorithms for Finding Motifs in NGS Data ⋮ On the variance of a class of inductive valuations of data structures for digital search ⋮ Unnamed Item ⋮ Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics ⋮ The complexity of lexicographic sorting and searching ⋮ Partial match retrieval ⋮ On the Stack-Size of General Tries ⋮ Heuristics for partial-match retrieval data base design ⋮ Non-uniform partial-match file designs ⋮ Cell-probe lower bounds for the partial match problem ⋮ Associative retrieval trie hash-coding ⋮ On data structures and asymmetric communication complexity ⋮ The hierarchical ordering in multiattribute files ⋮ Unnamed Item ⋮ Partial match queries in random quadtrees ⋮ Interpolation-based index maintenance ⋮ A new algorithm for optimal 2-constraint satisfaction and its implications ⋮ Partial match retrieval in implicit data structures ⋮ Optimal information retrieval when queries are not random ⋮ Optimal dynamic multi-attribute hashing for range queries ⋮ Disk allocation methods for binary Cartesian product files
This page was built for publication: Partial-Match Retrieval Algorithms
