Partial match retrieval in implicit data structures
DOI10.1016/0020-0190(84)90098-XzbMATH Open0549.68033OpenAlexW2081250249MaRDI QIDQ800083FDOQ800083
Authors: K. Mehlhorn, J. Ian Munro, Helmut Alt 
Publication date: 1984
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(84)90098-x
Recommendations
complexityanalysis of algorithmslower boundscomparison modeloptimal algorithmscombinatorial problemsdata managementpartial match querypartial match retrievalimplicit data structures
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)
Cites Work
- Should Tables Be Sorted?
- Multidimensional binary search trees used for associative searching
- Partial-Match Retrieval Algorithms
- Implicit data structures for fast search and update
- Implicit Data Structures for the Dictionary Problem
- Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes
- Searching Semisorted Tables
- Title not available (Why is that?)
Cited In (10)
- A Survey of Data Structures in the Bitprobe Model
- A data structure for lattice representation
- Multidimensional extendible hashing for partial-match queries
- A pointer-free data structure for merging heaps and min-max heaps
- A tradeoff between search and update time for the implicit dictionary problem
- An implicit data structure for searching a multikey table in logarithmic time
- Succinct and Implicit Data Structures for Computational Geometry
- Higher-order associative commutative pattern matching for component retrieval
- Computing (and Life) Is All about Tradeoffs
- An efficient implicit data structure for relation testing and searching in partially ordered sets
This page was built for publication: Partial match retrieval in implicit data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800083)
