Non-uniform partial-match file designs

DOI10.1016/0304-3975(77)90040-8zbMath0364.68091OpenAlexW2066750603MaRDI QIDQ1241069

Walter A. Burkhard

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(77)90040-8

Mathematics Subject Classification ID

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

Related Items (1)

Associative retrieval trie hash-coding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for partial-match retrieval data base design
• Quad trees: A data structure for retrieval by composite keys
• Multidimensional binary search trees used for associative searching
• Partial-Match Retrieval Algorithms
• Partial match retrieval
• A formal system for information retrieval from files

This page was built for publication: Non-uniform partial-match file designs