Space Efficient Hash Tables with Worst Case Constant Access Time

Fotakis, Dimitris; Pagh, Rasmus; Sanders, Peter; Spirakis, Paul G.

doi:10.1007/s00224-004-1195-x

Cited by 127 publications

(145 citation statements)

References 23 publications

Supporting

Mentioning

140

Contrasting

Order By: Relevance

“…The variants of random walk way [26] and d-ary extension [27] further demonstrated the flexibility and efficiency of cuckoo-driven method due to its simplicity. The items can hence "move" among multiple positions to achieve load balance and guarantee constant-scale complexity of operations.…”

Section: Cuckoo Hashingmentioning

confidence: 98%

“…Authors in [47] present the methods of greatly improving the failure probability bounds for a large class of cuckoo hashing variants by using only a constant amount of additional space. The d-ary Cuckoo Hashing [27] further generalizes the cuckoo hashing to show how to yield a simple hash table data structure that stores n elements in ð1 þ Þn memory cells, for any constant > 0. This structure indicates that cuckoo hashing can obtain better performance in practical situations.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Design and Implementations of Locality-Aware Approximate Queries in Hybrid Storage Systems

Hua

Xiao

Liu

et al. 2015

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Cloud computing applications face the challenges of dealing with a huge volume of data that needs the support of accurate and fast approximate queries to enhance system scalability and improve quality of service. Locality-sensitive hashing (LSH) can support the approximate queries that unfortunately suffer from imbalanced load and space inefficiency among distributed data servers, which severely limits the query accuracy and incurs long query latency between users and cloud servers. In this paper, we propose a novel scheme, called NEST, which offers easy-to-use and cost-effective approximate queries for cloud computing. The novelty of NEST is to leverage cuckoo-driven locality-sensitive hashing to find similar items that are further placed closely through cuckoo-driven method to obtain load-balancing buckets in hash tables. NEST hence carries out flat and manageable addressing in adjacent buckets, and obtains constant-scale query complexity even in the worst case. The benefits of NEST include the increments of space utilization and fast query response. Moreover, due to the salient property of flat addressing in NEST, we implement NEST design in a real hybrid storage system, which consists of DRAM, SSD, and hard disk. The flat addressing allows efficient operations in SSD to improve system performance. We argue that a proper "division of labor" among DRAM, SSD, and hard disk in the hybrid and heterogeneous storage hierarchy is desperately needed to strike an optimal balance to remove the indexing bottleneck. Theoretical analysis and extensive experiments (on LANL and Microsoft metadata) in a large-scale cloud testbed demonstrate the salient properties of NEST to meet the needs of approximate query service in cloud computing environments. We have offered open-source codes of NEST for public use.

show abstract

Section: Cuckoo Hashingmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

The Design and Implementations of Locality-Aware Approximate Queries in Hybrid Storage Systems

Hua

Xiao

Liu

et al. 2015

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Our approach creates look-up tables for these predefined operations and uses a hash function that offers constant time performance for the basic operations (e.g., add and search) [17], [18].…”

Section: Block Tree Contiguity Checking Algorithmmentioning

confidence: 99%

“…Proof: Given two nodes u and v, the Lowest Common Ancestor (LCA) algorithm gives an answer in constant time after linear-time pre-processing [17], [18]. The LCA function has commutative (e.g., LCA(u, v) = LCA(v, u)) and associative (e.g., LCA(LCA(u, v), w) = LCA(u, LCA(v, w))) properties.…”

Section: Analysis Of Btcc Approach To Sa Contiguitymentioning

confidence: 99%

Capacity-Constrained Network-Voronoi Diagram

Yang

Shekhar

Oliver

et al. 2015

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Given a graph and a set of service center nodes, a Capacity Constrained Network-Voronoi Diagram (CCNVD) partitions the graph into a set of contiguous service areas that meet service center capacities and minimize the sum of the shortest distances from graph-nodes to allotted service centers. The CCNVD problem is important for critical societal applications such as assigning evacuees to shelters and assigning patients to hospitals. This problem is NP-hard; it is computationally challenging because of the large size of the transportation network and the constraint that service areas must be contiguous in the graph to simplify communication of allotments. Previous work has focused on honoring either service area contiguity (e.g., Network Voronoi Diagrams) or service center capacity constraints (e.g., min-cost flow), but not both. Our preliminary work introduced a novel Pressure Equalizer (PE) approach for CCNVD to meet the capacity constraints of service centers while maintaining the contiguity of service areas. However, we find that the main bottleneck of the PE algorithm is testing whether service areas are contiguous. In this paper, we extend our previous work and propose novel algorithms that reduce the computational cost. Experiments using road maps from five different regions demonstrate that the proposed approaches significantly reduce computational cost for the PE approach.

show abstract

“…As described in Section 5, our protocol uses a 4-way cuckoo hash table [7]. A 2 GB 4-way cuckoo hash table can hold roughly 130 million 129-bit secret tuples (consisting of two 64-bit secrets), which is enough for approximately 4,500 ASes to send 20 secrets per minute for a day to a single incoming interface on a prover's router.…”

Section: Offline Setup and Secret Exchangementioning

confidence: 99%

Truth in advertising

Wong

Balasubramanian

Alvisi

et al. 2007

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

We design and evaluate a lightweight route verification mechanism that enables a router to discover route failures and inconsistencies between advertised Internet routes and actual paths taken by the data packets. Our mechanism is accurate, incrementally deployable, and secure against malicious intermediary routers. By carefully avoiding any cryptographic operations in the data path, our prototype implementation achieves the overhead of less than 1% on a 1 Gbps link, demonstrating that our method is suitable even for high-performance networks.

show abstract

Space Efficient Hash Tables with Worst Case Constant Access Time

Cited by 127 publications

References 23 publications

The Design and Implementations of Locality-Aware Approximate Queries in Hybrid Storage Systems

The Design and Implementations of Locality-Aware Approximate Queries in Hybrid Storage Systems

Capacity-Constrained Network-Voronoi Diagram

Truth in advertising

Contact Info

Product

Resources

About