A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Distributed Processing of Generalized Graph-Pattern Queries in SPARQL 1.1
[article]
2016
arXiv
pre-print
Preserved Fulltext
Other Versions
From a relational perspective, this class resolves to conjunctive queries of relational joins with additional graph-reachability predicates. ...
For the scalable, i.e., distributed, processing of this kind of queries over very large RDF collections, we develop a suitable partitioning and indexing scheme, which allows us to shard the RDF triples ...
We extend TriAD's optimizer to handle SwPP queries by adding a new operator-Distributed Reachability Join (DRJ)-and respective cost estimator for property paths. ...
arXiv:1609.05293v2
fatcat:d5dvgojzfzajro3knlrt4pcnti
GraphX: Unifying Data-Parallel and Graph-Parallel Analytics
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
GraphX uses a collection of query optimization techniques such as automatic join rewrites to efficiently implement these graph-parallel operators. ...
GraphX provides a small, core set of graph-parallel operators expressive enough to implement the Pregel and PowerGraph abstractions, yet simple enough to be cast in relational algebra. ...
for specific ETL tasks (e.g., parsing a text file into a property graph). ...
arXiv:1402.2394v1
fatcat:xxx2uvx6arbgdnjqiw7igqztnm
Towards scalable RDF graph analytics on MapReduce
2010
Proceedings of the 2010 Workshop on Massive Data Analytics on the Cloud - MDAC '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
An important impact of this work is that it could serve as the foundation for additional physical operators in systems such as Pig for more efficient graph processing. ...
RDF data is modeled as a labeled graph that represents a collection of binary relations (triples). ...
Joining the stars and look-ahead Processing Ordinarily, the next phase would be to compute the join between the two star sub graphs based on a join property. ...
doi:10.1145/1779599.1779604
fatcat:tvk3s4hhhrazbo5gxn4i4pus44
Towards Efficient Path Query on Social Network with Hybrid RDF Management
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this hybrid framework, we realize an efficient in-memory algebra operator for property path query using graph traversal, and estimate the cost of this operator to cooperate with existing cost-based ...
present a main memory/disk based hybrid RDF data management framework for efficient property path query. ...
For an online query, we implement a graph traversal based algebra operators for property path pattern, which is more efficient than traditional join-based operator. Contributions. ...
arXiv:1405.6500v2
fatcat:yfyym5stofamvgsc2d6h3757ym
SPARQL over GraphX
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, due to the graph nature of RDF data, evaluating SPARQL queries in relational databases and common data-parallel systems needs a lot of joins and is inefficient. ...
In this work we take advantage of the graph representation of RDF data and exploit GraphX, a new graph processing system based on Spark. ...
Another set of useful operators are join operators which can be used for updating properties of edges or vertices. ...
arXiv:1701.03091v1
fatcat:kgxnclgd75glbnnzslynxvwnce
A Logical Model for joining Property Graphs
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The present paper upgrades the logical model required to exploit materialized views over property graphs as intended in the seminal paper "A Join Operator for Property Graphs". ...
Furthermore, we provide some computational complexity proofs strengthening the contribution of a forthcoming graph equi-join algorithm proposed in a recently accepted paper. ...
Given that graph join returns a property graph like the graphs in input, property graphs are closed under the graph join operator via the definition of ⊕ for the multiset θ-join. ...
arXiv:2106.14766v1
fatcat:pg3ewddhrbdldhhqga7xkll6pe
Reducing Property Graph Queries to Relational Algebra for Incremental View Maintenance
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present an approach to perform IVM on property graphs, using a nested relational algebraic representation for property graphs and graph operations. ...
The property graph data model of modern graph database systems is increasingly adapted for storing and processing heterogeneous datasets like networks. ...
Hegyi, József Makai, Kristóf Marussy, Márton Elekes, Oszkár Semeráth, Dávid Szakállas, Muhammad Idris, and Semih Salihoglu, along with the Graphflow team, the DBToaster team and the Cypher Language Group for ...
arXiv:1806.07344v1
fatcat:wy32pnrctjejrohfjp43wrkw2q
An Intermediate Algebra for Optimizing RDF Graph Pattern Matching on MapReduce
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This cost is prohibitive for RDF graph pattern matching queries which typically involve several join operations. ...
In this paper, we propose an approach for optimizing graph pattern matching by reinterpreting certain join tree structures as grouping operations. ...
The VP approach results in a series of join operations but on smaller property-based relations. ...
doi:10.1007/978-3-642-21064-8_4
fatcat:znr6unrnezdp3hnb22mugka5fq
Advanced join strategies for large-scale distributed computation
2014
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In this paper we study the very common join operation, discuss some unique challenges in the large-scale distributed scenario, and explain how to efficiently and robustly process joins in a distributed ...
., search logs, click streams, and web graph data). ...
to partial-cross join graph based on interesting properties. ...
doi:10.14778/2733004.2733020
fatcat:jvy4ib4czzgwfgrrjymika364e
Szeged-type indices of subdivision vertex-edge join (SVE-join)
2020
Main Group Metal Chemistry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
graph product called subdivision vertex-edge join of graphs. ...
Padmakar-Ivan (PIv ) index, vertex Szeged (Szv ) index, edge Padmakar-Ivan (PIe ) index, edge Szeged (Sze ) index, weighted vertex Padmakar-Ivan (wPIv ) index, and weighted vertex Szeged (wSzv ) index of a ...
In this section, we define a recently defined graph operation known as subdivision vertex edge join of graphs. It is denoted by SVE-join of graphs. ...
doi:10.1515/mgmc-2021-0011
fatcat:wy3ubnelarha5oljyan7taj454
Formalising opencypher Graph Queries in Relational Algebra
[article]
2017
arXiv
accepted
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We introduce relational graph algebra, which extends relational operators by adapting graph-specific operators and define a mapping from core openCypher constructs to this algebra. ...
In this paper, we present a formal specification for openCypher, a high-level declarative graph query language with an ongoing standardisation effort. ...
The authors would like to thank Gábor Bergmann and János Maginecz for their comments on the draft of this paper. ...
arXiv:1705.02844v2
fatcat:pt24fdqevvco5jslqfzwmo574m
Model-Driven Engineering of an OpenCypher Engine: Using Graph Queries to Compile Graph Queries
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The openCypher group aims to define an open specification for a declarative graph query language. ...
Graph database systems are increasingly adapted for storing and processing heterogeneous network-like datasets. ...
We would like to thank János Maginecz and Dávid Szakállas for their contributions to the relational graph algebra model. ...
doi:10.1007/978-3-319-68015-6_6
fatcat:p7ddvxx2tfbwbp7yeq6yjnwmsu
On Joining Graphs
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In particular, a counterpart of the relational join is not present in existing graph query languages, and consequently no efficient algorithms have been developed for this operator. ...
First, we define a binary graph join operator that acts on the vertices as a standard relational join and combines the edges according to a user-defined semantics. ...
GRAPH DATA MODEL We now define a simplified Property Graph data model, which uses only the basic desired feature that are required to develop a graph join operation over graphs. ...
arXiv:1608.05594v1
fatcat:25u6agbowfcnzktosfrwsdvmzq
Cypher-based Graph Pattern Matching in Gradoop
2017
Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems - GRADES'17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Using LDBC graph data, we show that our query engine is scalable for operational as well as analytical workloads. e implementation is open-source and easy to extend for further research. ...
Graph pa ern matching is an important and challenging operation on graph data. Typical use cases are related to graph analytics. ...
., merging two embeddings in a join operation is an append-only operation for identi ers and properties. ...
doi:10.1145/3078447.3078450
dblp:conf/grades/JunghannsKAPR17
fatcat:gpmpjqjgprdfvnnldiq6loc64i
KGTK: A Toolkit for Large Knowledge Graph Manipulation and Analysis
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2006.00088v1 fatcat:as5yhauzmzdk3icmsps2mq7gjeOther Versions
While KGs have become a mainstream technology, the RDF/SPARQL-centric toolset for operating with them at scale is heterogeneous, difficult to integrate and only covers a subset of the operations that are ...
KGTK represents graphs in tables and leverages popular libraries developed for data science applications, enabling a wide audience of developers to easily construct knowledge graph pipelines for their ...
Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained ...
arXiv:2006.00088v3
fatcat:4wuua6zyincxtmxzdy5ptztm3y
« Previous
Showing results 1 — 15 out of 163,319 results