Data replication in static tree structures (original) (raw)
Related papers
Data replication for external searching in static tree structures
Proceedings of the ninth international conference on Information and knowledge management - CIKM '00, 2000
Replication control in distributed B-trees /
On minimizing memory and computation overheads for binary-tree based data replication
in Proc. of the 22nd IEEE Symposium on Computers and Communications (ISCC 2017), 2017
An analysis of B-trees and their variants.
Information Systems, 1989
Optimal tree access by elementary and composite templates in parallel memory systems
IEEE Transactions on Parallel and Distributed Systems, 2002
Efficient Bulk Operations on Dynamic R-Trees
Algorithmica, 2002
A Flash-based B+-Tree using Sibling-Leaf Blocks for Efficient Node Updates and Range Searches
2018
A data structure for dynamic trees
Journal of Computer and System Sciences, 1983
Abstract unordered and ordered trees CRDT
Multiple Templates Access of Trees in Parallel Memory Systems
Journal of Parallel and Distributed Computing, 1998
String Processing and Information Retrieval, 2017
The Effect of Buffering on the Performance of R-Trees
1998
Performance of Complete and Nearly Complete Binary Search Trees
ACM Journal of Experimental Algorithmics, 2009
The CB tree: a practical concurrent self-adjusting search tree
Distributed Computing, 2014
An Experimental Evaluation and Investigation of Waves of Misery in R-trees
Proc. VLDB Endow., 2021
Transforming Unbalanced Multiway trees into a practical external data structure
Acta Informatica, 1988
Fault tolerance and storage reduction in binary search trees
Information and Control, 1984
Binary-tree based estimation of file requests for efficient data replication
IEEE Transactions on Parallel and Distributed Systems, 2017
Foundations and Trends in Databases, 2010
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
2006 Fifth International Symposium on Parallel and Distributed Computing, 2006
Toward a universal mapping algorithm for accessing trees in parallel memory systems
1998
The log-structured merge-tree (LSM-tree)
Patrick O'Neil, Dieter Gawlick
Acta Informatica, 1996
A Contention-Friendly Binary Search Tree
Lecture Notes in Computer Science, 2013
A practical concurrent binary search tree
ACM SIGPLAN Notices, 2010
Parallel processing of large node B-trees
IEEE Transactions on Computers, 1990
2006
Optimal Binary Search Trees 1 OPTIMAL BINARY SEARCH TREES 1. PREPARATION BEFORE LAB DATA STRUCTURES