In this paper we describe the implementation of mul-tiversion concurrency control on the Generalized Search Tree (GiST), an index structure introduced by Hellerstein. For large-scale service directories, the need arises for a data storage system capable of handling substantial amounts of multidimensional data efficiently, as well as being able to support queries which are natural to the type of data stored in the directory. The GiST is an indexing structure that lends itself particularly well to this type of application. However, the solutions that have been proposed to address concurrency control on the GiST do not meet the requirements of large-scale service directo-ries. The solution proposed here optimizes towards highly concurrent read...
Modern computer architectures provide high performance computing capability by having multiple CPU c...
Database systems research is an old and well-established field in computer science. Many of the key ...
We consider the use of search trees to represent the dictionary aspects of a main-memory database in...
Many read-intensive systems where fast access to data is more important than the rate at which data ...
This paper presents general algorithms for concurrency control in tree-based access methods as well ...
This paper presents general algorithms for concurrency control in tree-based access methods as well ...
Characteristics of modern computing and storage technologies fundamentally differ from traditional h...
In multi-version databases, updates and deletions of records by transactions require appending a new...
File systems store data in files and organize these files in directories. Over decades, file systems...
Abstract. Tree based indexing structures like B-trees, B+-trees, Bitmap indexes and R-trees have bec...
Multiuser database systems require concurrency control in order to perform correctly. B-trees have b...
Adaptive indexing initializes and optimizes indexes incrementally, as a side effect of query process...
Data outsourcing has recently emerged as a successful solution allowing individuals and organization...
Very large database systems require distributed storage for expansibility and high throughput, which...
Tree based indexing structures like B-trees, B+trees, Bitmap indexes and R-trees have become essent...
Modern computer architectures provide high performance computing capability by having multiple CPU c...
Database systems research is an old and well-established field in computer science. Many of the key ...
We consider the use of search trees to represent the dictionary aspects of a main-memory database in...
Many read-intensive systems where fast access to data is more important than the rate at which data ...
This paper presents general algorithms for concurrency control in tree-based access methods as well ...
This paper presents general algorithms for concurrency control in tree-based access methods as well ...
Characteristics of modern computing and storage technologies fundamentally differ from traditional h...
In multi-version databases, updates and deletions of records by transactions require appending a new...
File systems store data in files and organize these files in directories. Over decades, file systems...
Abstract. Tree based indexing structures like B-trees, B+-trees, Bitmap indexes and R-trees have bec...
Multiuser database systems require concurrency control in order to perform correctly. B-trees have b...
Adaptive indexing initializes and optimizes indexes incrementally, as a side effect of query process...
Data outsourcing has recently emerged as a successful solution allowing individuals and organization...
Very large database systems require distributed storage for expansibility and high throughput, which...
Tree based indexing structures like B-trees, B+trees, Bitmap indexes and R-trees have become essent...
Modern computer architectures provide high performance computing capability by having multiple CPU c...
Database systems research is an old and well-established field in computer science. Many of the key ...
We consider the use of search trees to represent the dictionary aspects of a main-memory database in...