skip to main content
article

Kùzu: A Database Management System For "Beyond Relational" Workloads

Published:02 November 2023Publication History
Skip Abstract Section

Abstract

I would like to share my opinions on the following question: how should a modern graph DBMS (GDBMS) be architected? This is the motivating research question we are addressing in the K`uzu project at University of Waterloo [4, 5].1 I will argue that a modern GDBMS should optimize for a set of what I will call, for lack of a better term, "beyond relational" workloads. As a background, let me start with a brief overview of GDBMSs.

References

  1. Wikidata. https://www.wikidata.org/wiki/Wikidata: Main_Page, 2023.Google ScholarGoogle Scholar
  2. Ronald Brachman and Hector Levesque. Knowledge Representation and Reasoning. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, 2004.Google ScholarGoogle Scholar
  3. Factorization & Great Ideas from Database Theory. https: //kuzudb.com/blog/factorization.html, 2023.Google ScholarGoogle Scholar
  4. Xiyang Feng, Guodong Jin, Ziyi Chen, Chang Liu, and Semih Salihoglu. K'uzu Source Code. https://github.com/kuzudb/kuzu, November 2022.Google ScholarGoogle Scholar
  5. Xiyang Feng, Guodong Jin, Ziyi Chen, Chang Liu, and Semih Salihoglu. K'uzu Graph Database Management System. In The Conference on Innovative Data Systems Research, 2023.Google ScholarGoogle Scholar
  6. Pranjal Gupta, Amine Mhedhbi, and Semih Salihoglu. Columnar Storage and List-based Processing for Graph Database Management Systems. Proceedings of the VLDB Endowment, 14(11):2491--2504, 2021.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Chathura Kankanamge, Siddhartha Sahu, Amine Mhedbhi, Jeremy Chen, and Semih Salihoglu. Graphflow: An Active Graph Database. In Proceedings of the ACM International Conference on Management of Data, 2017.Google ScholarGoogle Scholar
  8. Memgraph. https://memgraph.com/, 2023.Google ScholarGoogle Scholar
  9. Amine Mhedhbi, Chathura Kankanamge, and Semih Salihoglu. Optimizing One-time and Continuous Subgraph Queries using Worst-Case Optimal Joins. ACM Transactions on Database Systems, 46(2):1--45, 2021.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Yavor Nenov, Robert Piro, Boris Motik, Ian Horrocks, Zhe Wu, and Jay Banerjee. RDFox: A Highly-Scalable RDF Store. In Marcelo Arenas, Oscar Corcho, Elena Simperl, Markus Strohmaier, Mathieu d'Aquin, Kavitha Srinivas, Paul Groth, Michel Dumontier, Jeff Heflin, Krishnaprasad Thirunarayan, and Steffen Staab, editors, The Semantic Web, 2015.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Neo4j. http://neo4j.com, 2023.Google ScholarGoogle Scholar
  12. H. Ngo, C. R´e, and A. Rudra. Skew Strikes Back: New Developments in the Theory of Join Algorithms. SIGMOD Record, 42(4):5--16, 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Dan Olteanu and Jakub Z´avodn'y. Size Bounds For Factorised Representations of Query Results. ACM Transactions on Database Systems, 40(1):1--44, 2015.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. OWL Semantic Web Standard. https://www.w3.org/OWL/, 2022.Google ScholarGoogle Scholar
  15. Tigergraph. http://tigergraph.com, 2023.Google ScholarGoogle Scholar
  16. What Every Competent GDBMS Should Do. https://kuzudb.com/blog/ what-every-gdbms-should-do-and-vision. html, 2023.Google ScholarGoogle Scholar
  17. Why (Graph) DBMSs Need New Join Algorithms: The Story of Worst-case Optimal Join Algorithms. https://kuzudb.com/blog/wcoj.html, 2023.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Article Metrics

    • Downloads (Last 12 months)97
    • Downloads (Last 6 weeks)19

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader