Parallel processing and data driven implementation of a relational data base system

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel processing and data driven implementation of a relational data base system

Full text

Pdf (480 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the annual conference table of contents

Houston, Texas, United States

Pages: 314 - 318

Year of Publication: 1976

Author

Philip Y. Chang

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Citation Count: 3

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800191.805606 What is a DOI?

ABSTRACT

A simple query to a large data base may take a prohibitively long time to process. To decrease this time in applications requiring fast response, parallel processing is necessary. Within the scope of a Relational Algebra query system, the potential parallelism in query execution is investigated. Three levels of parallelism are identified: independent parallelism, pipelining and node splitting. It is shown that, under certain conditions, the exploitation of these levels makes highly parallel processing and short response time possible. A data driven computation scheme which can implement the three levels of parallelism in a unified way is described.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, v.13 n.6, p.377-387, June 1970 [doi>10.1145/362384.362685]
	2	Codd, E.F. Relational completeness of data base sublanguages. Courant Computer Science Symposia, Vol.6: Data Base Systems. Prentice-Hall, New York, 1971.
	3	John Miles Smith , Philip Yen-Tang Chang, Optimizing the performance of a relational algebra database interface, Communications of the ACM, v.18 n.10, p.568-579, Oct. 1975 [doi>10.1145/361020.361025]
	4	Chyuan Shiun Lin , Diane C. P. Smith , John Miles Smith, The design of a rotating associative memory for relational database applications, ACM Transactions on Database Systems (TODS), v.1 n.1, p.53-65, March 1976 [doi>10.1145/320434.320447]
	5	Ramamoorthy, C.V., and Gonzalez, M.J. A survey of techniques for recognizing parallel processable streams in computer programs. FJCC Proc., 35 (1969), 1-15.
	6	Jack B. Dennis , David P. Misunas, A preliminary architecture for a basic data-flow processor, Proceedings of the 2nd annual symposium on Computer architecture, p.126-132, January 20-22, 1975
	7	Alan Lynn Davis, Spl: a structured programming language., 1972

CITED BY 3

	Paul J. Sadowski , S. A. Schuster, Exploiting parallelism in a Relational Associative Processor, Proceedings of the fourth workshop on Computer architecture for non-numeric processing, p.99-109, August 01-04, 1978, Blue Mountain Lake, New York, United States
	Won Kim, Relational Database Systemsr, ACM Computing Surveys (CSUR), v.11 n.3, p.187-211, Sept. 1979
	Paul J. Sadowski , S. A. Schuster, Exploiting parallelism in a Relational Associative Processor, ACM SIGMOD Record, v.10 n.1, August 1978