Compile-time inter-query dependence analysis

Srinivasan Parthasarathy, Wei Li, Michal Cierniak, Mohammed Javeed Zaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs, or programming support to write explicitly parallel query programs. In this paper, we present compiler analysis to automatically detect parallelism in the embedded query programs. We present compiler algorithms for detecting dependences in such programs. We show that the properties of some aggregate functions such as MIN and MAX can help reduce statically computed dependences.

Original languageEnglish
Title of host publicationIEEE Symposium on Parallel and Distributed Processing - Proceedings
Editors Anon
PublisherIEEE
Pages522-529
Number of pages8
Publication statusPublished - 1996
Externally publishedYes
EventProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA
Duration: 23 Oct 199626 Oct 1996

Other

OtherProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing
CityNew Orleans, LA, USA
Period23/10/9626/10/96

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Parthasarathy, S., Li, W., Cierniak, M., & Zaki, M. J. (1996). Compile-time inter-query dependence analysis. In Anon (Ed.), IEEE Symposium on Parallel and Distributed Processing - Proceedings (pp. 522-529). IEEE.

Compile-time inter-query dependence analysis. / Parthasarathy, Srinivasan; Li, Wei; Cierniak, Michal; Zaki, Mohammed Javeed.

IEEE Symposium on Parallel and Distributed Processing - Proceedings. ed. / Anon. IEEE, 1996. p. 522-529.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Parthasarathy, S, Li, W, Cierniak, M & Zaki, MJ 1996, Compile-time inter-query dependence analysis. in Anon (ed.), IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE, pp. 522-529, Proceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing, New Orleans, LA, USA, 23/10/96.
Parthasarathy S, Li W, Cierniak M, Zaki MJ. Compile-time inter-query dependence analysis. In Anon, editor, IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE. 1996. p. 522-529
Parthasarathy, Srinivasan ; Li, Wei ; Cierniak, Michal ; Zaki, Mohammed Javeed. / Compile-time inter-query dependence analysis. IEEE Symposium on Parallel and Distributed Processing - Proceedings. editor / Anon. IEEE, 1996. pp. 522-529
@inproceedings{07b50dc713824baca38ac664464f6d42,
title = "Compile-time inter-query dependence analysis",
abstract = "Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs, or programming support to write explicitly parallel query programs. In this paper, we present compiler analysis to automatically detect parallelism in the embedded query programs. We present compiler algorithms for detecting dependences in such programs. We show that the properties of some aggregate functions such as MIN and MAX can help reduce statically computed dependences.",
author = "Srinivasan Parthasarathy and Wei Li and Michal Cierniak and Zaki, {Mohammed Javeed}",
year = "1996",
language = "English",
pages = "522--529",
editor = "Anon",
booktitle = "IEEE Symposium on Parallel and Distributed Processing - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Compile-time inter-query dependence analysis

AU - Parthasarathy, Srinivasan

AU - Li, Wei

AU - Cierniak, Michal

AU - Zaki, Mohammed Javeed

PY - 1996

Y1 - 1996

N2 - Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs, or programming support to write explicitly parallel query programs. In this paper, we present compiler analysis to automatically detect parallelism in the embedded query programs. We present compiler algorithms for detecting dependences in such programs. We show that the properties of some aggregate functions such as MIN and MAX can help reduce statically computed dependences.

AB - Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs, or programming support to write explicitly parallel query programs. In this paper, we present compiler analysis to automatically detect parallelism in the embedded query programs. We present compiler algorithms for detecting dependences in such programs. We show that the properties of some aggregate functions such as MIN and MAX can help reduce statically computed dependences.

UR - http://www.scopus.com/inward/record.url?scp=0030382142&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030382142&partnerID=8YFLogxK

M3 - Conference contribution

SP - 522

EP - 529

BT - IEEE Symposium on Parallel and Distributed Processing - Proceedings

A2 - Anon, null

PB - IEEE

ER -