2026-07-22T21:17:35Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7633 2024-03-06T10:39:47Z ddc:004 open_access

Dictionaries Revisited Farach-Colton, Martin B+-trees file system write optimization Dictionaries are probably the most well studied class of data structures. A dictionary supports insertions, deletions, membership queries, and usually successor, predecessor, and extract-min. Given their centrality to both the theory and practice of data structures, surprisingly basic questions about them remain unsolved and sometimes even unposed. This talk focuses on questions that arise from the disparity between the way large-scale dictionaries are analyzed and the way they are used in practice. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Farach-Colton 2017 Is Part Of LIPIcs, Volume 75, 16th International Symposium on Experimental Algorithms (SEA 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2017.2 urn:nbn:de:0030-drops-76336 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.2 eng https://creativecommons.org/licenses/by/3.0/legalcode