124,604 Hits in 3.3 sec

A Process-Calculus Analysis of Concurrent Operations on B-Trees

Anna Philippou, David Walker
2001 Journal of computer and system sciences (Print)  
A general theory of interactive systems with changing structure, the ?-calculus, is used to study concurrent operations on a variant of the B-tree.  ...  An improved algorithm for compression of the data structure is given. Some general results on partially confluent processes and on client-server systems, couched in the ?-calculus, are presented.  ...  -calculus, a general theory of interactive systems with changing structure, can be used to reason rigorously about concurrent operations on data structures: a study of operations on B link -trees is presented  ... 
doi:10.1006/jcss.2000.1721 fatcat:3uqunvonm5fj3blavmpdu6kaem

Concurrent operations on B∗-trees with overtaking

Yehoshua Sagiv
1986 Journal of computer and system sciences (Print)  
Several papers [2, 3, 7, 8, 10, 121 have described how to perform concurrent operations on B-trees.  ...  ., they allow a higher degree of concurrency and create a B-tree that uses somewhat less space) than those of [5] .  ... 
doi:10.1016/0022-0000(86)90021-8 fatcat:kje7htemirct7a5ddnscupuqbq

ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes

C. Mohan
1990 Very Large Data Bases Conference  
This paper presents a method, called ARIES/ KVL (Algorithm for Recovery and Isolation Exploiting Semantics using Key-Value Locking), for concurrency control in B-tree indexes.  ...  ARIES/KVL guarantees serializability and it supports very high concurrency during tree traversals, structure modifications, and other operations.  ...  multiaction transactions operating on B-tree indexes.  ... 
dblp:conf/vldb/Mohan90 fatcat:ogzdd2zjbfcrhohtdg2irha7ma

GreenBST: Energy-Efficient Concurrent Search Tree [chapter]

