Document Open Access Logo

Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified

Authors Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky, Tyson Condie

PDF

File

Thumbnail PDF
PDF
OASIcs.ICLP.2018.9.pdf
  • Filesize: 301 kB
  • 3 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Information systems → Query languages
Keywords
  • Recursive Queries

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get 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

Author Details

Carlo Zaniolo
  • University of California, Los Angeles, USA
Mohan Yang
  • Google
Matteo Interlandi
  • Microsoft Corporation
Ariyam Das
  • University of California, Los Angeles, USA
Alexander Shkapsky
  • University of California, Los Angeles, USA
Tyson Condie
  • University of California, Los Angeles, USA

References

  1. 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. Google Scholar
  2. 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. Google Scholar
  3. 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. Google Scholar
  4. 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. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact