An Evaluation of Software Sketches

09/06/2023
by   Roy Friedman, et al.
0

This work presents a detailed evaluation of Rust (software) implementations of several popular sketching solutions, as well as recently proposed optimizations. We compare these solutions in terms of computational speed, memory consumption, and several approximation error metrics. Overall, we find a simple hashing based solution employed with the Nitro sampling technique [22] gives the best trade-off between memory, error and speed. Our findings also include some novel insights about how to best combine sampling with Counting Cuckoo filters depending on the application.

READ FULL TEXT

page 13

page 14

page 15

page 17

page 18

page 19

page 20

page 21

research
05/27/2016

Lazy Evaluation of Convolutional Filters

In this paper we propose a technique which avoids the evaluation of cert...
research
03/22/2019

Parallel Adaptive Sampling with almost no Synchronization

Approximation via sampling is a widespread technique whenever exact solu...
research
06/28/2022

Memory Safe Computations with XLA Compiler

Software packages like TensorFlow and PyTorch are designed to support li...
research
06/06/2018

Constrained Counting and Sampling: Bridging the Gap between Theory and Practice

Constrained counting and sampling are two fundamental problems in Comput...
research
06/13/2017

A New Probabilistic Algorithm for Approximate Model Counting

Constrained counting is important in domains ranging from artificial int...
research
06/26/2021

Exploring Spatial Indexing for Accelerated Feature Retrieval in HPC

Despite the critical role that range queries play in analysis and visual...
research
12/21/2015

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving

Constrained sampling and counting are two fundamental problems in artifi...

Please sign up or login with your details

Forgot password? Click here to reset