Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines

DOI10.1561/1900000059zbMath1529.68086OpenAlexW4385641891MaRDI QIDQ6180227

Dennis Shasha, Manos Athanassoulis, Stratos Idreos

Publication date: 19 December 2023

Published in: Foundations and Trends® in Databases (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1561/1900000059

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent operations on \(B^ *\)-trees with overtaking
• \textsc{Concise}: compressed `\(n\)' composable integer set
• General methods for adding range restrictions to decomposable searching problems
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• An almost optimal algorithm for unbounded searching
• Decomposable searching problems
• R-trees: theory and applications
• Data page layouts for relational databases on deep memory hierarchies
• The log-structured merge-tree (LSM-tree)
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• On a model of indexability and its bounds for range queries
• Architecture of a Database System
• An Efficient Method for Weighted Sampling without Replacement
• Decomposable searching problems I. Static-to-dynamic transformation
• Efficient locking for concurrent operations on B-trees
• Interpolation search—a log log N search
• Complexity of Combinatorial Algorithms
• Concurrent search structure algorithms
• Rank-Balanced Trees
• Automated Verification of Concurrent Search Structures
• Optimal Bloom Filters and Adaptive Merging for LSM-Trees
• Dynamic Indexability and the Optimality of B-Trees
• Space/time trade-offs in hash coding with allowable errors
• The Design of APL

This page was built for publication: Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines