Name
Abstract | ||
|---|---|---|
Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big data systems require recursive computations beyond the Boolean space. In this paper we study the convergence of datalog when it is interpreted over an arbitrary semiring. We consider an ordered semiring, define the semantics of a datalog program as a least fixpoint in this semiring, and study the number of steps required to reach that fixpoint, if ever. We identify algebraic properties of the semiring that correspond to certain convergence properties of datalog programs. Finally, we describe a class of ordered semirings on which one can use the semi-naive evaluation algorithm on any datalog program. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1145/3517804.3524140 | PROCEEDINGS OF THE 41ST ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS '22) |
Keywords | DocType | Citations |
Datalog, Semirings, Fixpoint | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mahmoud Abo Khamis | 1 | 0 | 1.01 |
| Hung Q. Ngo | 2 | 0 | 0.68 |
| Reinhard Pichler | 3 | 338 | 29.21 |
| Dan Suciu | 4 | 9625 | 1349.54 |
| Yisu Remy Wang | 5 | 1 | 1.70 |