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
Patent
Automated server replication
TL;DR: In this paper, the authors propose methods and apparatus for detecting a change in demand for server resources across a load-bearing system having one or more content servers hosting identical content, the loadbearing system being connected to a network of content servers, and automatically modifying the number of content server on the load bearing system.
Journal ArticleDOI
Robust Information-Theoretic Private Information Retrieval
Amos Beimel,Yoav Stahl +1 more
TL;DR: This work designs robust PIR protocols, i.e., protocols which still work correctly even if only some servers are available during the protocol's operation, and presents various robust Pir protocols giving different tradeoffs between the different parameters.
Journal ArticleDOI
Morton filters: faster, space-efficient cuckoo filters via biasing, compression, and decoupled logical sparsity
TL;DR: This work introduces the Morton filter (MF), a novel AS-MDS that introduces several key improvements to CFs, and typically uses comparable to slightly less space than CFs for the same epsis.
Proceedings ArticleDOI
Efficient subtyping tests with PQ-encoding
Yoav Zibin,Joseph Gil +1 more
TL;DR: A new scheme for encoding multiple and single inheritance hierarchies is presented, which, in the standardized hierarchies, reduces the footprint of all previsously published schemes and is applicable also in improving the performance of otehr, previously published, encoding schemes.
Journal ArticleDOI
A Uniform Paradigm to Succinctly Encode Various Families of Trees
Arash Farzan,J. Ian Munro +1 more
TL;DR: The main distinction of the approach in this paper is that a tree is decomposed into subtrees in a manner that the subtrees are maximally isolated from each other.
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.