An Optimal Bloom Filter Replacement Based on Matrix Solving

DOI10.1007/978-3-642-03351-3_25zbMath1248.68173OpenAlexW1703904868WikidataQ56639231 ScholiaQ56639231MaRDI QIDQ3392960

Ely Porat

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_25

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (8)

Support optimality and adaptive cuckoo filters ⋮ Constructing SAT Filters with a Quantum Annealer ⋮ Various improvements to text fingerprinting ⋮ Xor Filters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Indexing and querying character sets in one- and two-dimensional words ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for approximate membership checking with application to password security
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• Bloomier Filters: A Second Look
• Solving sparse linear equations over finite fields
• Membership in Constant Time and Almost-Minimum Space
• Network Applications of Bloom Filters: A Survey
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: An Optimal Bloom Filter Replacement Based on Matrix Solving