Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Vrgoč, Domagoj"'
Graph databases are gaining momentum thanks to the flexibility and expressiveness of their data models and query languages. A standardization activity driven by the ISO/IEC standardization body is also ongoing and has already conducted to the specifi
Externí odkaz:
http://arxiv.org/abs/2407.04823
Path queries are a core feature of modern graph query languages such as Cypher, SQL/PGQ, and GQL. These languages provide a rich set of features for matching paths, such as restricting to certain path modes (shortest, simple, trail) and constraining
Externí odkaz:
http://arxiv.org/abs/2306.02194
Autor:
Angles, Renzo, Bonifati, Angela, Dumbrava, Stefania, Fletcher, George, Green, Alastair, Hidders, Jan, Li, Bei, Libkin, Leonid, Marsault, Victor, Martens, Wim, Murlak, Filip, Plantikow, Stefan, Savković, Ognjen, Schmidt, Michael, Sequeda, Juan, Staworko, Sławek, Tomaszuk, Dominik, Voigt, Hannes, Vrgoč, Domagoj, Wu, Mingxi, Živković, Dušan
Publikováno v:
Proc. ACM Manag. Data (2023)
Property graphs have reached a high level of maturity, witnessed by multiple robust graph database systems as well as the ongoing ISO standardization effort aiming at creating a new standard Graph Query Language (GQL). Yet, despite documented demand,
Externí odkaz:
http://arxiv.org/abs/2211.10962
Autor:
Francis, Nadime, Gheerbrant, Amélie, Guagliardo, Paolo, Libkin, Leonid, Marsault, Victor, Martens, Wim, Murlak, Filip, Peterfreund, Liat, Rogova, Alexandra, Vrgoč, Domagoj
The development of practical query languages for graph databases runs well ahead of the underlying theory. The ISO committee in charge of database query languages is currently developing a new standard called Graph Query Language (GQL) as well as an
Externí odkaz:
http://arxiv.org/abs/2210.16580
Modern graph database query languages such as GQL, SQL/PGQ, and their academic predecessor G-Core promote paths to first-class citizens in the sense that paths that match regular path queries can be returned to the user. This brings a number of chall
Externí odkaz:
http://arxiv.org/abs/2207.13541
Autor:
Vrgoč, Domagoj
The purpose of this report is to explain how the textbook breadth-first search algorithm (BFS) can be modified in order to also create a compact representation of all shortest paths connecting a single source node to all the nodes reachable from it.
Externí odkaz:
http://arxiv.org/abs/2204.11137
Autor:
Deutsch, Alin, Francis, Nadime, Green, Alastair, Hare, Keith, Li, Bei, Libkin, Leonid, Lindaaker, Tobias, Marsault, Victor, Martens, Wim, Michels, Jan, Murlak, Filip, Plantikow, Stefan, Selmer, Petra, Voigt, Hannes, van Rest, Oskar, Vrgoč, Domagoj, Wu, Mingxi, Zemke, Fred
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 projec
Externí odkaz:
http://arxiv.org/abs/2112.06217
Autor:
Vrgoc, Domagoj, Rojas, Carlos, Angles, Renzo, Arenas, Marcelo, Arroyuelo, Diego, Aranda, Carlos Buil, Hogan, Aidan, Navarro, Gonzalo, Riveros, Cristian, Romero, Juan
In this systems paper, we present MillenniumDB: a novel graph database engine that is modular, persistent, and open source. MillenniumDB is based on a graph data model, which we call domain graphs, that provides a simple abstraction upon which a vari
Externí odkaz:
http://arxiv.org/abs/2111.01540
Publikováno v:
Communications of the ACM; Aug2024, Vol. 67 Issue 8, p40-44, 5p
Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that they allo
Externí odkaz:
http://arxiv.org/abs/2010.13717