Výsledky vyhledávání - "Tuple Generating Dependencies"

Semi-Oblivious Chase Termination: The Sticky Case

Publikováno v: Calautti, M & Pieris, A 2021, ' Semi-Oblivious Chase Termination: The Sticky Case ', Theory of Computing Systems, vol. 65, no. 1, pp. 84-121 . https://doi.org/10.1007/s00224-020-09994-5

The chase procedure is a fundamental algorithmic tool in database theory with a variety of applications. A key problem concerning the chase procedure is all-instances termination: for a given set of tuple-generating dependencies (TGDs), is it the cas

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db4ffa8390931284f3467c0abe886917
https://doi.org/10.1007/s00224-020-09994-5

Zobrazit plný text záznamu

Model-theoretic characterizations of rule-based ontologies

Autor: Phokion G. Kolaitis, Marco Console, Andreas Pieris

Publikováno v: Console, M, Kolaitis, P G & Pieris, A 2021, Model-theoretic Characterizations of Rule-based Ontologies . in Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems . pp. 416-428, ACM SIGMOD/PODS International Conference on Management Data, Xi'an, China, 20/06/21 . https://doi.org/10.1145/3452021.3458310
PODS

An ontology specifies an abstract model of a domain of interest via a formal language that is typically based on logic. Although description logics are popular formalisms for modeling ontologies, it is generally agreed that tuple-generating dependenc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c90fe80dcd13d9cd6a703597093f976b
http://hdl.handle.net/11573/1568516

Zobrazit plný text záznamu

Oblivious Chase Termination:The Sticky Case

Autor: Calautti, Marco, Andreas, Pieris

Publikováno v: Calautti, M & Pieris, A 2019, Oblivious Chase Termination : The Sticky Case . in P Barcelo & M Calautti (eds), 22nd International Conference on Database Theory (ICDT 2019) ., 17, LIPICS, vol. 127, 22nd International Conference on Database Theory, Lisbon, Portugal, 26/03/19 . https://doi.org/10.4230/LIPIcs.ICDT.2019.17

The chase procedure is one of the most fundamental algorithmic tools in database theory. A key algorithmic task is uniform chase termination, i.e., given a set of tuple-generating dependencies (tgds), is it the case that the chase under this set of t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::680ec1e984719c45715b22f222ee9178
https://www.pure.ed.ac.uk/ws/files/79569204/Oblivious_Chase_Termination.pdf

Zobrazit plný text záznamu

Semantic Optimization of Conjunctive Queries

Autor: Diego Figueira, Andreas Pieris, Georg Gottlob, Pablo Barceló

Publikováno v: Barceló, P, Figueira, D, Gottlob, G & Pieris, A 2020, ' Semantic Optimization of Conjunctive Queries ', Journal of the ACM, vol. 67, no. 6, 34 . https://doi.org/10.1145/3424908
Journal of the ACM (JACM)
Journal of the ACM (JACM), Association for Computing Machinery, 2020, 67 (6:34), ⟨10.1145/3424908⟩

This work deals with the problem of semantic optimization of the central class of conjunctive queries (CQs). Since CQ evaluation is NP-complete, a long line of research has focussed on identifying fragments of CQs that can be efficiently evaluated. O

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7ad81487033a1a859c962de721c49d1
https://www.pure.ed.ac.uk/ws/files/177005718/Semantic_Optimization_BARCELO_DOA01092020_AFV.pdf

Zobrazit plný text záznamu

GGDs : Graph Generating Dependencies

Autor: George H. L. Fletcher, Larissa Capobianco Shimomura, Nikolay Yakovets

Publikováno v: CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2217-2220
STARTPAGE=2217;ENDPAGE=2220;TITLE=CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
CIKM

We propose Graph Generating Dependencies (GGDs), a new class of dependencies for property graphs. Extending the expressivity of state of the art constraint languages, GGDs can express both tuple- and equality-generating dependencies on property graph

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaf66d8cdcb42fe71dbf1aad2116c04d
http://www.scopus.com/inward/record.url?scp=85095863305&partnerID=8YFLogxK

Zobrazit plný text záznamu

Distribution Constraints: The Chase for Distributed Data

Autor: Geck, Gaetano, Neven, Frank, Schwentick, Thomas

This paper introduces a declarative framework to specify and reason about distributions of data over computing nodes in a distributed setting. More specifically, it proposes distribution constraints which are tuple and equality generating dependencie

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0291184f43d6edcd16b3537506d5f629
http://arxiv.org/abs/2003.00965

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání