Database Paper Browser

Back to papers

Dynamically Distributed Query Evaluation

Summary: d3log: Datalog + dynamic site discovery with “intensional answers” — rules that describe how to fetch data — improving robustness to unavailable servers, enabling graded QoS, and reducing bandwidth. Formal framework and nondeterministic algorithm that characterizes and proves correctness of intensional answers; links deterministic optimizations to particular runs and sketches initial nonrecursive SQL‑like experiments. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1221
Venue
PODS
Year
2001
Pagerank
7.4881474e-05
Overall Rank
3,143 | 78.16%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
16 MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) 1986 PODS 0.00099936325
64 A Message Passing Framework for Logical Query Evaluation 1986 SIGMOD 0.00063295728
359 On the Power of Magic 1987 PODS 0.00025830228
533 Answering Recursive Queries Using Views 1997 PODS 0.00020767726
3,860 On Distributed Processibility of Datalog Queries by Decomposing Databases 1989 SIGMOD 6.6864693e-05
4,367 Distributed Processing Of Logic Programs 1988 SIGMOD 6.2423944e-05
Previous Page 1 / 1 Next

Semantically Similar Papers