DiSC - VLDB'98 Papers

The Drill Down Benchmark

Peter A. Boncz, Tim Ruhl, Fred Kwakkel

Full Paper (PDF)

Abstract

Data Mining places specific requirements on DBMS query performance that cannot be evaluated satisfactorily using existing OLAP benchmarks. The DD Benchmark - defined here - provides a practical case and yardstick to explore how well a DBMS is able to support Data Mining applications. It was derived from real-life data mining tasks performed by our Data Surveyor ^TM tool running on a variety of DBMS backends. We describe initial results obtained using both the Monet system and a relational DBMS product as backend.

References

References, where available, link to the DBLP on the World Wide Web.

[AS94]

Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499

[BWK98]

Peter A. Boncz, Annita N. Wilschut, Martin L. Kersten: Flattening an Object Algebra to Provide Performance. ICDE 1998: 568-577

[GMS92]

Hector Garcia-Molina, Kenneth Salem: Main Memory Database Systems: An Overview. TKDE 4(6): 509-516(1992)

[Gra93]

Jim Gray: The Benchmark Handbook for Database and Transaction Systems (2nd Edition). Morgan Kaufmann 1993

[HKS95]

...

[SKN94]

Ambuj Shatdal, Chander Kant, Jeffrey F. Naughton: Cache Conscious Algorithms for Relational Query Processing. VLDB 1994: 510-521

[Tra95]

...

BIBTEX

@inproceedings{DBLP:conf/vldb/BonczRK98,
author = {Peter A. Boncz and
Tim R{\"u}hl and
Fred Kwakkel},
editor = {Ashish Gupta and
Oded Shmueli and
Jennifer Widom},
title = {The Drill Down Benchmark},
booktitle = {VLDB'98, Proceedings of 24rd International Conference on Very
Large Data Bases, August 24-27, 1998, New York City, New York,
USA},
publisher = {Morgan Kaufmann},
year = {1998},
isbn = {1-55860-566-5},
pages = {628-632},
crossref = {DBLP:conf/vldb/98},
bibsource = {DBLP, http://dblp.uni-trier.de}
}