Zobrazeno 1 - 10
of 160
pro vyhledávání: '"Franconi, Enrico"'
Autor:
Abgrall, Théo, Franconi, Enrico
Nowadays we observe an evolving landscape of data management and analytics, emphasising the significance of meticulous data management practices, semantic modelling, and bridging business-technical divides, to optimise data utilisation and enhance va
Externí odkaz:
http://arxiv.org/abs/2407.07502
Autor:
Franconi, Enrico, Tessaris, Sergio
The logic of nulls in databases has been subject of investigation since their introduction in Codd's Relational Model, which is the foundation of the SQL standard. We show a logical characterisation of a first-order fragment of SQL with null values,
Externí odkaz:
http://arxiv.org/abs/2202.10898
We introduce $\mathcal{DLR}^+$, an extension of the n-ary propositionally closed description logic $\mathcal{DLR}$ to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectifi
Externí odkaz:
http://arxiv.org/abs/1707.08468
Autor:
Artale, Alessandro, Franconi, Enrico
We introduce an extension of the n-ary description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), with arbitrary projections of relations (inclusion dependencies), generic functional dependencies and with glo
Externí odkaz:
http://arxiv.org/abs/1604.00799
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 2, pp. 504-517, February 2015
A set of views defined by selection queries splits a database relation into sub-relations, each containing a subset of the original rows. This decomposition into horizontal fragments is lossless when the initial relation can be reconstructed from the
Externí odkaz:
http://arxiv.org/abs/1506.03625
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Franconi, Enrico, Guagliardo, Paolo
In this paper, we revisit the view update problem in a relational setting and propose a framework based on the notion of determinacy under constraints. Within such a framework, we characterise when a view mapping is invertible, establishing that this
Externí odkaz:
http://arxiv.org/abs/1211.3016
An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity is given. The algorithm is based on the tableau algorithm for reasoning with individuals in SHIQ. The blocking conditions of the tableau are weak
Externí odkaz:
http://arxiv.org/abs/cs/0507059
Publikováno v:
"International Workshop On Databases, Information Systems and Peer-to-Peer Computing", 2003
In this paper we give a robust logical and computational characterisation of peer-to-peer database systems. We first define a pre- cise model-theoretic semantics of a peer-to-peer system, which allows for local inconsistency handling. We then charact
Externí odkaz:
http://arxiv.org/abs/cs/0308013