A nearly memory-optimal data structure for sets and mappings

DOI10.1007/3-540-44829-2_9MaRDI QIDQ4426377zbMATH OpenFDO

Authors J. Geldenhuys, Antti Valmari

Publication date 16 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2648/26480136.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05)

Recommendations

• Are Bitvectors Optimal?
• Efficient minimal perfect hashing in nearly minimal space
• Simple minimal perfect hashing in less space
• An optimal bloom filter replacement
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

Cited in

(6)

• PTrie: data structure for compressing and storing sets via prefix sharing
• \texttt{FASTSET}: a fast data structure for the representation of sets of integers
• The performance of difference coding for sets and relational tables
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• Storing set families more compactly with top ZDDs
• \textsc{Concise}: compressed `\(n\)' composable integer set

This page was built for publication: A nearly memory-optimal data structure for sets and mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426377)