Article

Free access

On distributed processibility of datalog queries by decomposing databases

Author:

Guozhu DongAuthors Info & Claims

SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of data

Pages 26 - 35

https://doi.org/10.1145/67544.66929

Published: 01 June 1989 Publication History

Abstract

We consider distributed or parallel processing of datalog queries. We address this issue by decomposing databases into a number of subdatabases such that the computation of a program on a database can be achieved by unioning its independent evaluations on the subdatabases. More specifically, we identify two kinds of distributed-processible programs according to the properties of database decomposition. (i) A program is disjoint distributive if it is distributed processible over a decomposition consisting of subdatabases with disjoint domains. A characterization of such programs is given in terms of an easily decidable syntactic property called connectivity. (ii) A program is bounded distributive if it is distributed processible over a decomposition consisting of subdatabases with a fixed size. Three interesting characterizations of such a program are presented, the first by bounded recursion, the second by equivalence to a 1-bounded-recursive program, and the third by constant parallel complexity

References

[1]

Aho, A.V., Hopc~oft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.

Digital Library

[2]

Bancilhon, F., and Ramakrishnan, R. An amateur's introduction to recursive query processing strategies. In Proceedings of the A CM SIGMOD Conference, 1986, 16- 52.

Digital Library

[3]

Cosmadakis, S.S., and Kanellakis, P.C. Parallel evaluation of recursive rule queries. In Proceedings of the A CM Symposium on Principles of Database Systems, 1986, 280-293.

Digital Library

[4]

Cohen, S.R., and Wolfson, O. Why a single paraUelization strategy is not enough in knowledge bases. In Proceedings of PODS, 1989.

Digital Library

[5]

Dong, G. On the composition and decomposition of datalog program mappings. In Proceedings of ~nd ICDT, Belgium, 1988, Lecture Notes in Computer Science No. 326 (M. Gyssens, J. Paxedaens, and D. Van Gucht eds). To appear in a special issue of Theoretical Comp Sci.

Digital Library

[6]

Dong, G. On the composition and decomposition of datalog program mappings. Ph.D. Thesis, USC, 1988.

Digital Library

[7]

Even, S. Algorithmic Combinatorics. The Macmillan Company, New York, 1973, pp. 32.

[8]

Gaifman, H., Marison, H., Sagiv, Y., Vardi, M.Y. Undecidable optimization problems for database logic programs. In Proceedings of ~nd IEEE Symposium on Logic in Computer Science, Ithica, 1987, 106-115.

[9]

Ioannidis, Y.E. A time bound on the materialization of some recursively defined views. In Proceedings of International Conference on Very Large Data Bases, 1985.

[10]

Lloyd, J.W. Foundations of Logic Programming. Springer-Verlag, 1984.

Digital Library

[11]

Naughton, J. Data independent recursion in deductive databases. In Proceedings of the A CM Symposium on Principles of Database Systems, 1986, 267-279.

Digital Library

[12]

Naughton, J., and Sagiv, Y. A decidable class of bounded recursion. In Proceedings of the A CM Symposium on Principles of Database Systems, 1987, 227-236.

Digital Library

[13]

Sagiv, Y, Optimizing datalog programs, In Proceedings of the A CM Symposium on Principles of Database Systems, 1987, 349.

Digital Library

[14]

Ullman, J.D. and Van Geldez, A. Parallel complexity of logical query progzams, in A 19orithmica (1988) 3. pp. 5-42.

[15]

Vardi, M.Y. Decidability and undecidability results foz boundedness of linear recursive programs. In Proceedings of ~he A CM Sy~posiu~ on Principles of Database Systems, 1988, 341-351.

Digital Library

[16]

Wolfson, O. and Silberschatz, A. Distributed pzocessing of logic pzogzams, In Proceedings of ~he A CM SIGMOD Conference, 1988, pp. 329.

Digital Library

[17]

Wolfson, O. Sharing the load of logicprogram evaluations. To appear in the Proceedings of the International Symposium on Databases in Parallel and Distributed Systems. December, 1988.

Digital Library

Cited By

