TelegraphCQ: continuous dataflow processing

S Chandrasekaran, O Cooper, A Deshpande… - Proceedings of the …, 2003 - dl.acm.org
At Berkeley, we are develo** TelegraphCQ [1, 2], a dataflow system for processing
continuous queries over data streams. TelegraphCQ is based on a novel, highly-adaptive …

[КНИГА][B] Fundamentos de bases de datos

A Silberschatz, HF Korth, S Sudarshan, FS Pérez… - 2002 - academia.edu
• Bases de datos relacionales (Capítulos 4 al 7). El Capítulo 4 se centra en el lenguaje
relacional orientado al usuario de mayor influencia: SQL. El Capítulo 5 cubre otros dos …

Data integration flows for business intelligence

U Dayal, M Castellanos, A Simitsis… - Proceedings of the 12th …, 2009 - dl.acm.org
Business Intelligence (BI) refers to technologies, tools, and practices for collecting,
integrating, analyzing, and presenting large volumes of information to enable better decision …

SharedDB: killing one thousand queries with one stone

G Giannikis, G Alonso, D Kossmann - arxiv preprint arxiv:1203.0056, 2012 - arxiv.org
Traditional database systems are built around the query-at-a-time model. This approach
tries to optimize performance in a best-effort way. Unfortunately, best effort is not good …

Qpipe: A simultaneously pipelined relational query engine

S Harizopoulos, V Shkapenyuk… - Proceedings of the 2005 …, 2005 - dl.acm.org
Relational DBMS typically execute concurrent queries independently by invoking a set of
operator instances for each query. To exploit common data retrievals and computation in …

Scalable multi-query optimization for SPARQL

W Le, A Kementsietsidis, S Duan… - 2012 IEEE 28th …, 2012 - ieeexplore.ieee.org
This paper revisits the classical problem of multi-query optimization in the context of
RDF/SPARQL. We show that the techniques developed for relational and semi-structured …

Optimizing one-time and continuous subgraph queries using worst-case optimal joins

A Mhedhbi, C Kankanamge, S Salihoglu - ACM Transactions on …, 2021 - dl.acm.org
We study the problem of optimizing one-time and continuous subgraph queries using the
new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching …

Quickfoil: Scalable inductive logic programming

Q Zeng, JM Patel, D Page - Proceedings of the VLDB Endowment, 2014 - dl.acm.org
Inductive Logic Programming (ILP) is a classic machine learning technique that learns first-
order rules from relational-structured data. However, to-date most ILP systems can only be …

[PDF][PDF] Cooperative scans: dynamic bandwidth sharing in a DBMS

M Zukowski, S Héman, N Nes, P Boncz - Proceedings of the 33rd …, 2007 - ir.cwi.nl
This paper analyzes the performance of concurrent (index) scan operations in both record
(NSM/PAX) and column (DSM) disk storage models and shows that existing scheduling …

Multiple query optimization on the D-Wave 2X adiabatic quantum computer

I Trummer, C Koch - arxiv preprint arxiv:1510.06437, 2015 - arxiv.org
The D-Wave adiabatic quantum annealer solves hard combinatorial optimization problems
leveraging quantum physics. The newest version features over 1000 qubits and was …