Filters








21 Hits in 11.0 sec

Foundations of Modern Query Languages for Graph Databases [article]

Renzo Angles, Marcelo Arenas, Pablo Barcelo, Aidan Hogan, Juan Reutter, Domagoj Vrgoc
2017 arXiv   pre-print
We start with graph patterns, in which a graph-structured query is matched against the data.  ...  We conclude by discussing the importance of formalisation for graph query languages; a summary of what is known about SPARQL, Cypher and Gremlin in terms of expressivity and complexity; and an outline  ...  operator in cgps leads to a jump in complexity for query evaluation, or how having a no-repeated-node semantics can render path queries intractable, or (in the aforementioned case of SPARQL 1.1) how the  ... 
arXiv:1610.06264v3 fatcat:xd7wzmwmxvdwjau5zc5y5xguze

Foundations of Modern Query Languages for Graph Databases

Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan Reutter, Domagoj Vrgoč
2017 ACM Computing Surveys  
We start with graph patterns, in which a graph-structured query is matched against the data.  ...  We conclude by discussing the importance of formalisation for graph query languages; a summary of what is known about SPARQL, Cypher, and Gremlin in terms of expressivity and complexity; and an outline  ...  Unlike SPARQL, Cypher uses isomorphism-based no-repeated-edges bag semantics.  ... 
doi:10.1145/3104031 fatcat:azh2b4w56babrhj6n2vtsm5ebu

MillenniumDB: A Persistent, Open-Source, Graph Database [article]

Domagoj Vrgoc, Carlos Rojas, Renzo Angles, Marcelo Arenas, Diego Arroyuelo, Carlos Buil Aranda, Aidan Hogan, Gonzalo Navarro, Cristian Riveros, Juan Romero
2021 arXiv   pre-print
for evaluating path queries.  ...  In this paper, we present the main design principles underlying MillenniumDB, describing the abstract graph model and query semantics supported, the concrete data model and query syntax implemented, as  ...  Isomorphism-based semantics [3] -such as Cypher's no-repeated-edge semantics, which disallows the same solution to use the same edge twice -can be emulated by filtering solutions after they are generated.Conference  ... 
arXiv:2111.01540v1 fatcat:3ot3fpy2jjh5jgctiyikn6kpnq

G-CORE

Renzo Angles, Juan Sequeda, Oskar van Rest, Hannes Voigt, Marcelo Arenas, Pablo Barcelo, Peter Boncz, George Fletcher, Claudio Gutierrez, Tobias Lindaaker, Marcus Paradies, Stefan Plantikow
2018 Proceedings of the 2018 International Conference on Management of Data - SIGMOD '18  
CCS CONCEPTS • Information systems → Graph-based database models; Query languages for non-relational engines; • Theory of computation → Database query languages (principles);  ...  First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens.  ...  ACKNOWLEDGEMENTS The authors are grateful to the anonymous reviewers for their useful comments. R. Angles, M. Arenas, P. Barceló  ... 
doi:10.1145/3183713.3190654 dblp:conf/sigmod/AnglesABBFGLPPS18 fatcat:qsmw3iatpbdklaa6jy6ld4mcgq

An early look at the LDBC social network benchmark's business intelligence workload

Gábor Szárnyas, János Benjamin Antal, Arnau Prat-Pérez, Alex Averbuch, József Marton, Marcus Paradies, Moritz Kaufmann, Orri Erling, Peter Boncz, Vlad Haprian
2018 Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) - GRADES-NDA '18  
We outline the motivation for this new benchmark, which we derived from many interactions with the graph database industry and its users, and situate it in a scenario of social network analysis.  ...  and path finding.  ...  matching), • no-repeated-edge semantics (also known as edge-isomorphic matching), • no-repeated-anything semantics (not used in the context of this work).  ... 
doi:10.1145/3210259.3210268 dblp:conf/grades/SzarnyasPAMPKEB18 fatcat:2t2f2tut2be5xfmd4de5t7gskm

Graph Pattern Matching in GQL and SQL/PGQ [article]

Alin Deutsch and Nadime Francis and Alastair Green and Keith Hare and Bei Li and Leonid Libkin and Tobias Lindaaker and Victor Marsault and Wim Martens and Jan Michels and Filip Murlak and Stefan Plantikow and Petra Selmer and Hannes Voigt and Oskar van Rest and Domagoj Vrgoč and Mingxi Wu and Fred Zemke
2021 arXiv   pre-print
As graph databases become widespread, JTC1 -- the committee in joint charge of information technology standards for the International Organization for Standardization (ISO), and International Electrotechnical  ...  Commission (IEC) -- has approved a project to create GQL, a standard property graph query language.  ...  For instance, TRAIL forbids the matched path to repeat edges; there are only finitely many edges, therefore there are only finitely many paths with no repeated edges in a graph.  ... 
arXiv:2112.06217v1 fatcat:36mfja3qhncnbp3gayzsvhtgqa

Modular Path Queries with Arithmetic

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2021 Logical Methods in Computer Science  
We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity.  ...  The resulting formalism is computationally attractive - queries can be answered in non-deterministic logarithmic space in the size of the database.  ...  We have already mentioned that CYPHER has no-repeated-edge semantics for graph pattern matching. This makes the evaluation intractable [MW95] .  ... 
doi:10.46298/lmcs-17(3:27)2021 fatcat:zu3e4yiv5jecpktc52foici4xi

G-CORE: A Core for Future Graph Query Languages [article]

