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

Parallelizing Datalog Programs by Generalized Pivoting.

Jürgen Seib, Georg Lausen: Parallelizing Datalog Programs by Generalized Pivoting. PODS 1991: 241-251
@inproceedings{DBLP:conf/pods/SeibL91,
  author    = {J{\"u}rgen Seib and
               Georg Lausen},
  title     = {Parallelizing Datalog Programs by Generalized Pivoting},
  booktitle = {Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on
               Principles of Database Systems, May 29-31, 1991, Denver, Colorado},
  publisher = {ACM Press},
  year      = {1991},
  isbn      = {0-89791-430-9},
  pages     = {241-251},
  ee        = {http://doi.acm.org/10.1145/113413.113435, db/conf/pods/SeibL91.html},
  crossref  = {DBLP:conf/pods/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

A Datalog program consists of function-free Horn clause rules. The main problem in evaluating Datalog programs is to achieve an acceptable performance. The reason is, that Datalog programs usually are evaluated bottom-up to compute in an iterative way the fixpoint of the program. Given a large amount of base facts, program evaluation can be a very lengthy process. In the paper parallel processing of decomposable Datalog programs is considered to overcome this problem. A decomposable program can be evaluated in parallel such that neither a communication nor a synchronization of the processors haa to be established [WS88]. The concept of generalized pivoting is proposed, which is a sufficient condition for decomposability of arbitrary Datalog programs. Moreover, the class of completely decomposable programs is introduced and it is shown, that generalized pivoting is also a necessary condition for complete decomposability.

Copyright © 1991 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.


Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ... BibTeX

Printed Edition

Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 29-31, 1991, Denver, Colorado. ACM Press 1991, ISBN 0-89791-430-9
Contents BibTeX

Online Edition: ACM Digital Library

[Index Terms]
[Full Text in PDF Format, 930 KB]

References

[AP87]
Foto N. Afrati, Christos H. Papadimitriou: The Parallel Complexity of Simple Chain Queries. PODS 1987: 210-213 BibTeX
[BR86]
François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52 BibTeX
[CK86]
Stavros S. Cosmadakis, Paris C. Kanellakis: Parallel Evaluation of Recursive Rule Queries. PODS 1986: 280-293 BibTeX
[CW89]
Simona Rabinovici-Cohen, Ouri Wolfson: Why a Single Parallelization Strategy in not Enough in Knowledge Bases. PODS 1989: 200-216 BibTeX
[GST90]
Sumit Ganguly, Abraham Silberschatz, Shalom Tsur: A Framework for the Parallel Processing of Datalog Queries. SIGMOD Conference 1990: 143-152 BibTeX
[Kan86]
Paris C. Kanellakis: Logic Programming and Parallel Complexity. ICDT 1986: 1-30 BibTeX
[MUG86]
Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder: Design Overview of the NAIL! System. ICLP 1986: 554-568 BibTeX
[NT89]
Shamim A. Naqvi, Shalom Tsur: A Logical Language for Data and Knowledge Bases. Computer Science Press 1989, ISBN 0-7167-8200-6
BibTeX
[Pet76]
James L. Peterson: Computation Sequence Sets. J. Comput. Syst. Sci. 13(1): 1-24(1976) BibTeX
[Sch86]
...
[SL91]
Jürgen Seib, Georg Lausen: Parallele Evaluierung von Datalog-Programmen. BTW 1991: 344-361 BibTeX
[Ull88]
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX
[Ull89]
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX
[UVG88]
Jeffrey D. Ullman, Allen Van Gelder: Parallel Complexity of Logical Query Programs. Algorithmica 3: 5-42(1988) BibTeX
[WO90]
Ouri Wolfson, Aya Ozeri: A New Paradigm for Parallel and Distributed Rule-Processing. SIGMOD Conference 1990: 133-142 BibTeX
[Wol88]
Ouri Wolfson: Sharing the Load of Logic-Program Evaluation. DPDS 1988: 46-55 BibTeX
[WS88]
Ouri Wolfson, Abraham Silberschatz: Distributed Processing of Logic Programs. SIGMOD Conference 1988: 329-336 BibTeX

Referenced by

  1. Weining Zhang, Ke Wang, Siu-Cheung Chau: Data Partition and Parallel Evaluation of Datalog Programs. IEEE Trans. Knowl. Data Eng. 7(1): 163-176(1995)
  2. Sumit Ganguly, Abraham Silberschatz, Shalom Tsur: Mapping Datalog Program Execution to Networks of Procesors. IEEE Trans. Knowl. Data Eng. 7(3): 351-361(1995)
  3. Sérgio Lifschitz, Victor Vianu: A Probabilistic View of Datalog Parallelization. ICDT 1995: 294-307
  4. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
    Contents
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:34:04 2009