Decision support systems are characterized by large concurrent scan operations. A significant percentage of these scans are executed as index based scans of the data. This is especially true when the data is physically clustered on the index columns using the various clustering schemes employed by database engines. Common database management systems have only limited ability to reuse buffer content across multiple running queries due to their treatment of queries in isolation. Previous attempts to coordinate scans for better buffer reuse were limited to table scans only. Attempts for index based scan sharing were non existent or were less than satisfactory due to drifting between scans. In this paper, we describe a mechanism to keep scans u...
URL to paper listed on conference siteMany data-intensive websites use databases that grow much fas...
Managing digital information is an integral part of our society. Efficient access to data is support...
We focused on applying parallel computing technique to the bulk loading of X-tree in other to improv...
textabstractThis paper analyzes the performance of concurrent (index) scan operations in both record...
This paper analyzes the performance of concurrent (index) scan operations in both record (NSM/PAX) a...
Shared Disk database systems offer a high flexibility for parallel transaction and query processing....
Abstract. Tree based indexing structures like B-trees, B+-trees, Bitmap indexes and R-trees have bec...
textabstractIn analytical applications, database systems often need to sustain workloads with multip...
Shared Disk database systems offer a high flexibility for parallel transaction and query processing....
Tree based indexing structures like B-trees, B+trees, Bitmap indexes and R-trees have become essent...
Shared-disk database systems offer a high degree of freedom in the allocation of workload compared t...
htmlabstractDatabase Cracking is an appealing approach to adaptive indexing: on every range-selectio...
One of the challenging tasks for database administrators is tuning database systems within a short p...
The performance issues are presented. The process of performance tuning is described. The indexing c...
With rapidly increasing datasets and more dynamic workloads, adaptive partial indexing becomes an im...
URL to paper listed on conference siteMany data-intensive websites use databases that grow much fas...
Managing digital information is an integral part of our society. Efficient access to data is support...
We focused on applying parallel computing technique to the bulk loading of X-tree in other to improv...
textabstractThis paper analyzes the performance of concurrent (index) scan operations in both record...
This paper analyzes the performance of concurrent (index) scan operations in both record (NSM/PAX) a...
Shared Disk database systems offer a high flexibility for parallel transaction and query processing....
Abstract. Tree based indexing structures like B-trees, B+-trees, Bitmap indexes and R-trees have bec...
textabstractIn analytical applications, database systems often need to sustain workloads with multip...
Shared Disk database systems offer a high flexibility for parallel transaction and query processing....
Tree based indexing structures like B-trees, B+trees, Bitmap indexes and R-trees have become essent...
Shared-disk database systems offer a high degree of freedom in the allocation of workload compared t...
htmlabstractDatabase Cracking is an appealing approach to adaptive indexing: on every range-selectio...
One of the challenging tasks for database administrators is tuning database systems within a short p...
The performance issues are presented. The process of performance tuning is described. The indexing c...
With rapidly increasing datasets and more dynamic workloads, adaptive partial indexing becomes an im...
URL to paper listed on conference siteMany data-intensive websites use databases that grow much fas...
Managing digital information is an integral part of our society. Efficient access to data is support...
We focused on applying parallel computing technique to the bulk loading of X-tree in other to improv...