A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Low complexity aggregation in graphlog and Datalog
[chapter]
1990
Lecture Notes in Computer Science
We present constructs for computing aggregate functions over sets of tuples and along paths in a database graph. We show how Datalog can be extended to compute a large class of queries with aggregates without incurring the large expense of a language with general set manipulation capabilities. In particular, we aim for queries that can be executed e ciently in parallel, using the class nc and its various subclasses as formal models of low parallel complexity. Our approach retains the standard
doi:10.1007/3-540-53507-1_90
fatcat:2g6qdn6z6zdvzaenawkarx5rtq