Zobrazeno 1 - 10
of 230
pro vyhledávání: '"Martens, Wim"'
Factorized Databases (FDBs) and the recently introduced Path Multiset Representations (PMRs) both aim at compactly representing results of database queries, and are quite different at first sight. FDBs were developed for the relational database model
Externí odkaz:
http://arxiv.org/abs/2309.11663
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:
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:
Bonifati, Angela, Dumbrava, Stefania, Fletcher, George, Hidders, Jan, Hofer, Matthias, Martens, Wim, Murlak, Filip, Shinavier, Joshua, Staworko, Sławek, Tomaszuk, Dominik
Threshold queries are an important class of queries that only require computing or counting answers up to a specified threshold value. To the best of our knowledge, threshold queries have been largely disregarded in the research literature, which is
Externí odkaz:
http://arxiv.org/abs/2106.15703
Autor:
Sakr, Sherif, Bonifati, Angela, Voigt, Hannes, Iosup, Alexandru, Ammar, Khaled, Angles, Renzo, Aref, Walid, Arenas, Marcelo, Besta, Maciej, Boncz, Peter A., Daudjee, Khuzaima, Della Valle, Emanuele, Dumbrava, Stefania, Hartig, Olaf, Haslhofer, Bernhard, Hegeman, Tim, Hidders, Jan, Hose, Katja, Iamnitchi, Adriana, Kalavri, Vasiliki, Kapp, Hugo, Martens, Wim, Özsu, M. Tamer, Peukert, Eric, Plantikow, Stefan, Ragab, Mohamed, Ripeanu, Matei R., Salihoglu, Semih, Schulz, Christian, Selmer, Petra, Sequeda, Juan F., Shinavier, Joshua, Szárnyas, Gábor, Tommasini, Riccardo, Tumeo, Antonino, Uta, Alexandru, Varbanescu, Ana Lucia, Wu, Hsiang-Yun, Yakovets, Nikolay, Yan, Da, Yoneki, Eiko
Graphs are by nature unifying abstractions that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. Although real users and consumers of graph instances and graph workloads understand these a
Externí odkaz:
http://arxiv.org/abs/2012.06171
Autor:
Bonifati, Angela, Guerrini, Giovanna, Lutz, Carsten, Martens, Wim, Mazilu, Lara, Paton, Norman, Salles, Marcos Antonio Vaz, Scholl, Marc H., Zhou, Yongluan
The joint EDBT/ICDT conference (International Conference on Extending Database Technology/International Conference on Database Theory) is a well established conference series on data management, with annual meetings in the second half of March that a
Externí odkaz:
http://arxiv.org/abs/2004.07668
Autor:
Figueira, Diego, Godbole, Adwait, Krishna, S., Martens, Wim, Niewerth, Matthias, Trautner, Tina
Testing containment of queries is a fundamental reasoning task in knowledge representation. We study here the containment problem for Conjunctive Regular Path Queries (CRPQs), a navigational query language extensively used in ontology and graph datab
Externí odkaz:
http://arxiv.org/abs/2003.04411