Partial-Match Retrieval Algorithms

DOI10.1137/0205003MaRDI QIDQ4096474zbMATH OpenOpenAlexFDO

Authors Ronald L. Rivest

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fd18fc67eb131d9224cf53bfe3eb609f2ca62bda

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Cited in

(33)

• Non-uniform partial-match file designs
• Searching and indexing circular patterns
• String-matching and alignment algorithms for finding motifs in NGS data
• A note on allocating k-ary multiple key hashing files among multiple disks
• Simple, compact and robust approximate string dictionary
• On the stack-size of general tries
• Cell-probe lower bounds for the partial match problem
• On the variance of a class of inductive valuations of data structures for digital search
• Optimal multidisk partial match file designs
• Partial match queries in random quadtrees
• Orthogonal vectors indexing
• The complexity of lexicographic sorting and searching
• A limit process for partial match queries in random quadtrees and 2-d trees
• scientific article; zbMATH DE number 1545683 (Why is no real title available?)
• Fast circular dictionary-matching algorithm
• Partial match retrieval
• The hierarchical ordering in multiattribute files
• The FX distribution method for parallel processing of partial match queries
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Optimality criteria of the disk modulo allocation method for Cartesian product files
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
• Partial-match retrieval for dynamic files
• Optimal dynamic multi-attribute hashing for range queries
• Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics
• Partial match retrieval in implicit data structures
• Optimal information retrieval when queries are not random
• On data structures and asymmetric communication complexity
• Some properties of optimal cartesian product files for orthogonal range queries
• Heuristics for partial-match retrieval data base design
• Disk allocation methods for binary Cartesian product files
• Interpolation-based index maintenance
• Pattern masking for dictionary matching: theory and practice
• Associative retrieval trie hash-coding

This page was built for publication: Partial-Match Retrieval Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096474)