English
Related papers

Related papers: Split block Bloom filters

200 papers

Bloom Filters are a space-efficient data structure used for the testing of membership in a set that errs only in the False Positive direction. However, the standard analysis that measures this False Positive rate provides a form of worst…

Data Structures and Algorithms · Computer Science 2024-02-06 Kahlil Dozier , Loqman Salamatian , Dan Rubenstein

Recent work suggests improving the performance of Bloom filter by incorporating a machine learning model as a binary classifier. However, such learned Bloom filter does not take full advantage of the predicted probability scores. We…

Data Structures and Algorithms · Computer Science 2019-10-22 Zhenwei Dai , Anshumali Shrivastava

The field of autonomous driving technology is rapidly advancing, with deep learning being a key component. Particularly in the field of sensing, 3D point cloud data collected by LiDAR is utilized to run deep neural network models for 3D…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-05 Taisuke Noguchi , Takuya Azumi

Bandwidth-starved multicore chips have become ubiquitous. It is well known that the performance of stencil codes can be improved by temporal blocking, lessening the pressure on the memory interface. We introduce a new pipelined approach…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-06-17 Markus Wittmann , Georg Hager , Jan Treibig , Gerhard Wellein

The proliferation of big data and analytic workloads has driven the need for cloud compute and cluster-based job processing. With Apache Spark, users can process terabytes of data at ease with hundreds of parallel executors. At Microsoft,…

A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A Bloomier filter generalizes a Bloom filter to compactly store a function…

Data Structures and Algorithms · Computer Science 2008-07-08 Denis Charles , Kumar Chellapilla

Bloom Filter is a probabilistic membership data structure and it is excessively used data structure for membership query. Bloom Filter becomes the predominant data structure in approximate membership filtering. Bloom Filter extremely…

Data Structures and Algorithms · Computer Science 2019-04-01 Ripon Patgiri , Sabuzima Nayak , Samir Kumar Borgohain

Apache Flink is an open-source system for scalable processing of batch and streaming data. Flink does not natively support efficient processing of spatial data streams, which is a requirement of many applications dealing with spatial data.…

Databases · Computer Science 2020-08-04 Salman Ahmed Shaikh , Komal Mariam , Hiroyuki Kitagawa , Kyoung-Sook Kim

State Space Models (SSMs) with selective scan (Mamba) have been adapted into efficient vision models. Mamba, unlike Vision Transformers, achieves linear complexity for token interactions through a recurrent hidden state process. This…

Computer Vision and Pattern Recognition · Computer Science 2025-02-04 Saarthak Kapse , Robin Betz , Srinivasan Sivanandan

The computation of the skyline provides a mechanism for utilizing multiple location-based criteria to identify optimal data points. However, the efficiency of these computations diminishes and becomes more challenging as the input data…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-04-05 Chen Li , Ye Zhu , Yang Cao , Jinli Zhang , Annisa Annisa , Debo Cheng , Yasuhiko Morimoto

Privacy-preserving record linkage with Bloom filters has become increasingly popular in medical applications, since Bloom filters allow for probabilistic linkage of sensitive personal data. However, since evidence indicates that Bloom…

Cryptography and Security · Computer Science 2014-10-27 Martin Kroll , Simone Steinmetzer

Big Data has become prominent throughout many scientific fields and, as a result, scientific communities have sought out Big Data frameworks to accelerate the processing of their increasingly data-intensive pipelines. However, while…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-05-31 Valerie Hayot-Sasson , Tristan Glatard

The join operation is a fundamental building block of parallel data processing. Unfortunately, it is very resource-intensive to compute an equi-join across massive datasets. The approximate computing paradigm allows users to trade accuracy…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-16 Do Le Quoc , Istemi Ekin Akkus , Pramod Bhatotia , Spyros Blanas , Ruichuan Chen , Christof Fetzer , Thorsten Strufe

Learned Bloom Filters, i.e., models induced from data via machine learning techniques and solving the approximate set membership problem, have recently been introduced with the aim of enhancing the performance of standard Bloom Filters,…

Machine Learning · Computer Science 2022-11-29 Dario Malchiodi , Davide Raimondi , Giacomo Fumagalli , Raffaele Giancarlo , Marco Frasca

New algorithms and optimization techniques are needed to balance the accelerating trend towards bandwidth-starved multicore chips. It is well known that the performance of stencil codes can be improved by temporal blocking, lessening the…

Performance · Computer Science 2012-03-01 Markus Wittmann , Georg Hager , Gerhard Wellein

We propose a novel filter for segmenting the regions of interest from LiDAR 3D point cloud for multirotor aerial vehicles. It is specially targeted for real-time applications and works on sparse LiDAR point clouds without preliminary…

Robotics · Computer Science 2020-10-12 Geesara Prathap , Roman Fedorenko , Alexandr Klimchik

In recent years, deep learning models have become ubiquitous in industry and academia alike. Deep neural networks can solve some of the most complex pattern-recognition problems today, but come with the price of massive compute and memory…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-24 Shreshth Tuli , Giuliano Casale , Nicholas R. Jennings

When processing data streams with highly skewed and nonstationary key distributions, we often observe overloaded partitions when the hash partitioning fails to balance data correctly. To avoid slow tasks that delay the completion of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-06-01 Zoltán Zvara , Péter G. N. Szabó , Balázs Barnabás Lóránt , András A. Benczúr

The increasing demand for Large Language Models (LLMs) across various applications has led to a significant shift in the design of deep learning serving systems. Deploying LLMs, particularly in multi-tenant environments, poses substantial…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-09-25 Bodun Hu , Jiamin Li , Le Xu , Myungjin Lee , Akshay Jajoo , Geon-Woo Kim , Hong Xu , Aditya Akella

Approximate Membership Query (AMQ) structures are essential for high-throughput systems in databases, networking, and bioinformatics. While Bloom filters offer speed, they lack support for deletions. Existing GPU-based dynamic alternatives,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-17 Tim Dortmann , Markus Vieth , Bertil Schmidt