[PDF][PDF] The NPD Benchmark: Reality Check for OBDA Systems.
In the last decades we moved from a world in which an enterprise had one central database—
rather small for todays' standards—to a world in which many different—and big—databases …
rather small for todays' standards—to a world in which many different—and big—databases …
Value creation using clouds: Analysis of value drivers for start-ups and small and medium sized enterprises in the textile industry
A Mladenow, E Fuchs, P Dohmen… - 2012 26th International …, 2012 - ieeexplore.ieee.org
Cloud Computing is increasingly emerging in support of the acronym" Anything as a
Service"(XaaS). Whereas its benefits have been delineated frequently in the literature, no …
Service"(XaaS). Whereas its benefits have been delineated frequently in the literature, no …
[PDF][PDF] The hunt for a red spider: Conjunctive query determinacy is undecidable
T Gogacz, J Marcinkowski - arXiv preprint arXiv:1501.01817, 2015 - arxiv.org
arXiv:1501.01817v2 [cs.DB] 12 Jan 2015 Page 1 arXiv:1501.01817v2 [cs.DB] 12 Jan 2015 The
Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. Tomasz Gogacz, Jerzy …
Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. Tomasz Gogacz, Jerzy …
Red spider meets a rainworm: Conjunctive query finite determinacy is undecidable
T Gogacz, J Marcinkowski - Proceedings of the 35th ACM SIGMOD …, 2016 - dl.acm.org
We solve a well known and long-standing open problem in database theory, proving that
Conjunctive Query Finite Determinacy Problem is undecidable. The technique we use builds …
Conjunctive Query Finite Determinacy Problem is undecidable. The technique we use builds …
[PDF][PDF] The NPD Benchmark for OBDA Systems.
In Ontology-Based Data Access (OBDA), queries are posed over a high-level conceptual
view, and then translated into queries over a potentially very large (usually relational) data …
view, and then translated into queries over a potentially very large (usually relational) data …
Re-looking at the View Update Problem
T Brennan - arXiv preprint arXiv:2210.15711, 2022 - arxiv.org
Relational databases have always had a means for creating a pseudo-table, called a view,
defined by a query. Views are like tables in most ways, except that they are read-only and …
defined by a query. Views are like tables in most ways, except that they are read-only and …
Incremental computations over strongly distributed databases
EV Ravve - Concurrency and Computation: Practice and …, 2016 - Wiley Online Library
This contribution deals with systematic exploitation of logical reduction techniques to big
distributed data handling. The particular applications are views and parallel updates over …
distributed data handling. The particular applications are views and parallel updates over …
Views and updates over distributed databases
EV Ravve - 2014 16th International Symposium on Symbolic …, 2014 - ieeexplore.ieee.org
This contribution deals with systematic exploitation of logical reduction techniques to
databases. The particular applications are views and updates over distributed databases …
databases. The particular applications are views and updates over distributed databases …
[HTML][HTML] Administrando Ontologías Grandes y Altamente Expresivas Mediante OWLAPI
ME Puebla Martínez, A Simón Cuevas… - Revista Cubana de …, 2021 - scielo.sld.cu
La mayoría de las herramientas de código abierto para administrar y razonar sobre
ontologías grandes requieren cargar previamente toda la ontología en la memoria principal …
ontologías grandes requieren cargar previamente toda la ontología en la memoria principal …
[PDF][PDF] Extensión del framework OWLAPI para la administración y razonamiento sobre grandes ontologıas
ME Puebla-Martınez, JM Perea-Ortega… - 2018 - academia.edu
En la actualidad, la administración y el razonamiento en ontologıas grandes se considera
una tarea de uso intensivo de recursos, principalmente debido a la complejidad de los …
una tarea de uso intensivo de recursos, principalmente debido a la complejidad de los …