Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

2008/01/01 by Martin Dietzfelbinger, Rasmus Pagh · 3 citations
Computer Science · Mathematics · #Advanced Image and Video Retrieval Techniques #Algorithm #Bloom filter #Caching and Content Delivery #Computer science #Data structure #Discrete mathematics #Function (biology) #Hash function #Hash table #Logarithm #Mathematics #Optimization and Search Problems #Overhead (engineering) #Perfect hash function #Randomness #Reduction (mathematics) #Set (abstract data type) #Space (punctuation) #Theoretical computer science #Upper and lower bounds

paper · doi:10.1007/978-3-540-70575-8_32

crossref issued 2008/01/01 · crossref published 2008/01/01 · crossref published-print 2008/01/01 · openalex publication_date 2008/01/01 · crossref created 2008/08/12 · crossref deposited 2024/05/02 · openalex created_date 2025/10/10 · crossref indexed 2026/04/11 · openalex updated_date 2026/08/04

Citations

• Succinct Data Structures for Retrieval and Approximate Membership
• Network Applications of Bloom Filters: A Survey
• Space/time trade-offs in hash coding with allowable errors
• Cuckoo hashing
• On Dynamic Range Reporting in One Dimension
• An Optimal Bloom Filter Replacement Based on Matrix Solving

Cited by

• An Optimal Bloom Filter Replacement Based on Matrix Solving
• A seven-dimensional analysis of hashing methods and its implications on query processing
• Bloom filter [wikipedia]