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

On Designing an I/O Processor for a Relational Data Base Machine.

François Bancilhon, Michel Scholl: On Designing an I/O Processor for a Relational Data Base Machine. SIGMOD Conference 1980: 93-93g
@inproceedings{DBLP:conf/sigmod/BancilhonS80,
  author    = {Fran\c{c}ois Bancilhon and
               Michel Scholl},
  editor    = {Peter P. Chen and
               R. Clay Sprowls},
  title     = {On Designing an I/O Processor for a Relational Data Base Machine},
  booktitle = {Proceedings of the 1980 ACM SIGMOD International Conference on
               Management of Data, Santa Monica, California, May 14-16, 1980},
  publisher = {ACM Press},
  year      = {1980},
  pages     = {93-93g},
  ee        = {http://doi.acm.org/10.1145/582250.582265, db/conf/sigmod/BancilhonS80.html},
  crossref  = {DBLP:conf/sigmod/80},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Most data base machines use some type of "filter" to perform unary operations on files. This filter processes information "on the fly" during its transfer from mass storage (Disk) to main storage (main memory or buffer). This paper is devoted to the design study of such a filter for relational-type data bases. It is therefore assumed that data are structured as a set of n-ary relations.

Using a top-down approach we classify the requirements under two catagories:

1) Functional specification of the filter : the filter should perform the unary relational operations i.e. projection and restriction; it should also permit insertion deletion and updates of tuples.

2) Performance requirements : in a filtering system access time is a linear function of the space used to the store relations, it becomes therefore of the utmost importance to minimize this space.

In order to meet the second requirement, we suggest to structure the n-ary relations into hierarchical free format files. Clearly, such a data structure minimizes space: the remaining problems being the ability to read and update such files. It is then shown that an automaton-like device is sufficient to perform projections and restrictions of relations and insertions, deletions and updates of tuples. That device is described and an algorithm that automatically generates the microprogram realizing that device from the description of the relation and that of the operations to be performed is given.

Copyright © 1980 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Peter P. Chen, R. Clay Sprowls (Eds.): Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data, Santa Monica, California, May 14-16, 1980. ACM Press 1980 BibTeX
Contents

Online Edition: ACM Digital Library


References

[1]
...
[2]
...
[3]
Jayanta Banerjee, David K. Hsiao, Richard I. Baum: Concepts and Capabilities of a Database Computer. ACM Trans. Database Syst. 3(4): 347-384(1978) BibTeX
[4]
...
[5]
E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) BibTeX
[6]
...
[7]
Stanley Y. W. Su, Ahmed Emam: CASDAL: CASSM'a DAta Language. ACM Trans. Database Syst. 3(1): 57-91(1978) BibTeX

Referenced by

  1. Priti Mishra, Margaret H. Eich: Join Processing in Relational Databases. ACM Comput. Surv. 24(1): 63-113(1992)
  2. Serge Abiteboul, Michel Scholl, Georges Gardarin, Eric Simon: Towards DBMSs for Supporting New Applications. VLDB 1986: 423-435
  3. Carlo Zaniolo: The Representation and Deductive Retrieval of Complex Objects. VLDB 1985: 458-469
  4. Patrick Valduriez, Georges Gardarin: Join and Semijoin Algorithms for a Multiprocessor Database Machine. ACM Trans. Database Syst. 9(1): 133-161(1984)
  5. Georges Gardarin, Patrick Valduriez, Yann Viémont: Predicate Trees: An Approach to Optimize Relational Query Operations. ICDE 1984: 439-444
  6. Michele Missikoff, Michel Scholl: Relational Queries in a Domain Based DBMS. SIGMOD Conference 1983: 219-227
  7. Paula B. Hawthorn: Microprocessor Assisted Tuple Access, Decompression and Assembly for Statistical Database Systems. VLDB 1982: 223-233
  8. François Bancilhon, Philippe Richard, Michel Scholl: On Line Processing of Compacted Relations. VLDB 1982: 263-269
  9. Michele Missikoff: A Domain Based Internal Schema for Relational Database Machines. SIGMOD Conference 1982: 215-224
  10. David J. DeWitt, Paula B. Hawthorn: A Performance Evaluation of Data Base Machine Architectures (Invited Paper). VLDB 1981: 199-214
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:39:22 2009