Non-uniform partial-match file designs

DOI10.1016/0304-3975(77)90040-8MaRDI QIDQ1241069zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3569868 (Why is no real title available?)
• scientific article; zbMATH DE number 3265496 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A formal system for information retrieval from files
• Heuristics for partial-match retrieval data base design
• Multidimensional binary search trees used for associative searching
• Partial match retrieval
• Partial-Match Retrieval Algorithms
• Quad trees: A data structure for retrieval by composite keys

Cited in

(1)

• Associative retrieval trie hash-coding

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

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