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 management of content servers based on change in demand
TL;DR: In this article, 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.
Posted Content
Dynamic Set Cover: Improved Algorithms & Lower Bounds
TL;DR: These are the first algorithms that obtain an approximation factor linear in $f$ for dynamic set cover, thereby almost matching the best bounds known in the offline setting and improving upon the previous best approximation of $O(f^2)$ in the dynamic setting.
Journal ArticleDOI
An Efficient Trie Construction for Natural Language Dictionaries
TL;DR: A compression method for long strings by using trie arc for single words by replacing long strings into the corresponding leaf node numbers of the trie using the double array structure.
Proceedings ArticleDOI
Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity
TL;DR: Entropy-Learned Hashing models and estimates the randomness of the input data, and then creates data-specific hash functions that use only the parts of the data that are needed to differentiate the outputs, which dramatically reduces the computational cost of hashing and proves their output is similarly uniform to that of traditional hash functions.
Proceedings ArticleDOI
Optimal labelling schemes for adjacency, comparability, and reachability
TL;DR: In this article, the authors constructed asymptotically optimal adjacency labeling schemes for every hereditary class containing 2Ω(n 2) n-vertex graphs as n→ ∞.
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.