Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Certain query answering"'
Autor:
Koutris, Paraschos, Wijsen, Jef
A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a maximal number of tuples without ever selecting two distinct tuples wi
Externí odkaz:
http://arxiv.org/abs/1501.07864
Autor:
Sakho, Momar
Publikováno v:
Computational Complexity [cs.CC]. Université de Lille; Inria, 2020. English
Computational Complexity [cs.CC]. Université de Lille; Inria, 2020. English. ⟨NNT : ⟩
Computational Complexity [cs.CC]. Université de Lille; Inria, 2020. English. ⟨NNT : ⟩
Hyperstreams are collections of streams with references. The hope is that structured data on a hyperstream can be monitored with lower latency than when communicated on a stream, since data on hyperstreams may be received in parallel rather than in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a212521ac459f9006cf566992fe2f0e0
https://tel.archives-ouvertes.fr/tel-03028074
https://tel.archives-ouvertes.fr/tel-03028074
Publikováno v:
RP 2018-12th International Conference on Reachability Problems
RP 2018-12th International Conference on Reachability Problems, Sep 2018, Marseille, France
RP 2018-12th International Conference on Reachability Problems, Sep 2018, Marseille, France
International audience; We study the problem of certain query answering (CQA) on compressed string patterns. These are incomplete singleton context-free grammars, that can model systems of multiple streams with references to others, called hyperstrea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9f45caae6da01fa97c0dedaec162dfdf
https://hal.archives-ouvertes.fr/hal-01609498v4/file/submitted_rp.pdf
https://hal.archives-ouvertes.fr/hal-01609498v4/file/submitted_rp.pdf
We study the problem of certain query answering (CQA) on compressed string patterns. These are incomplete singleton context-free grammars, that can model systems of multiple streams with references to others, called hyperstreams more recently. In ord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::243473f0a31d555002e2d6a4df7f9ebb
https://hal.inria.fr/hal-01846016/document
https://hal.inria.fr/hal-01846016/document
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030002497
RP
RP
We study the problem of certain query answering (Cqa) on compressed string patterns. These are incomplete singleton context-free grammars, that can model systems of multiple streams with references to others, called hyperstreams more recently. In ord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22d1d22e6d52a668d933411dbc0b1483
https://doi.org/10.1007/978-3-030-00250-3_9
https://doi.org/10.1007/978-3-030-00250-3_9
Publikováno v:
Proceedings of the VLDB Endowment. 7:353-364
A database is called uncertain if two or more tuples of the same relation are allowed to agree on their primary key. Intuitively, such tuples act as alternatives for each other. A repair (or possible world) of such uncertain database is obtained by s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d381d23e06c82a179d94cb9a0eab84a7
https://doi.org/10.14778/2732269.2732272
https://doi.org/10.14778/2732269.2732272
Autor:
Ester Zumpano, Irina Trubitsyna, Sergio Greco, Cristian Molinaro, Marco Calautti, Luciano Caroprese
Active integrity constraints (AICs) are a useful formalism to express integrity constraints and policies to restore consistency in databases violating them. However, AICs do not allow users to express different kinds of constraints commonly arising i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::023f0d3567c40b11bf9cfc671530e15a
https://www.sciencedirect.com/science/article/abs/pii/S0957417420309982
https://www.sciencedirect.com/science/article/abs/pii/S0957417420309982
Autor:
Lozano Aparicio, Jose Martin
Publikováno v:
Computer Science [cs]. Universite de Lille, Lille, FRA.; Universite de Lille, 2020. English
Computer Science [cs]. Universite de Lille, Lille, FRA.; Universite de Lille, 2020. English. ⟨NNT : ⟩
Computer Science [cs]. Universite de Lille, Lille, FRA.; Universite de Lille, 2020. English. ⟨NNT : ⟩
Resource Description Framework (RDF) is a graph data model which has recently found the use of publishing on the web data from relational databases. We investigate data exchange from relational databases to RDF graphs with target shapes schemas. Esse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d6d4dba24418f5ff024bcb1c476b4db9
https://tel.archives-ouvertes.fr/tel-03118044/file/thesis.pdf
https://tel.archives-ouvertes.fr/tel-03118044/file/thesis.pdf
Publikováno v:
EDBT/ICDT Workshops-Querying Graph Structured Data (GraphQ)
EDBT/ICDT Workshops-Querying Graph Structured Data (GraphQ), Mar 2015, Bruxelles, Belgium. pp.171-176
Scopus-Elsevier
EDBT/ICDT Workshops-Querying Graph Structured Data (GraphQ), Mar 2015, Bruxelles, Belgium. pp.171-176
Scopus-Elsevier
International audience; Data exchange is the problem of translating data structured under a source schema according to a target schema and a set of source-to-target constraints known as schema mappings. In this paper, we investigate the problem of da
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d3ffbd1ffb636cb7fc415a9d31339264
https://inria.hal.science/hal-01095838/document
https://inria.hal.science/hal-01095838/document
Autor:
Wijsen, Jef1 wijsen@umh.ac.be
Publikováno v:
Information Systems. Nov2009, Vol. 34 Issue 7, p578-601. 24p.