Ibrahim Umar, Otto Anshus, Phuong Ha
2016 Lecture Notes in Computer Science  
Our experimental evaluation using the recent implementation of non-blocking binary search trees, highly concurrent B-trees, conventional vEB trees, as well as the portably scalable concurrent trees shows  ...  However, existing locality-aware search trees such as ones based on the van Emde Boas layout (vEB-based trees), poorly support concurrent (update) operations while existing highly-concurrent search trees  ...  Acknowledgments This work has received funding from the European Union Seventh Framework Programme (EXCESS project, grant n • 611183) and from the Research Council of Norway (PREAPP project, grant n •  ... 
doi:10.1007/978-3-319-43659-3_37 fatcat:fcoolwijevda3lvvb7ow4x4zaq

Concurrency Control in B+-Trees Databases Using Preparatory Operations

Yehudit Mond, Yoav Raz
1985 Very Large Data Bases Conference  
A simple concurrency control mechanism for B+-trees Databases is introduced.  ...  It is based on early splitting and catenating of nodes during a process, which are candidates for such operations later on in that process.  ...  A CONCURRENCY CONTROL MECHANISM FOR THE PO-B+-TREE The concurrency control mechanism is based on two kinds of locks -a lock for operations which do not change the database structure (read process andin-placeupdate  ... 
dblp:conf/vldb/MondR85 fatcat:dow64dqdgzgf3jwflnr355ralq

An efficient locking model for concurrency control in OODBS

G Arumugam, M Thangaraj
2005 Data Science Journal  
The proposed model consists of a rich set of lock modes, hash table, lock-based signatures and B+ trees.  ...  The performance study result shows that the proposed model performs well for all possible operations on objects.  ...  of this paper.  ... 
doi:10.2481/dsj.4.59 fatcat:qb2moglqovczxhosmxpt2zswje


Ibrahim Umar, Otto Johan Anshus, Phuong Hoai Ha
2015 Performance Evaluation Review  
However, existing locality-aware search trees based on the van Emde Boas layout (vEB-based trees), poorly support concurrent (update) operations.  ...  Our experimental evaluation shows that DeltaTree is up to 50% faster than highly concurrent B-trees on a commodity Intel high performance computing (HPC) platform and up to 65% faster on a commodity ARM  ...  ACKNOWLEDGMENTS This research work has received funding from the European Union Seventh Framework Programme (grant n • 611183) and from the Research Council of Norway (grant n • 231746/F20).  ... 
doi:10.1145/2796314.2745891 fatcat:yfbpco5m3vbezkgxaxyebytode

Concurrent cache-oblivious b-trees

Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul
2005 Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05  
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees.  ...  Our first data structure is a concurrent lock-based exponential CO B-tree. This data structure supports insertions and non-blocking searches/successor queries.  ...  Notice that in the absence of concurrent insert operations, each search operation takes O(log B N + log α lg B) block transfers.  ... 
doi:10.1145/1073970.1074009 dblp:conf/spaa/BenderFGK05 fatcat:uhfy6yzv3zculee7fxy6r7jcjq

A concurrent red–black tree

Juan Besa, Yadran Eterovic
2013 Journal of Parallel and Distributed Computing  
As contention increases the Red black tree outperforms both other solutions. In the bottom left corner it has 14% higher average throughput than the AVL tree.  ...  Let T be a CRBT with at least one red-red imbalance, and let T' be a CRBT obtained from T by applying one of the transformations of case 1-a, case 2a, case2-b, case 3-a, or case 3-b from section 4.  ...  In this paper we present a new type of concurrent red black tree that uses optimistic concurrency techniques and new balancing operations to scale well and support contention.  ... 
doi:10.1016/j.jpdc.2012.12.010 fatcat:ysnaylkw3ffjvp7233n4lhbwgq

Cooperation, Congestion and Chaos in Concurrent Computation

Mizuki Oka, Takashi Ikegami, Alex Woodward, Yiqing Zhu, Kazuhiko Kato
2013 Advances in Artificial Life, ECAL 2013  
A unique point of the ALF is that it performs operations on shared resources simultaneously without excluding each other.  ...  To answer this question, we investigate a manycore machine that performs concurrent operations.  ...  ALF uses this B-tree data structure for managing concurrent operations. B-tree is constrained to have an equal number of pointing nodes per each node in a data-address tree.  ... 
doi:10.7551/978-0-262-31709-2-ch072 dblp:conf/ecal/OkaIWZK13 fatcat:zefjq2u2hzhj7idkcnigqumsii

DeltaTree: A Practical Locality-aware Concurrent Search Tree [article]

Ibrahim Umar, Otto Anshus, Phuong Ha
2013 arXiv   pre-print
The expected memory transfer costs of DeltaTree's Search, Insert, and Delete operations are O(_B N), where N, B are the tree size and the unknown memory block size in the ideal cache model, respectively  ...  However, existing highly-concurrent search trees such as red-black trees and AVL trees do not consider data locality while existing locality-aware search trees such as those based on the van Emde Boas  ...  The Department of Information Technology, University of Tromsø for giving us access to the Stallo HPC cluster.  ... 
arXiv:1312.2628v1 fatcat:ys7o26dwmzbuviuq5z3j4gvvta

Concurrent operations in large ordered indexes [chapter]

Y. S. Kwong, D. Wood
1980 Lecture Notes in Computer Science  
In this paper we present a new solution to the problem of supporting concurrent operations in B-trees, using a technique called side-branching to provide a higher degree of concurrency than previous solutions  ...  A T-tree offers not only an elegant structure for storing a huge amount of data, it also permits a consistent view and uniform treatment of concurrency at both the page tree and the page node levels.  ...  THE CONCURRENCY PROBLEM We want to allow an arbitrary number of processes to operate concurrently on a database stored as a B-tree.  ... 
doi:10.1007/3-540-09981-6_15 fatcat:xayovlok6zffblx7qhqctiga2a


Xin Wang, Weihua Zhang, Zhaoguo Wang, Ziyun Wei, Haibo Chen, Wenyun Zhao
2017 Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '17  
To validate their effectiveness, we apply such designs to construct a scalable concurrent B+Tree using HTM.  ...  In this paper, we first conduct a detailed analysis on an HTM-based concurrent B+Tree, which uncovers several reasons for excessive HTM aborts induced by both false and true conflicts under contention.  ...  We are grateful to support from the National Key Research and Development Program of China (No. 2016YFB0800104), the National Natural Science Foundation of China (No. 61672160 and 61572314), Shanghai Science  ... 
doi:10.1145/3018743.3018752 fatcat:3u2qd3wztfdullifpf22pcg7em

A Degradable Blink-Tree with Periodic Data Reorganization

I.-R. Chen
1995 Computer journal  
N : total number of concurrent operations (or transactions) accessing the B link -tree. Pj: the steady state probability that the degradation level of the B link -tree is j.  ...  This paper investigates periodic reorganization [1, 2] as a design alternative to overcome the drawback of the LY algorithm on concurrent B link -trees.  ... 
doi:10.1093/comjnl/38.3.245 fatcat:klovganbtbh6dn6vgbsambjvlq

Improving generalized inverted index lock wait times

A Borodin, S Mirvoda, S Porshnev, O Ponomareva
2018 Journal of Physics, Conference Series  
Concurrent operations on tree like data structures is a cornerstone of any database system.  ...  Concurrent operations intended for improving read\write performance and usually implemented via some way of locking. Deadlock-free methods of concurrency control are known as tree locking protocols.  ...  Acknowledgment The results were obtained with the financial support of the Russian Scientific Fund, Agreement N17-00-00000.  ... 
doi:10.1088/1742-6596/944/1/012022 fatcat:fum3fzcn5fcflkkjxkr7asrbwq
« Previous Showing results 1 — 15 out of 124,604 results