Graph Pattern Matching in GQL and SQL/PGQ

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

The Future is Big Graphs! A Community View on Graph Processing Systems

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

The future is big graphs

Autor: Sakr, Sherif, Bonifati, Angela, Voigt, Hannes, Iosup, Alexandru, Ammar, Khaled, Angles, Renzo, Aref, Walid, Arenas, Marcelo, Besta, MacIej, Boncz, Peter A., Daudjee, Khuzaima, Valle, Emanuele Della, 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

Publikováno v: Sakr, S, Bonifati, A, Voigt, H, Iosup, A, Ammar, K, Angles, R, Aref, W, Arenas, M, Besta, M, Boncz, P A, Daudjee, K, Valle, E D, Dumbrava, S, Hartig, O, Haslhofer, B, Hegeman, T, Hidders, J, Hose, K, Iamnitchi, A, Kalavri, V, Kapp, H, Martens, W, Özsu, M T, Peukert, E, Plantikow, S, Ragab, M, Ripeanu, M R, Salihoglu, S, Schulz, C, Selmer, P, Sequeda, J F, Shinavier, J, Szárnyas, G, Tommasini, R, Tumeo, A, Uta, A, Varbanescu, A L, Wu, H Y, Yakovets, N, Yan, D & Yoneki, E 2021, ' The future is big graphs ', Communications of the ACM, vol. 64, no. 9, pp. 62-71 . https://doi.org/10.1145/3434642
Communications of the ACM, 64(9), 62-71. Association for Computing Machinery (ACM)

Graphs are ubiquitous abstractions enabling reusable computing tools for graph processing with applications in every domain. Diverse workloads, standard models and languages, algebraic frameworks, and suitable and reproducible performance metrics wil

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b33f2aaab81d3b1a85c86c53d608e69f
https://hdl.handle.net/1871.1/63d16dd1-45c6-4eab-ae29-1356c73e01b6

Implementing flexible operators for regular path queries

Autor: Selmer, Petra, Poulovassilis, Alexandra, Wood, Peter T.

Given the heterogeneity of complex graph data on the web, such as RDF linked data,a user wishing to query such data may lack full knowledge of its structure and irregularities.\ud Hence, providing users with flexible querying capabilities can be bene

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::08ded07b2aa2fbe584d4f42e8234000c
https://eprints.bbk.ac.uk/id/eprint/11907/1/workshop.pdf

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.