OASIcs.ICLP.2018.9.pdf
- Filesize: 301 kB
- 3 pages
Document
Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified
Authors
-
Part of:
Volume:
Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)
Series: Open Access Series in Informatics (OASIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-11-19
Cite AsGet BibTex
Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky, and Tyson Condie. Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 9:1-9:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/OASIcs.ICLP.2018.9
https://doi.org/10.4230/OASIcs.ICLP.2018.9
Abstract
Recent advances are making possible the use of aggregates in recursive queries thus enabling the declarative expression classic algorithms and their efficient and scalable implementation. These advances rely the notion of Pre-Mappability (PreM) of constraints that, along with the seminaive-fixpoint operational semantics, guarantees formal non-monotonic semantics for recursive programs with min and max constraints. In this extended abstract, we introduce basic templates to simplify and automate task of proving PreM.
Subject Classification
ACM Subject Classification
- Information systems → Query languages
Keywords
- Recursive Queries
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Alexander Shkapsky, Mohan Yang, Matteo Interlandi, Hsuan Chiu, Tyson Condie, and Carlo Zaniolo. Big Data Analytics with Datalog Queries on Spark. In SIGMOD, pages 1135-1149. ACM, 2016.
-
Mohan Yang, Alexander Shkapsky, and Carlo Zaniolo. Scaling up the performance of more powerful Datalog systems on multicore machines. The VLDB Journal, 26(2):229-248, 2017.
-
Carlo Zaniolo, Mohan Yang, Ariyam Das, Alexander Shkapsky, Tyson Condie, and Matteo Interlandi. Fixpoint semantics and optimization of recursive Datalog programs with aggregates. TPLP, 17(5-6):1048-1065, 2017.
-
Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky, and Tyson Condie. Declarative Algorithms by Aggregates in Recursive Queries: their Formal Semantics Simplified. Report no. 180001, Computer Science Department, UCLA, April, 2018.