On the complexity of designing optimal partial-match retrieval systems

DOI10.1145/319996.320004zbMath0548.68100OpenAlexW1964803574MaRDI QIDQ3340208

Shlomo Moran

Publication date: 1983

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/319996.320004

zbMATH Keywords

NP-hardheuristic algorithmsapproximation algorithmssearchinghashinginformation retrieval systemfile organizationpartial match retrievalpartial match queries

Mathematics Subject Classification ID

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

Related Items (2)

Multi-attribute hashing with multiple file copies for high performance partial-match retrieval ⋮ Optimal dynamic multi-attribute hashing for range queries

This page was built for publication: On the complexity of designing optimal partial-match retrieval systems