RDF data storage and query processing schemes: A survey

M Wylot, M Hauswirth, P Cudré-Mauroux… - ACM Computing Surveys …, 2018 - dl.acm.org
The Resource Description Framework (RDF) represents a main ingredient and data
representation format for Linked Data and the Semantic Web. It supports a generic graph …

Learning to optimize join queries with deep reinforcement learning

S Krishnan, Z Yang, K Goldberg, J Hellerstein… - arXiv preprint arXiv …, 2018 - arxiv.org
Exhaustive enumeration of all possible join orders is often avoided, and most optimizers
leverage heuristics to prune the search space. The design and implementation of heuristics …

A native and adaptive approach for unified processing of linked streams and linked data

D Le-Phuoc, M Dao-Tran, J Xavier Parreira… - International Semantic …, 2011 - Springer
In this paper we address the problem of scalable, native and adaptive query processing over
Linked Stream Data integrated with Linked Data. Linked Stream Data consists of data …

Llama: A heterogeneous & serverless framework for auto-tuning video analytics pipelines

F Romero, M Zhao, NJ Yadwadkar… - Proceedings of the ACM …, 2021 - dl.acm.org
The proliferation of camera-enabled devices and large video repositories has led to a
diverse set of video analytics applications. These applications rely on video pipelines …

[PDF][PDF] DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language

YYMID Fetterly, M Budiu, Ú Erlingsson, PKGJ Currey - Proc. LSDS-IR, 2009 - usenix.org
DryadLINQ is a system and a set of language extensions that enable a new programming
model for large scale distributed computing. It generalizes previous execution environments …

Optimizing subgraph queries by combining binary and worst-case optimal joins

A Mhedhbi, S Salihoglu - Proceedings of the VLDB Endowment, 2019 - dl.acm.org
We study the problem of optimizing subgraph queries using the new worst-case optimal join
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …

Elastic scaling for data stream processing

B Gedik, S Schneider, M Hirzel… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
This article addresses the profitability problem associated with auto-parallelization of
general-purpose distributed data stream processing applications. Auto-parallelization …

[PDF][PDF] Self-tuning database systems: a decade of progress

S Chaudhuri, V Narasayya - Proceedings of the 33rd …, 2007 - cs.washington.edu
In this paper we discuss advances in self-tuning database systems over the past decade,
based on our experience in the AutoAdmin project at Microsoft Research. This paper …

[PDF][PDF] Cardinality Estimation Done Right: Index-Based Join Sampling.

V Leis, B Radke, A Gubichev, A Kemper, T Neumann - Cidr, 2017 - cidrdb.org
After four decades of research, today's database systems still suffer from poor query
execution plans. Bad plans are usually caused by poor cardinality estimates, which have …

ANAPSID: an adaptive query processing engine for SPARQL endpoints

M Acosta, ME Vidal, T Lampo, J Castillo… - The Semantic Web …, 2011 - Springer
Following the design rules of Linked Data, the number of available SPARQL endpoints that
support remote query processing is quickly growing; however, because of the lack of …