Fixpoint semantics and optimization of recursive Datalog programs with aggregates

THEORY AND PRACTICE OF LOGIC PROGRAMMING, no. SP5-6 (2017): 1048-1065

Cited by: 17|Views20

Abstract:

A very desirable Datalog extension investigated by many researchers in the last 30 years consists in allowing the use of the basic SQL aggregates min, max, count and sum in recursive rules. In this paper, we propose a simple comprehensive solution that extends the declarative least-fixpoint semantics of Horn Clauses, along with the optimi...More

Code:

Data:

ZH
Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments