Efficient implementation of sets and multisets in R using hash tables

04/19/2023
by   Giacomo Ceoldo, et al.
0

The package hset for the R language contains an implementation of a S4 class for sets and multisets of numbers. The implementation, based on the hash table data structure from the package hash (Brown, 2019), allows for quick operations when the set is a dynamic object. An important example is when a set or a multiset is part of the state of a Markov chain in which in each iteration various elements are moved in and out of the set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/27/2017

Cuckoo++ Hash Tables: High-Performance Hash Tables for Networking Applications

Hash tables are an essential data-structure for numerous networking appl...
research
08/08/2023

Defending Hash Tables from Subterfuge with Depth Charge

We consider the problem of defending a hash table against a Byzantine at...
research
03/30/2023

Fuzzified advanced robust hashes for identification of digital and physical objects

With the rising numbers for IoT objects, it is becoming easier to penetr...
research
08/14/2018

Hashing with Linear Probing and Referential Integrity

We describe a variant of linear probing hash tables that never moves ele...
research
04/28/2023

MCPrioQ: A lock-free algorithm for online sparse markov-chains

In high performance systems it is sometimes hard to build very large gra...
research
01/14/2019

Quotient Hash Tables - Efficiently Detecting Duplicates in Streaming Data

This article presents the Quotient Hash Table (QHT) a new data structure...
research
12/06/2021

SIMD-Optimized Search Over Sorted Data

Applications often require a fast, single-threaded search algorithm over...

Please sign up or login with your details

Forgot password? Click here to reset