Optimal Partial-Match Hashing Design
ORSA Journal on Computing · 1991 · Volume 3 · Issue 2
Abstract
This paper suggests a method for determining an optimal hashing design for answering a partial-match query. Solution methods are suggested for the knapsack-type model, derived under the assumption that the attributes in a query are specified independently. It is further shown that the same nonlinear knapsack-type model holds even when the independence assumption is relaxed. INFORMS Journal on Computing , ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Keywords
computer science: data bases, programming: integer, probability: applications, information retrieval, hashing design, stochastic modeling, central limit theorem, pseudopolynomial algorithms, integer programming
Enable JavaScript for citation tools and additional paper interactions.