文章基本信息

标题：Dictionaries Revisited
本地全文：下载
作者：Martin Farach-Colton
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：75
页码：2:1-2:1
DOI：10.4230/LIPIcs.SEA.2017.2
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：B+-trees; file system; write optimization