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

DOI10.1561/1900000059MaRDI QIDQ6180227zbMATH OpenOpenAlexFDO

Authors Manos Athanassoulis, Stratos Idreos, Dennis Shasha

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)

Recommendations

• Handbook of data structures and applications
• Advanced data structures. Theory and applications
• scientific article; zbMATH DE number 2173815
• Advanced Data Structures
• Data structures and algorithms analysis -- new perspectives. Volume 2: Data structures based on nonlinear relations and data processing methods

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 710876 (Why is no real title available?)
• scientific article; zbMATH DE number 986443 (Why is no real title available?)

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

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