OASIcs.Tannen.5.pdf
- Filesize: 0.71 MB
- 14 pages
Document
Chasing Parallelism in Aggregating Graph Queries
Author
-
Part of:
Volume:
The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen (Tannen's Festschrift)
Series: Open Access Series in Informatics (OASIcs)
Conference: Festschrift Val Tannen - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-06-07
Cite AsGet BibTex
Alin Deutsch. Chasing Parallelism in Aggregating Graph Queries. In The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen. Open Access Series in Informatics (OASIcs), Volume 119, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/OASIcs.Tannen.5
https://doi.org/10.4230/OASIcs.Tannen.5
Abstract
In practice, one frequently encounters queries that extract tabular results from graph databases by employing grouping and aggregation. This paper introduces a technique for rewriting the group-by list of graph queries in order to increase aggregation parallelism in graph engines that conform to a modern instantiation of the Bulk-Synchronous-Parallel computation model.
Subject Classification
ACM Subject Classification
- Information systems → Graph-based database models
- Information systems → Query optimization
Keywords
- Graph Databases
- Grouping and Aggregation
- Parallel Graph Computation Models
- Rewriting
- Constraint-based Minimization
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Serge Abiteboul, Peter Buneman, and Dan Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.
- Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995. URL: http://webdam.inria.fr/Alice/.
- Khaled Ammar and M. Tamer Özsu. Experimental analysis of distributed graph systems. Proc. VLDB Endow., 11(10):1151-1164, June 2018. URL: https://doi.org/10.14778/3231751.3231764.
- Apache. Apache giraph, 2020. URL: https://giraph.apache.org/.
- Apache. Apache spark graphx, 2020. URL: https://spark.apache.org/graphx/.
- Alin Deutsch and Richard Hull. Provenance-directed chase&backchase. In Val Tannen, Limsoon Wong, Leonid Libkin, Wenfei Fan, Wang-Chiew Tan, and Michael P. Fourman, editors, In Search of Elegance in the Theory and Practice of Computation - Essays Dedicated to Peter Buneman, volume 8000 of Lecture Notes in Computer Science, pages 227-236. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-41660-6_11.
- Alin Deutsch, Yu Xu, Mingxi Wu, and Victor E. Lee. Tigergraph: A native MPP graph database. CoRR, abs/1901.08248, 2019. URL: https://arxiv.org/abs/1901.08248.
- Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12), pages 17-30, Hollywood, CA, October 2012. USENIX Association. URL: https://www.usenix.org/conference/osdi12/technical-sessions/presentation/gonzalez.
- Minyang Han, Khuzaima Daudjee, Khaled Ammar, M. Tamer Özsu, Xingfang Wang, and Tianqi Jin. An experimental comparison of pregel-like graph processing systems. Proceedings of the VLDB Endowment, 7:1047-1058, August 2014. URL: https://doi.org/10.14778/2732977.2732980.
- Ioana Ileana, Bogdan Cautis, Alin Deutsch, and Yannis Katsis. Complete yet practical search for minimal query reformulations under constraints. In Curtis E. Dyreson, Feifei Li, and M. Tamer Özsu, editors, International Conference on Management of Data, SIGMOD 2014, Snowbird, UT, USA, June 22-27, 2014, pages 1015-1026. ACM, 2014. URL: https://doi.org/10.1145/2588555.2593683.
- ISO. GQL, 2024. URL: https://www.iso.org/standard/76120.html.
- S. Kazem Lellahi and Val Tannen. A calculus for collections and aggregates. In Eugenio Moggi and Giuseppe Rosolini, editors, Category Theory and Computer Science, 7th International Conference, CTCS '97, Santa Margherita Ligure, Italy, September 4-6, 1997, Proceedings, volume 1290 of Lecture Notes in Computer Science, pages 261-280. Springer, 1997. URL: https://doi.org/10.1007/BFB0026993.
-
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph Hellerstein. Graphlab: A new framework for parallel machine learning. In Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence, UAI'10, pages 340-349, Arlington, Virginia, USA, 2010. AUAI Press.
-
Yi Lu, James Cheng, Da Yan, and Huanhuan Wu. Large-scale distributed graph computing systems: An experimental evaluation. Proceedings of the VLDB Endowment, 8, November 2014.
- Grzegorz Malewicz, Matthew H. Austern, Aart J.C Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: A system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD ’10, pages 135-146, New York, NY, USA, 2010. Association for Computing Machinery. URL: https://doi.org/10.1145/1807167.1807184.
- Robert McCune, Tim Weninger, and Gregory Madey. Thinking like a vertex: a survey of vertex-centric frameworks for distributed graph processing. ACM Computing Surveys, 48, July 2015. URL: https://doi.org/10.1145/2818185.
- Semih Salihoglu and Jennifer Widom. Gps: A graph processing system. In Scientific and Statistical Database Management. Stanford InfoLab, July 2013. URL: http://ilpubs.stanford.edu:8090/1039/.
- Philip Stutz, Abraham Bernstein, and William Cohen. Signal/collect: Graph algorithms for the (semantic) web. Lecture Notes in Computer Science (LNCS), 6496:764-780, October 2010. URL: https://doi.org/10.1007/978-3-642-17746-0_48.
- Leslie G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, August 1990. URL: https://doi.org/10.1145/79173.79181.
- Da Yan, Yingyi Bu, Yuanyuan Tian, and Amol Deshpande. Big graph analytics platforms. Foundations and Trends in Databases, 7:1-195, January 2017. URL: https://doi.org/10.1561/1900000056.