Handling iterations in distributed dataflow systems

GE Gévay, J Soto, V Markl - ACM Computing Surveys (CSUR), 2021 - dl.acm.org
Over the past decade, distributed dataflow systems (DDS) have become a standard
technology. In these systems, users write programs in restricted dataflow programming …

M4: a visualization-oriented time series data aggregation

U Jugel, Z Jerzak, G Hackenbroich… - Proceedings of the VLDB …, 2014 - dl.acm.org
Visual analysis of high-volume time series data is ubiquitous in many industries, including
finance, banking, and discrete manufacturing. Contemporary, RDBMS-based systems for …

All-in-one: Graph processing in RDBMSs revisited

K Zhao, JX Yu - Proceedings of the 2017 ACM International …, 2017 - dl.acm.org
To support analytics on massive graphs such as online social networks, RDF, Semantic
Web, etc. many new graph algorithms are designed to query graphs for a specific problem …

Ensembles of bireducts: towards robust classification and simple representation

D Ślęzak, A Janusz - International Conference on Future Generation …, 2011 - Springer
We introduce the notion of a bireduct, which is an extension of the notion of a reduct
developed within the theory of rough sets. For a decision system A=(U,A∪{d\}), a bireduct is …

SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog

R Angles, G Gottlob, A Pavlović, R Pichler… - Proceedings of the …, 2023 - dl.acm.org
Over the past decade, Knowledge Graphs have received enormous interest both from
industry and from academia. Research in this area has been driven, above all, by the …

VDDA: automatic visualization-driven data aggregation in relational databases

U Jugel, Z Jerzak, G Hackenbroich, V Markl - The VLDB Journal, 2016 - Springer
Contemporary RDBMS-based systems for visualization of high-volume numerical data have
difficulty to cope with the hard latency requirements and high ingestion rates of interactive …

Consistent query answering for primary keys in datalog

P Koutris, J Wijsen - Theory of Computing Systems, 2021 - Springer
We study the complexity of consistent query answering on databases that may violate
primary key constraints. A repair of such a database is any consistent database that can be …

Consistent query answering for primary keys in logspace

P Koutris, J Wijsen - arXiv preprint arXiv:1810.03386, 2018 - arxiv.org
We study the complexity of consistent query answering on databases that may violate
primary key constraints. A repair of such a database is any consistent database that can be …

Dynamic complexity under definable changes

T Schwentick, N Vortmeier, T Zeume - ACM Transactions on Database …, 2018 - dl.acm.org
In the setting of dynamic complexity, the goal of a dynamic program is to maintain the result
of a fixed query for an input database that is subject to changes, possibly using additional …

Comparación de dos gestores de base de datos Oracle 10g Express Edición y DB2 Express-C

MCL Loayza, NEB Lala - Polo del Conocimiento, 2023 - polodelconocimiento.com
Este trabajo realiza un estudio comparativo de dos gestores de base de datos: Oracle 10g
Express Edition y Db2 Express-C, se estudiaron varios puntos como: instalación, migración …