When a large number of new keys are to be inserted (or deleted) into a B-tree at about the same time, it is often profitable to sort the keys in the main memory before performing updates to the B-tree on disk. Thus, updates falling into the same leaf of the B-tree can be performed simultaneously and disk accesses are saved. In this thesis, new batch-update algorithms for B-trees are presented and analyzed. First, an efficient batch-insertion algorithm for a situation where no concurrency control is needed is presented and analyzed. The algorithm is asymptotically optimal in the number of structure modification operations needed to rebalance the tree after the batch insertion. Next, new batch-update algorithms for different types of B-tree...
Abstract. In this paper we present new concurrent and re-coverable B-link-tree algorithms. Unlike pr...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Abstract: The B±tree is the most widely used index structure in the current commercial database syst...
When a large number of new keys are to be inserted (or deleted) into a B-tree at about the same time...
kerttu ( at) cs.hut.fi We present an indexing system where a database index is divided into two part...
Many scenarios impose a heavy update load on B-tree in-dexes in modern databases. A typical case is ...
Conventional B-tree insertion algorithms typically require several disk accesses per insertion. This...
d-trees are widely used in parallel databases to support efficient neighborhood and similarity queri...
Advances in hardware-related technologies promise to enable new data management applications that mo...
We develop new algorithms for the management of transactions in a page-shipping client-server databa...
This paper presents a combined algorithm to perform batch insertion, deletion, and update for tree s...
AbstractAlgorithms for concurrent operations (i.e., searches, insertions, and deletions) on B∗-trees...
Database management systems (DBMS) are critical performance components in large scale applications u...
The multiversion B+-tree (MVBT) by Becker et al. assumes a single-data-item update model in which ea...
Abstract. Although many suggestions have been made for concurrency in B+-trees, few of these have co...
Abstract. In this paper we present new concurrent and re-coverable B-link-tree algorithms. Unlike pr...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Abstract: The B±tree is the most widely used index structure in the current commercial database syst...
When a large number of new keys are to be inserted (or deleted) into a B-tree at about the same time...
kerttu ( at) cs.hut.fi We present an indexing system where a database index is divided into two part...
Many scenarios impose a heavy update load on B-tree in-dexes in modern databases. A typical case is ...
Conventional B-tree insertion algorithms typically require several disk accesses per insertion. This...
d-trees are widely used in parallel databases to support efficient neighborhood and similarity queri...
Advances in hardware-related technologies promise to enable new data management applications that mo...
We develop new algorithms for the management of transactions in a page-shipping client-server databa...
This paper presents a combined algorithm to perform batch insertion, deletion, and update for tree s...
AbstractAlgorithms for concurrent operations (i.e., searches, insertions, and deletions) on B∗-trees...
Database management systems (DBMS) are critical performance components in large scale applications u...
The multiversion B+-tree (MVBT) by Becker et al. assumes a single-data-item update model in which ea...
Abstract. Although many suggestions have been made for concurrency in B+-trees, few of these have co...
Abstract. In this paper we present new concurrent and re-coverable B-link-tree algorithms. Unlike pr...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Abstract: The B±tree is the most widely used index structure in the current commercial database syst...