Pages that link to "Item:Q4096474"
From MaRDI portal
The following pages link to Partial-Match Retrieval Algorithms (Q4096474):
Displaying 32 items.
- A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
- Simple, compact and robust approximate string dictionary (Q405575) (← links)
- On the variance of a class of inductive valuations of data structures for digital search (Q672993) (← links)
- The hierarchical ordering in multiattribute files (Q760202) (← links)
- Partial match retrieval in implicit data structures (Q800083) (← links)
- Multi-attribute hashing with multiple file copies for high performance partial-match retrieval (Q911259) (← links)
- Interpolation-based index maintenance (Q1050774) (← links)
- Optimal information retrieval when queries are not random (Q1061507) (← links)
- Disk allocation methods for binary Cartesian product files (Q1075064) (← links)
- Optimal multidisk partial match file designs (Q1111781) (← links)
- Partial-match retrieval for dynamic files (Q1162834) (← links)
- The FX distribution method for parallel processing of partial match queries (Q1178233) (← links)
- Optimality criteria of the disk modulo allocation method for Cartesian product files (Q1182608) (← links)
- Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics (Q1193847) (← links)
- Heuristics for partial-match retrieval data base design (Q1223153) (← links)
- Non-uniform partial-match file designs (Q1241069) (← links)
- Associative retrieval trie hash-coding (Q1252726) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- Optimal dynamic multi-attribute hashing for range queries (Q1317859) (← links)
- Some properties of optimal cartesian product files for orthogonal range queries (Q1369170) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- A note on allocating k-ary multiple key hashing files among multiple disks (Q2638766) (← links)
- On the Stack-Size of General Tries (Q2771494) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- Searching and Indexing Circular Patterns (Q3305518) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- The complexity of lexicographic sorting and searching (Q3920657) (← links)
- Partial match retrieval (Q4131628) (← links)
- (Q4521556) (← links)
- (Q5136259) (← links)
- Partial match queries in random quadtrees (Q5743457) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
