Skip to main content
SpringerLink
Log in

A Dataflow Retrieval Unit for a Relational Database Machine

  • Conference paper
Database Machines

Abstract

We present a dataflow retrieval unit for a relational database machine, consisting of an array of special data driven processors (with local networks connecting the processors of neighbouring rows) and some sorters.

The basis of our design is to interpret a query tree as a dataflow program, to map it directly onto hardware structures and to execute it under dataflow control, using pipelining and parallel processing.

We work with sorted relations and assume relations to be delivered from storage as sequential data streams.

In order to execute a query, we first assign a processor (with appropriate program) to every operation and a data path to every arc of the query tree. Then the relations needed are read and flow into the processor tree at the leaves. They traverse it on the preassigned data paths under dataflow control on byte level and are transformed by relational algebra operations in the processors they pass. All data streams are processed in pipelined fashion, parallel streams are processed in parallel.

Work was carried out when the author was with Lehrstuhl für Betriebssysteme of Aachen Technical University in Aachen, Germany

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • AUER, H.; HELL, W.; LEILICH, H.-O. et al. (1980): RDBM - A Relational Data Base Machine. Informatik-Bericht Nr. 8005, Tech. Univ. Braunschweig 1980

    Google Scholar 

  • BANERJEE J.; HSIAO, D.K.; KANNAN, K. (1979): DBC - A Database Computer for Very Large Databases. IEEE Transact. Comp. C-28, 6 (1979), pp. 414 - 429

    Article  Google Scholar 

  • BORAL H.; DEWITT, D.J. (1980): Design Considerations for Data-Flow Database Machines. Proc. ACM-SIGMOD Conf. on Manag. of Data, Santa Monica, Ca. 1980 pp. 94–104

    Google Scholar 

  • Boral H.; Dewitt, D.J. (1981): Processor Allocation Strategies for Multiprocessor Database Machines. ACM TODS 6,2(1981), pp. 227–254

    Google Scholar 

  • BORAL H. (1981): On the Use of Data-Flow Techniques in Database Machines. PhD-Thesis Comp. Sci. Dept. Univ. Wisconsin-Madison, TR #432, May 1981

    Google Scholar 

  • CHANG P. Y. (1976): Parallel Processing and Data Driven Implementation of a Relational Data Base System. Proc. ACM’76 Houston, Texas, Oct. 1976, pp. 314–318

    Google Scholar 

  • CHEN, P.P.-S. (1976): The Entity-Relationship Model - Toward a Unified View of Data. ACM TODS 1, 1 (1976), pp. 9–36

    Article  Google Scholar 

  • CODD, E.F. (1970): A Relational Model of Data for Large Shared Data Banks. CACM 13, 6 (1970), pp. 377–387

    Google Scholar 

  • COPELAND, G.P.; LIPOVSKI, G.J.; SU, S.Y.W. (1973): The Architecture of CASSM: A Cellular System for Non-Numeric Processing. Proc. 1st Symp. on Comp. Arch., Gainesville, Florida 1973, pp. 121–128

    Google Scholar 

  • DEWITT, D.J. (1979): DIRECT — A Multiprocessor Organization for Supporting Relational Database Management Systems. IEEE Transact. Comp. C-28, 6 (1979), pp. 395–406

    Article  Google Scholar 

  • LEILICH, H.-O.; STIEGE, G.; ZEIDLER, H.Ch. (1978): A Search Processor for Data Base Management Systems. Proc. 4th Conf. VLDB, Berlin 1978, pp. 280–287

    Google Scholar 

  • LIN, C.S.; SMITH, D.C.P.; SMITH, J.M. (1976): The Design of a Rotating Associative Memory for Relational Database Applications. ACM TODS 1, 1 (1976), pp. 53 - 65

    Article  Google Scholar 

  • CHUSTER, S.A.; NGUYEN, H.B.; OZKARAHAN, E.A. et al. (1978): RAP.2 - An Associative Processor for Data Bases. 5th Symp. on Comp. Arch. 1978, pp. 52–59

    Google Scholar 

  • SMITH, J.M.; CHANG, P.Y.-T. (1975): Optimizing the Performance of a Relational Algebra Database Interface. CACM 18, 10 (1975), pp. 568–579

    Google Scholar 

  • YAO, S.B. (1979): Optimization of Query Evaluation Algorithms. ACM TODS 4, 2 (1979), pp. 133–155

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Brown Boveri Research Center, CH-5405, Baden, Switzerland

    Martin Glinz

Authors
  1. Martin Glinz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Intitut für Datenverarbeitungsanlagen, TU Braunschweig, Hans-Sommer-Str. 66, 3300, Braunschweig, Germany

    H.-O. Leilich

  2. Consiglio Nazionale Delle Ricerche, Instituto di Analisi dei Sistemi ed Informatica, Via Manzoni 30, 00185, Roma, Italy

    M. Missikoff

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Glinz, M. (1983). A Dataflow Retrieval Unit for a Relational Database Machine. In: Leilich, HO., Missikoff, M. (eds) Database Machines. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69419-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69419-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12959-2

  • Online ISBN: 978-3-642-69419-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation