Optimal Partial-Match Hashing Design
From MaRDI portal
Publication:4025899
DOI10.1287/IJOC.3.2.86zbMATH Open0760.68025OpenAlexW2151710517MaRDI QIDQ4025899FDOQ4025899
Authors: Raj Jagannathan
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.3.2.86
Recommendations
central limit theoreminteger programmingstochastic modelinginformation retrievalpseudopolynomial algorithmshashing design
Cited In (8)
- Partial-match retrieval using hashing and descriptors
- On the complexity of designing optimal partial-match retrieval systems
- On the File Design Problem for Partial Match Retrieval
- Multidimensional extendible hashing for partial-match queries
- Optimality in external memory hashing
- Optimal information retrieval when queries are not random
- Concatenated hash code selection
- Hash function design for cloud storage data auditing
This page was built for publication: Optimal Partial-Match Hashing Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025899)