Renzo Angles and Marcelo Arenas and Pablo Barceló and Peter Boncz and George H. L. Fletcher and Claudio Gutierrez and Tobias Lindaaker and Marcus Paradies and Stefan Plantikow and Juan Sequeda and Oskar van Rest and Hannes Voigt
2017 arXiv   pre-print
We argue that existing graph database management systems should consider supporting a query language with two key characteristics.  ...  First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens.  ...  With respect to the evaluation of path expressions, G CORE uses shortest-path semantics (i.e. paths of minimal length are returned), Cypher 9 implements no-repeated-edge semantics (i.e. each edge occurs  ... 
arXiv:1712.01550v2 fatcat:hkje52hbmnbwbptpn5zbhoeoa4

Modular Path Queries with Arithmetic [article]

Jakub Michaliszyn and Jan Otop and Piotr Wieczorek
2021 arXiv   pre-print
We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity.  ...  The resulting formalism is computationally attractive - queries can be answered in non-deterministic logarithmic space in the size of the database.  ...  We have already mentioned that CYPHER has no-repeated-edge semantics for graph pattern matching. This makes the evaluation intractable [35] .  ... 
arXiv:2002.04460v5 fatcat:cy44rb2gcnhgll4h5tfi6lnzta

The LDBC Social Network Benchmark [article]

Renzo Angles, János Benjamin Antal, Alex Averbuch, Peter Boncz, Orri Erling, Andrey Gubichev, Vlad Haprian, Moritz Kaufmann, Josep Lluís Larriba Pey, Norbert Martínez, József Marton, Marcus Paradies (+6 others)
2021 arXiv   pre-print
This includes a detailed explanation of the data used in the LDBC SNB benchmark, a detailed description for all queries, and instructions on how to generate the data and run the benchmark with the provided  ...  For this, LDBC SNB uses the recognizable scenario of operating a social network, characterized by its graph-shaped data.  ...  Then, for each path calculate a weight. The nodes in the path are Persons, and the weight of a path is the sum of weights between every pair of consecutive Person nodes in the path.  ... 
arXiv:2001.02299v2 fatcat:47f7xrze4bgp3d75o5olr5xo6m

DescribeX: A Framework for Exploring and Querying XML Web Collections [article]

Flavio Rizzolo
2008 arXiv   pre-print
on axes, or axis path regular expression (AxPREs).  ...  DescribeX can significantly help in the understanding of both the structure of complex, heterogeneous XML collections and the behaviour of XPath queries evaluated on them.  ...  (A path is simple when it has no repeated edges.)  ... 
arXiv:0807.2972v1 fatcat:gtyd6djo5fb6jgm6iblefcgunq

Exploring XML web collections with DescribeX

Mariano P. Consens, Renée J. Miller, Flavio Rizzolo, Alejandro A. Vaisman
2010 ACM Transactions on the Web  
AxPREs provide the flexibility necessary for declaratively defining complex mappings between instance nodes (in the documents) and summary nodes.  ...  For these reasons, many applications that incorporate XPath queries to process a large web document collection require an understanding of the actual structure present in the collection, and not just the  ...  For some neighbourhoods, deciding bisimilarity is equivalent to comparing the sets of simple label paths from their roots to their leaves. (A path is simple when it has no repeated edges.)  ... 
doi:10.1145/1806916.1806920 fatcat:zbwam6cwtrespdhudcu2pednjm

Enumeration Problems for Regular Path Queries [article]

Wim Martens, Tina Trautner
2017 arXiv   pre-print
Evaluation of regular path queries (RPQs) is a central problem in graph databases.  ...  We observe that, even though simple path semantics and trail semantics are intractable for RPQs in general, they are feasible for the vast majority of the kinds of RPQs that users use in practice.  ...  Acknowledgments We are grateful to Phokion Kolaitis for suggesting us to study enumeration problems on simple paths matching RPQs.  ... 
arXiv:1710.02317v1 fatcat:temk4qfm7raq7jgiamqzlxt75m

Big Data Analysis in Smart Manufacturing: A Review

Kevin Nagorny, Pedro Lima-Monteiro, Jose Barata, Armando Walter Colombo
2017 International Journal of Communications, Network and System Sciences  
On the one hand, this evolution generates a huge field for exploitation, but on the other hand also increases complexity including new challenges and requirements demanding for new approaches in several  ...  , key performance indicator (KPI) optimization, diagnosis, predication, feedback to design or decision support.  ...  Acknowledgements This work is partly supported by the ProSEco (Collaborative Environment for  ... 
doi:10.4236/ijcns.2017.103003 fatcat:h4oc3siwizc2zlv452yuegd46y

Distributed Evaluation of Nonmonotonic Multi-context Systems

Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas Krennwallner
2015 The Journal of Artificial Intelligence Research  
While MCSs and related formalisms are inherently targeted for distributed set- tings, no truly distributed algorithms for their evaluation were available.  ...  emerges from the local semantics of the knowledge bases (also called "contexts") in an equilibrium.  ...  no repeated edges or vertices) with r ∈ V (P 0 ), and (iii) each P i (i > 0) is a non-trivial path (without cycles) whose endpoint t i is in P 0 ∪ · · · ∪ P i−1 , but the other nodes are not.  ... 
doi:10.1613/jair.4574 fatcat:p6xuouc3bja5tlwqscsx4fvtjm
« Previous Showing results 1 — 15 out of 21 results