Partial match retrieval in implicit data structures

DOI10.1016/0020-0190(84)90098-XzbMath0549.68033OpenAlexW2081250249MaRDI QIDQ800083

Kurt 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

zbMATH Keywords

complexitycombinatorial problemsanalysis of algorithmslower boundsdata managementcomparison modeloptimal algorithmspartial match querypartial match retrievalimplicit data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (8)

An efficient implicit data structure for relation testing and searching in partially ordered sets ⋮ A tradeoff between search and update time for the implicit dictionary problem ⋮ A data structure for lattice representation ⋮ A pointer-free data structure for merging heaps and min-max heaps ⋮ An implicit data structure for searching a multikey table in logarithmic time ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ A Survey of Data Structures in the Bitprobe Model

Cites Work

• Unnamed Item
• Implicit data structures for fast search and update
• Searching Semisorted Tables
• Should Tables Be Sorted?
• Implicit Data Structures for the Dictionary Problem
• Multidimensional binary search trees used for associative searching
• Partial-Match Retrieval Algorithms
• Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes

This page was built for publication: Partial match retrieval in implicit data structures