pdf-format: |
|
@InProceedings{dillinger_et_al:LIPIcs.SEA.2022.4, author = {Dillinger, Peter C. and H\"{u}bschle-Schneider, Lorenz and Sanders, Peter and Walzer, Stefan}, title = {{Fast Succinct Retrieval and Approximate Membership Using Ribbon}}, booktitle = {20th International Symposium on Experimental Algorithms (SEA 2022)}, pages = {4:1--4:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-251-8}, ISSN = {1868-8969}, year = {2022}, volume = {233}, editor = {Schulz, Christian and U\c{c}ar, Bora}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16538}, URN = {urn:nbn:de:0030-drops-165385}, doi = {10.4230/LIPIcs.SEA.2022.4}, annote = {Keywords: AMQ, Bloom filter, dictionary, linear algebra, randomized algorithm, retrieval data structure, static function data structure, succinct data structure, perfect hashing} }
Keywords: | AMQ, Bloom filter, dictionary, linear algebra, randomized algorithm, retrieval data structure, static function data structure, succinct data structure, perfect hashing | |
Seminar: | 20th International Symposium on Experimental Algorithms (SEA 2022) | |
Issue date: | 2022 | |
Date of publication: | 11.07.2022 | |
Supplementary Material: |
The code and scripts used in our experiments are available under a permissive license at github: Software (Source Code): https://github.com/lorenzhs/BuRR archived at: https://archive.softwareheritage.org/swh:1:dir:fa31381ae0e372bb33819932c0bcc1c51dcc0dfa Software (Source Code): https://github.com/lorenzhs/fastfilter_cpp archived at: https://archive.softwareheritage.org/swh:1:dir:66c22ae4f3cc568d78c7b0d719988984a6688801 |