TY - GEN
T1 - An extension of Datalog for graph queries
AU - Mazuran, Mirjana
AU - Serra, Edoardo
AU - Zaniolo, Carlo
PY - 2012
Y1 - 2012
N2 - Supporting aggregates in recursive logic rules is a crucial long-standing problem for Datalog. To solve this problem, we propose DatalogFS that supports queries and reasoning on the number of distinct occurrences satisfying given goals, or conjunction of goals, in rules. By using a generalized notion of multiplicity called frequency, we show that graph queries can be easily expressed in DatalogFS. This simple extension preserves all the desirable semantic and computational properties of logic-based languages, while significantly extending their application range to support efficiently page-rank, and social-network queries. Copyright (c) 2012 - Edizioni Libreria Progetto and the authors.
AB - Supporting aggregates in recursive logic rules is a crucial long-standing problem for Datalog. To solve this problem, we propose DatalogFS that supports queries and reasoning on the number of distinct occurrences satisfying given goals, or conjunction of goals, in rules. By using a generalized notion of multiplicity called frequency, we show that graph queries can be easily expressed in DatalogFS. This simple extension preserves all the desirable semantic and computational properties of logic-based languages, while significantly extending their application range to support efficiently page-rank, and social-network queries. Copyright (c) 2012 - Edizioni Libreria Progetto and the authors.
UR - http://www.scopus.com/inward/record.url?scp=84873572006&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84873572006
SN - 9788896477236
T3 - Proceedings of the 20th Italian Symposium on Advanced Database Systems, SEBD 2012
SP - 177
EP - 184
BT - Proceedings of the 20th Italian Symposium on Advanced Database Systems, SEBD 2012
T2 - 20th Italian Symposium on Advanced Database Systems, SEBD 2012
Y2 - 24 June 2012 through 27 June 2012
ER -