Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
Reads0
Chats0
TLDR
A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.Abstract:
A data structure for representing a set of n items from a umverse of m items, which uses space n + o(n) and accommodates membership queries m constant time is described. Both the data structure and the query algorithm are easy to ~mplement.read more
Citations
More filters
Journal ArticleDOI
Query-Biased Preview over Outsourced and Encrypted Data
TL;DR: A single-server and two-round solution to securely obtain a query-biased snippet over the encrypted data from the server by making a document (plaintext) previewable under any cryptosystem and constructing a secure index to support dynamic computation for a best matched snippet when queried by some keywords.
Journal ArticleDOI
Faster query algorithms for the text fingerprinting problem
TL;DR: Two improved algorithms for the text fingerprinting indexing problem are proposed, one of which solves the two queries in O(|C|logn) and O( |C| logn+K) time, respectively and the query time complexities are further reduced.
Posted Content
Fast Locality-Sensitive Hashing for Approximate Near Neighbor Search.
TL;DR: A simpler analysis is provided showing that the number of lookups and distance computations closely match the Indyk-Motwani framework, making it a viable replacement in practice.
Dissertation
Bottom Up and Top Down – Twig Pattern Matching on Indexed Trees
TL;DR: This PhD thesis is a collection of papers presented with a general introduction to the topic, which is twig pattern matching (TPM) on indexed tree data, and presents an XML indexing system which combines existing techniques in a novel way and has orders of magnitude improved performance over existing commercial and open-source systems.
Proceedings ArticleDOI
Interpolation of symmetric functions and a new type of combinatorial design
TL;DR: This paper considers the class S; of functions which are symmetric on their sets of (at most k) relevant variables, and proves the existence of an interpolation set of size O(k’ log k log n), which comes close to the known lower bound of S2.
References
More filters
Journal ArticleDOI
Should Tables Be Sorted
TL;DR: It is shown that, in a rather general model including al1 the commonly-used schemes, $\lceil $ lg(n+l) $\rceil$ probes to the table are needed in the worst case, provided the key space is sufficiently large.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Perfect hashing functions: a single probe retrieving method for static sets
TL;DR: A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered, and a rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.
Journal ArticleDOI
Reciprocal hashing: a method for generating minimal perfect hashing functions
TL;DR: A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets, and a proof of existence for minimalperfect hash functions of a special type (reciprocal type) is given.