Data manipulation: a cursor between data modeling and query optimization

Autor: Travers, Nicolas

Publikováno v: Base de données [cs.DB]. Sorbonne Universites, UPMC University of Paris 6, 2018

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::aa816b68c9c45f160a9f1ad374631fcf
https://hal.archives-ouvertes.fr/tel-01828183

Asymptotic Determinacy of Path Queries using Union-of-Paths Views

Autor: Nadime Francis

Publikováno v: Francis, N 2016, ' Asymptotic Determinacy of Path Queries using Union-of-Paths Views ', Theory of Computing Systems, vol. 61, no. 1, pp. 156-190 . https://doi.org/10.1007/s00224-016-9697-x
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2017, 61 (1), pp.156-190. ⟨10.1007/s00224-016-9697-x⟩
18th International Conference on Database Theory (ICDT 2015)
18th International Conference on Database Theory (ICDT 2015), Mar 2015, Brussels, Belgium. ⟨10.4230/LIPIcs.ICDT.2015.44⟩
Francis, N 2015, Asymptotic Determinacy of Path Queries using Union-of-Paths Views . in M Arenas & M Ugarte (eds), 18th International Conference on Database Theory (ICDT 2015) . vol. 31, Dagstuhl, Germany, pp. 44-59 . https://doi.org/10.4230/LIPIcs.ICDT.2015.44
Theory of Computing Systems, 2017, 61 (1), pp.156-190. ⟨10.1007/s00224-016-9697-x⟩

International audience; We consider the view determinacy problem over graph databases for queries defined as (possibly infinite) unions of path queries. These queries select pairs of nodes in a graph that are connected through a path whose length fal

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c3c398ba3275441feab0af7a0565e40
https://www.pure.ed.ac.uk/ws/files/26349833/icdt_asy.pdf

Bi-temporal Query Optimization Techniques in Decision Insight

Autor: AIT OUASSARAH, Azhar, AVERSENG, Nicolas, FOURNET, Xavier, Petit, Jean-Marc, REVOL, Romain, Scuturici, Vasile-Marian

Publikováno v: Bases de Données Avancées (BDA)
Bases de Données Avancées (BDA), Sep 2015, Île de Porquerolles, France

The complexity of dynamic environments in which companies work requires their managers to take rapid and relevant decisions. A business activity monitoring application should be able to implement complex bi-temporal queries on real-time data and hist

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::40e05b6aaac3ee01c2cbce4af9114e06
https://hal.archives-ouvertes.fr/hal-01228962

Efficient Query Answering against Dynamic RDF Databases

Autor: Ioana Manolescu, Alexandra Roatis, François Goasdoué

Publikováno v: EDBT-16th International Conference on Extending Database Technology
EDBT-16th International Conference on Extending Database Technology, Mar 2013, Genoa, Italy. ⟨10.1145/2452376.2452412⟩
EDBT

International audience; A promising method for efficiently querying RDF data consists of translating SPARQL queries into efficient RDBMS-style operations. However, answering SPARQL queries requires handling RDF reasoning, which must be implemented ou

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bc514dad5f1714f2c8b71ee5c64b694
https://hal.inria.fr/hal-00804503v2/document

SPARQL query answering with bitmap indexes

Autor: Julien Leblay

Publikováno v: SWIM
SWIM-4th International Workshop on Semantic Web Information Management-2012
SWIM-4th International Workshop on Semantic Web Information Management-2012, May 2012, Scottsdale, AZ, United States

International audience; When querying RDF data, one may use reasoning to reach intensional data, i.e., data defined by sets of rules. This is usually achieved through forward chaining, with space and maintenance overheads, or backward chaining, with

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a4c8f7b4d6456ccf2929e9a31e26b9d
https://doi.org/10.1145/2237867.2237876