Compile-time inter-query dependence analysis

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

Research output: Contribution to journalConference article

2 Citations (Scopus)


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
Pages (from-to)522-529
Number of pages8
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
Publication statusPublished - 1 Dec 1996
EventProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA
Duration: 23 Oct 199626 Oct 1996

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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