ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Funtional Disk System as a High Performance Relational Storage.

Masaru Kitsuregawa, Miyuki Nakano, Mikio Takagi: Funtional Disk System as a High Performance Relational Storage. DASFAA 1989: 243-250
@inproceedings{DBLP:conf/dasfaa/KitsuregawaNT89,
  author    = {Masaru Kitsuregawa and
               Miyuki Nakano and
               Mikio Takagi},
  editor    = {Sukho Lee and
               Hideko S. Kunii and
               Won Kim and
               In Sup Paik and
               Yahiko Kambayashi},
  title     = {Funtional Disk System as a High Performance Relational Storage},
  booktitle = {International Symposium on Database Systems for Advanced Applications,
               Seoul, Korea, April 10-12, 1989},
  publisher = {Dept. of Computer Science, KAIST, P.O. Box 150, ChongRyang, Seoul,
               131-650, Korea},
  year      = {1989},
  pages     = {243-250},
  ee        = {db/conf/dasfaa/KitsuregawaNT89.html},
  crossref  = {DBLP:conf/dasfaa/89},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Functional Disk System with Relational database engine(FDS-R) is a relational storage system designed to accelerate relational algebraic operations. FDS-R employs a filtering and dynamic clustering mechanism as a special hardware function and provides an intelligent data management and an efficient data processing. The relation size which could be handled on the first prototype, however, was limited to the size of a staging buffer. Then we built up the second version of FDS-R, FDS-RII, which is designed to handle large relations efficiently. We have presented the processing strategy: the "Extended Task Cycle" for relational algebraic operations on FDS-RII, where the strategy is selected at run time form two algorithms (Nested Loop and Grace Hash Algorithms) by comparing the estimated I/O costs of them.

In this paper, we present the overview of Hardware configuration and Software system of FDS-RII. First we show the basic Task Cycle and give the performance evaluation results using the original Wisconsin Benchmark for small relations, where filtered relation can be staged on the staging buffer. FDS attains higher performance than the current database systems such as INGRES, Oracle and IDM. Next we explain the "Extended Task Cycle" which was introduce to handle the relations larger than the staging buffer size. With the expanded version of Wisconsin Benchmark, we measured the FDS-RI1 performance. FDS-RII attained a high performance for processing large relations as compared to other large database systems such as Gamma and Teradata. While FDS-RII uses just one disk and three MC68020, Teradata uses 40 disks and 20 AMP's and Gamma requires 8 disks and 17 VAX 11/75O's.

Copyright © 1989 by The Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. Permission to copy without all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the DASFAA copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. To copy otherwise, or to republish, requires a fee and/or special permission from the Organizing Commitee.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

References

[1]
Masaru Kitsuregawa, Miyuki Nakano, Lilian Harada, Mikio Takagi: Functional Disk System for Relational Database. ICDE 1987: 88-95 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
Michael Stonebraker, Eugene Wong, Peter Kreps, Gerald Held: The Design and Implementation of INGRES. ACM Trans. Database Syst. 1(3): 189-222(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
Masaru Kitsuregawa, Hidehiko Tanaka, Tohru Moto-Oka: Application of Hash to Data Base Machine and Its Architecture. New Generation Comput. 1(1): 63-74(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood: Implementation Techniques for Main Memory Database Systems. SIGMOD Conference 1984: 1-8 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
Leonard D. Shapiro: Join Processing in Database Systems with Large Main Memories. ACM Trans. Database Syst. 11(3): 239-264(1986) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
...
[7]
David J. DeWitt, Shahram Ghandeharizadeh, Donovan A. Schneider, Rajiv Jauhari, M. Muralikrishna, Anoop Sharma: A Single User Evaluation of the Gamma Database Machine. IWDM 1987: 370-386 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
...
[9]
Masaya Nakayama, Masaru Kitsuregawa, Mikio Takagi: Hash-Partitioned Join Method Using Dynamic Destaging Strategy. VLDB 1988: 468-478 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[10]
Yasuo Yamane: A Hash Join Technique for Relational Database Systems. FODO 1985: 515-528 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
Kjell Bratbergsengen: Hashing Methods and Relational Algebra Operations. VLDB 1984: 323-333 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[12]
Masaru Kitsuregawa, Miyuki Nakano, Mikio Takagi: Query Execution for Large Relations on Functional Disk Systems. ICDE 1989: 159-167 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Tue Dec 8 20:02:13 2009 by Michael Ley (ley@uni-trier.de)