A survey of RDF stores & SPARQL engines for querying knowledge graphs
RDF has seen increased adoption in recent years, prompting the standardization of the
SPARQL query language for RDF, and the development of local and distributed engines for …
SPARQL query language for RDF, and the development of local and distributed engines for …
Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries
Numerous irregular graph datasets, for example social networks or web graphs, may contain
even trillions of edges. Often, their structure changes over time and they have domain …
even trillions of edges. Often, their structure changes over time and they have domain …
Emptyheaded: A relational engine for graph processing
CR Aberger, A Lamb, S Tu, A Nötzli… - ACM Transactions on …, 2017 - dl.acm.org
There are two types of high-performance graph processing engines: low-and high-level
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …
Design and implementation of the LogicBlox system
The LogicBlox system aims to reduce the complexity of software development for modern
applications which enhance and automate decision-making and enable their users to evolve …
applications which enhance and automate decision-making and enable their users to evolve …
Communication steps for parallel query processing
We study the problem of computing conjunctive queries over large databases on parallel
architectures without shared storage. Using the structure of such a query q and the skew in …
architectures without shared storage. Using the structure of such a query q and the skew in …
[图书][B] Querying graphs
Graph data modeling and querying arises in many practical application domains such as
social and biological networks where the primary focus is on concepts and their …
social and biological networks where the primary focus is on concepts and their …
Skew strikes back: new developments in the theory of join algorithms
Evaluating the relational join is one of the central algorithmic and most well-studied
problems in database systems. A staggering number of variants have been considered …
problems in database systems. A staggering number of variants have been considered …
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 …
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …
[PDF][PDF] Leapfrog triejoin: A simple, worst-case optimal join algorithm
TL Veldhuizen - Proc. International Conference on Database …, 2014 - openproceedings.org
Recent years have seen exciting developments in join algorithms. In 2008, Atserias, Grohe
and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full …
and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full …
Learning linear regression models over factorized joins
We investigate the problem of building least squares regression models over training
datasets defined by arbitrary join queries on database tables. Our key observation is that …
datasets defined by arbitrary join queries on database tables. Our key observation is that …