Non-uniform partial-match file designs

DOI10.1016/0304-3975(77)90040-8zbMATH Open0364.68091OpenAlexW2066750603MaRDI QIDQ1241069FDOQ1241069

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

• Quad trees: A data structure for retrieval by composite keys
• Multidimensional binary search trees used for associative searching
• Partial-Match Retrieval Algorithms
• A formal system for information retrieval from files
• Partial match retrieval
• Heuristics for partial-match retrieval data base design
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)