Research issues in automatic database clustering
- 1 March 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 34 (1), 33-38
- https://doi.org/10.1145/1058150.1058157
Abstract
While a lot of work has been published on clustering of data on storage medium, little has been done about automating this process. This is an important area because with data proliferation, human attention has become a precious and expensive resource. Our goal is to develop an automatic and dynamic database clustering technique that will dynamically re-cluster a database with little intervention of a database administrator (DBA) and maintain an acceptable query response time at all times. In this paper we describe the issues that need to be solved when developing such a technique.Keywords
This publication has 18 references indexed in Scilit:
- A clustering algorithm based on graph connectivityInformation Processing Letters, 2000
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999
- The Asilomar report on database researchACM SIGMOD Record, 1998
- A transaction-based approach to vertical partitioning for relational database systemsIEEE Transactions on Software Engineering, 1993
- A parallel algorithm for record clusteringACM Transactions on Database Systems, 1990
- Architecture of the ORION next-generation database systemIEEE Transactions on Knowledge and Data Engineering, 1990
- Cactis: a self-adaptive, concurrent implementation of an object-oriented database management systemACM Transactions on Database Systems, 1989
- Adaptive record clusteringACM Transactions on Database Systems, 1985
- Vertical partitioning algorithms for database designACM Transactions on Database Systems, 1984
- Problem Decomposition and Data Reorganization by a Clustering TechniqueOperations Research, 1972