What if we tried Less Power? – Lessons from studying the power of choices in hashing-based data structures

07/02/2023
by   Stefan Walzer, et al.
0

In the first part of this survey, we review how the power of two choices underlies space-efficient data structures like cuckoo hash tables. We'll find that the additional power afforded by more than 2 choices is often outweighed by the additional costs they bring. In the second part, we present a data structure where choices play a role at coarser than per-element granularity. In some sense, we rely on the power of 1+ϵ choices.

READ FULL TEXT

page 4

page 5

page 17

page 21

research
03/26/2018

Extra Space during Initialization of Succinct Data Structures and of Dynamical Initializable Arrays

Many succinct data structures on a word RAM require precomputed tables t...
research
03/26/2018

Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays

Many succinct data structures on the word RAM require precomputed tables...
research
01/28/2020

Peeling Close to the Orientability Threshold: Spatial Coupling in Hashing-Based Data Structures

Hypergraphs with random hyperedges underlie various data structures wher...
research
08/15/2019

"LOADS of Space": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes

Algorithms, data structures, coding techniques, and other methods that r...
research
05/09/2019

Charlotte: Composable Authenticated Distributed Data Structures, Technical Report

We present Charlotte, a framework for composable, authenticated distribu...
research
03/30/2018

H-CNN: Spatial Hashing Based CNN for 3D Shape Analysis

We present a novel spatial hashing based data structure to facilitate 3D...
research
07/14/2020

Conditional Image Retrieval

This work introduces Conditional Image Retrieval (CIR) systems: IR metho...

Please sign up or login with your details

Forgot password? Click here to reset