Data mining on an OLTP system (nearly) for free
- 16 May 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 29 (2) , 13-21
- https://doi.org/10.1145/342009.335375
Abstract
This paper proposes a scheme for scheduling disk requests thattakes advantage of the ability of high-level functions to operatedirectly at individual disk drives. We show that such a schememakes it possible to support a Data Mining workload on an OLTPsystem almost for free: there is only a small impact on the throughputand response time of the existing workload. Specifically, weshow that an OLTP system has the disk resources to consistentlyprovide one third of its sequential bandwidth to ...Keywords
This publication has 9 references indexed in Scilit:
- A case for intelligent disks (IDISKs)ACM SIGMOD Record, 1998
- CUREPublished by Association for Computing Machinery (ACM) ,1998
- An overview of data warehousing and OLAP technologyACM SIGMOD Record, 1997
- BIRCH: A New Data Clustering Algorithm and Its ApplicationsData Mining and Knowledge Discovery, 1997
- Parallel mining of association rulesIEEE Transactions on Knowledge and Data Engineering, 1996
- On-line extraction of SCSI disk drive parametersPublished by Association for Computing Machinery (ACM) ,1995
- Research problems in data warehousingPublished by Association for Computing Machinery (ACM) ,1995
- Scheduling algorithms for modern disk drivesPublished by Association for Computing Machinery (ACM) ,1994
- An introduction to disk drive modelingComputer, 1994