Partial match retrieval in implicit data structures

DOI10.1016/0020-0190(84)90098-XMaRDI QIDQ800083zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complexityanalysis of algorithmslower boundscomparison modeloptimal algorithmscombinatorial problemsdata managementpartial match querypartial match retrievalimplicit data structures

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4014072
• On the complexity of designing optimal partial-match retrieval systems
• On the File Design Problem for Partial Match Retrieval
• Partial match queries in relaxed multidimensional search trees
• Partial-match retrieval using hashing and descriptors

Cites work

• scientific article; zbMATH DE number 3729460 (Why is no real title available?)
• Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes
• Implicit Data Structures for the Dictionary Problem
• Implicit data structures for fast search and update
• Multidimensional binary search trees used for associative searching
• Partial-Match Retrieval Algorithms
• Searching Semisorted Tables
• Should Tables Be Sorted?

Cited in

(10)

• An implicit data structure for searching a multikey table in logarithmic time
• An efficient implicit data structure for relation testing and searching in partially ordered sets
• A pointer-free data structure for merging heaps and min-max heaps
• A Survey of Data Structures in the Bitprobe Model
• A data structure for lattice representation
• A tradeoff between search and update time for the implicit dictionary problem
• Succinct and Implicit Data Structures for Computational Geometry
• Multidimensional extendible hashing for partial-match queries
• Computing (and Life) Is All about Tradeoffs
• Higher-order associative commutative pattern matching for component retrieval

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)