DBScholar

Back to papers

On Distributed Processibility of Datalog Queries by Decomposing Databases

Summary: Decompose DBs into subdatabases; evaluate Datalog by unioned results. Two classes: disjoint distributive (connectivity) and bounded distributive fixed size; three views: bounded recursion, 1-bounded-recursive, and constant parallelism with no IPC. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2487
Venue
SIGMOD
Year
1989
Pagerank
6.7529086e-05
Overall Rank
4,343 | 70.21%
DOI
10.1145/67544.66929

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{dong_sigmod89,
        title = {{On Distributed Processibility of Datalog Queries by Decomposing Databases}},
        author = {Dong, Guozhu},
        series = {{SIGMOD} '89},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/67544.66929},
        url = {https://dl.acm.org/doi/10.1145/67544.66929},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2,247 A Framework for the Parallel Processing of Datalog Queries 1990 SIGMOD 8.8713691e-05
2,530 Incremental Evaluation of Rules and its Relationship to Parallelism 1991 SIGMOD 8.458663e-05
3,689 Dynamically Distributed Query Evaluation 2001 PODS 7.2010583e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers