Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Stefania Dumbrava"'
Autor:
Angela Bonifati, Stefania Dumbrava, Emile Martinez, Fatemeh Ghasemi, Malo Jaffré, Pacôme Luton, Thomas Pickles
Publikováno v:
VLDB 2022: 48th International Conference on Very Large Data Bases(VLDB 2022)
48th International Conference on Very Large Data Bases(VLDB 2022)
48th International Conference on Very Large Data Bases(VLDB 2022), Sep 2022, Sydney, Australia. pp.3654-3657, ⟨10.14778/3554821.3554867⟩
48th International Conference on Very Large Data Bases(VLDB 2022)
48th International Conference on Very Large Data Bases(VLDB 2022), Sep 2022, Sydney, Australia. pp.3654-3657, ⟨10.14778/3554821.3554867⟩
Property graphs are becoming pervasive in a variety of graph processing applications using interconnected data. They allow to encode multi-labeled nodes and edges, as well as their properties, represented as key/value pairs. Although property graphs
Publikováno v:
2022 IEEE 8th International Conference on Network Softwarization (NetSoft).
Publikováno v:
NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium.
Publikováno v:
Encyclopedia of Big Data Technologies ISBN: 9783319639628
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70c9e41522a1754c32f5e46093244f73
https://doi.org/10.1007/978-3-319-63962-8_336-1
https://doi.org/10.1007/978-3-319-63962-8_336-1
Autor:
Keith W. Hare, George H. L. Fletcher, Sławek Staworko, Michael Schmidt, Leonid Libkin, Jan Hidders, Stefania Dumbrava, Angela Bonifati, Victor E. Lee, Bei Li, Filip Murlak, Juan F. Sequeda, Wim Martens, Ognjen Savkovic, Dominik Tomaszuk, Renzo Angles, Josh Perryman
Publikováno v:
ACM Special Interest Group on Management of Data (SIGMOD)
ACM Special Interest Group on Management of Data (SIGMOD), Jun 2021, Xi'an, China. ⟨10.1145/3448016.3457561⟩
Angles, R, Bonifati, A, Dumbrava, S, Fletcher, G, Hare, K W, Hidders, J, Lee, V E, Li, B, Libkin, L, Martens, W, Murlak, F, Perryman, J, Savković, O, Schmidt, M, Sequeda, J, Staworko, S & Tomaszuk, D 2021, PG-Keys: Keys for Property Graphs . in Proceedings of the 2021 International Conference on Management of Data (SIGMOD ’21) . pp. 2423-2436, ACM SIGMOD/PODS International Conference on Management Data, Xi'an, China, 20/06/21 . https://doi.org/10.1145/3448016.3457561
SIGMOD Conference
ACM Special Interest Group on Management of Data (SIGMOD), Jun 2021, Xi'an, China. ⟨10.1145/3448016.3457561⟩
Angles, R, Bonifati, A, Dumbrava, S, Fletcher, G, Hare, K W, Hidders, J, Lee, V E, Li, B, Libkin, L, Martens, W, Murlak, F, Perryman, J, Savković, O, Schmidt, M, Sequeda, J, Staworko, S & Tomaszuk, D 2021, PG-Keys: Keys for Property Graphs . in Proceedings of the 2021 International Conference on Management of Data (SIGMOD ’21) . pp. 2423-2436, ACM SIGMOD/PODS International Conference on Management Data, Xi'an, China, 20/06/21 . https://doi.org/10.1145/3448016.3457561
SIGMOD Conference
International audience; We report on a community effort between industry and academia to shape the future of property graph constraints. The standardization for a property graph query language is currently underway through the ISO Graph Query Languag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df18458f47b9c9961f4b621a570b207f
https://inria.hal.science/hal-03189192/document
https://inria.hal.science/hal-03189192/document
Autor:
Angela Bonifati, Stefania Dumbrava
Publikováno v:
SIGMOD record
SIGMOD record, ACM, 2018, 47 (4), pp.5-16. ⟨10.1145/3335409.3335411⟩
SIGMOD record, 2018, 47 (4), pp.5-16. ⟨10.1145/3335409.3335411⟩
SIGMOD record, ACM, 2018, 47 (4), pp.5-16. ⟨10.1145/3335409.3335411⟩
SIGMOD record, 2018, 47 (4), pp.5-16. ⟨10.1145/3335409.3335411⟩
International audience; We review various graph query language fragments that are both theoretically tractable and practically relevant. We focus on the most expressive one that retains these properties and use it as a stepping stone to examine the u
Autor:
Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, Wim Martens, Filip Murlak, Joshua Shinavier, Sławek Staworko, Dominik Tomaszuk
Publikováno v:
Proceedings of the VLDB Endowment (PVLDB)
Proceedings of the VLDB Endowment (PVLDB), 2022, ⟨10.14778/3510397.3510407⟩
Proceedings of the VLDB Endowment (PVLDB), 2022, 15 (5), pp.1105-1118. ⟨10.14778/3510397.3510407⟩
Proceedings of the VLDB Endowment (PVLDB), VLDB Endowment, 2022
Proceedings of the VLDB Endowment (PVLDB), 2022, ⟨10.14778/3510397.3510407⟩
Proceedings of the VLDB Endowment (PVLDB), 2022, 15 (5), pp.1105-1118. ⟨10.14778/3510397.3510407⟩
Proceedings of the VLDB Endowment (PVLDB), VLDB Endowment, 2022
International audience; 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 resear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cff80798053887ed0cbbd594f661c5a2
Autor:
Jan Hidders, Mohamed Ragab, Angela Bonifati, Hannes Voigt, Maciej Besta, Alexandru Iosup, Ana Lucia Varbanescu, Petra Selmer, Tim Hegeman, Joshua Shinavier, Katja Hose, Stefania Dumbrava, Vasiliki Kalavri, Matei Ripeanu, Gábor Szárnyas, Eiko Yoneki, Da Yan, Semih Salihoglu, Renzo Angles, Eric Peukert, Olaf Hartig, Christian Schulz, Marcelo Arenas, Riccardo Tommasini, Nikolay Yakovets, Alexandru Uta, Stefan Plantikow, Juan F. Sequeda, M. Tamer Özsu, Emanuele Della Valle, Peter Boncz, Khaled Ammar, Wim Martens, Hsiang-Yun Wu, Bernhard Haslhofer, Sherif Sakr, Adriana Iamnitchi, Khuzaima Daudjee, Walid G. Aref, Antonino Tumeo, Hugo Kapp
Publikováno v:
Communications of the ACM
Communications of the ACM, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, Association for Computing Machinery, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, 64 (9)
Communications of the ACM, 64(9), 62-71
Communications of the ACM, 64(9)
Communications of the ACM, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, Association for Computing Machinery, 2021, 64 (9), pp.62-71. ⟨10.1145/3434642⟩
Communications of the ACM, 64 (9)
Communications of the ACM, 64(9), 62-71
Communications of the ACM, 64(9)
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 the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0583a1df0b7470a0eda73099680ac6bd
http://hdl.handle.net/11311/1203211
http://hdl.handle.net/11311/1203211
Publikováno v:
Scalable Uncertainty Management 13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings
SUM 2019-13th international conference on Scalable Uncertainty Management
SUM 2019-13th international conference on Scalable Uncertainty Management, Dec 2019, Compiègne, France. pp.250-265, ⟨10.1007/978-3-030-35514-2_19⟩
Lecture Notes in Computer Science ISBN: 9783030355135
SUM
SUM 2019-13th international conference on Scalable Uncertainty Management
SUM 2019-13th international conference on Scalable Uncertainty Management, Dec 2019, Compiègne, France. pp.250-265, ⟨10.1007/978-3-030-35514-2_19⟩
Lecture Notes in Computer Science ISBN: 9783030355135
SUM
Property graphs are becoming widespread when modeling data with complex structural characteristics and enhancing edges and nodes with a list of properties. In this paper, we focus on the approximate evaluation of counting queries involving recursive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b75b70f9d3e3f30915c2b051702601e1
https://hal.archives-ouvertes.fr/hal-02417259/document
https://hal.archives-ouvertes.fr/hal-02417259/document
Publikováno v:
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2018, 34th International Conference on Logic Programming, 18 (3-4), pp.372-389. ⟨10.1017/S1471068418000224⟩
Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2018, 34th International Conference on Logic Programming, 18 (3-4), pp.372-389. ⟨10.1017/S1471068418000224⟩
We employ the Coq proof assistant to develop a mechanically-certified framework for evaluating graph queries and incrementally maintaining materialized graph instances, also called views. The language we use for defining queries and views is Regular
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b089ccaade25b47d1c693818178b3fbb
https://hal.archives-ouvertes.fr/hal-01932818
https://hal.archives-ouvertes.fr/hal-01932818