Ameloot TKetsman BNeven FZinn D(2017)Datalog Queries Distributing over ComponentsACM Transactions on Computational Logic10.1145/302274318:1(1-35)Online publication date: 22-Feb-2017
https://dl.acm.org/doi/10.1145/3022743
Jim TSuciu DBuneman P(2001)Dynamically distributed query evaluationProceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/375551.375557(28-39)Online publication date: 1-May-2001
https://dl.acm.org/doi/10.1145/375551.375557
Zhang WWang KChau S(1995)Data Partition and Parallel Evaluation of Datalog ProgramsIEEE Transactions on Knowledge and Data Engineering10.1109/69.3685117:1(163-176)Online publication date: 1-Feb-1995
https://dl.acm.org/doi/10.1109/69.368511
Show More Cited By

Index Terms

Recommendations

On distributed processibility of datalog queries by decomposing databases

We consider distributed or parallel processing of datalog queries. We address this issue by decomposing databases into a number of subdatabases such that the computation of a program on a database can be achieved by unioning its independent evaluations ...
A Method for Equijoin Queries in Distributed Relational Databases
Lecture notes in computer science Vol. 174

A simple and efficient method for processing general equijoin queries in a distributed relational database is described. The query is first decomposed into a set of simple queries, each being involved with only one of the joining domains and its ...
Evaluating Recursive Queries in Distributed Databases

The execution of logic queries in a distributed database environment is studied. Conventional optimization strategies, such as the early evaluation of selection conditions and the clustering of processing to manipulate and exchange large sets of tuples, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of data

June 1989

451 pages

ISBN:0897913175

DOI:10.1145/67544

ACM SIGMOD Record Volume 18, Issue 2
June 1989
442 pages
ISSN:0163-5808
DOI:10.1145/66926
Editors:
James Clifford,
Bruce Lindsay,
David Maier
Issue’s Table of Contents

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS04

Sponsor:

SIGMOD

SIGMOD/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
542
Total Downloads

Downloads (Last 12 months)83
Downloads (Last 6 weeks)16

Reflects downloads up to 25 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ameloot TKetsman BNeven FZinn D(2017)Datalog Queries Distributing over ComponentsACM Transactions on Computational Logic10.1145/302274318:1(1-35)Online publication date: 22-Feb-2017
https://dl.acm.org/doi/10.1145/3022743
Jim TSuciu DBuneman P(2001)Dynamically distributed query evaluationProceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/375551.375557(28-39)Online publication date: 1-May-2001
https://dl.acm.org/doi/10.1145/375551.375557
Zhang WWang KChau S(1995)Data Partition and Parallel Evaluation of Datalog ProgramsIEEE Transactions on Knowledge and Data Engineering10.1109/69.3685117:1(163-176)Online publication date: 1-Feb-1995
https://dl.acm.org/doi/10.1109/69.368511
Ganguly SSilberschatz ATsur S(1992)Parallel bottom-up processing of Datalog queriesJournal of Logic Programming10.1016/0743-1066(92)90048-814:1-2(101-126)Online publication date: 1-Oct-1992
https://dl.acm.org/doi/10.1016/0743-1066%2892%2990048-8
Wolfson ODewan HStolfo SYemini Y(1991)Incremental evaluation of rules and its relationship to parallelismACM SIGMOD Record10.1145/119995.11579920:2(78-87)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/119995.115799
Wolfson ODewan HStolfo SYemini Y(1991)Incremental evaluation of rules and its relationship to parallelismProceedings of the 1991 ACM SIGMOD international conference on Management of data10.1145/115790.115799(78-87)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/115790.115799
Ganguly SSilberschatz ATsur S(1990)A framework for the parallel processing of Datalog queriesACM SIGMOD Record10.1145/93605.9872419:2(143-152)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/93605.98724
Wolfson OOzeri A(1990)A new paradigm for parallel and distributed rule-processingACM SIGMOD Record10.1145/93605.9872319:2(133-142)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/93605.98723
Ganguly SSilberschatz ATsur SGarcia-Molina H(1990)A framework for the parallel processing of Datalog queriesProceedings of the 1990 ACM SIGMOD international conference on Management of data10.1145/93597.98724(143-152)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/93597.98724
Wolfson OOzeri AGarcia-Molina H(1990)A new paradigm for parallel and distributed rule-processingProceedings of the 1990 ACM SIGMOD international conference on Management of data10.1145/93597.98723(133-142)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/93597.98723
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents