GRBench constructs a linked graph-relational schema from the real-world SciSciNet-v2 dataset and derives scalable instances through consistency-preserving subset extraction and evaluates representative system architectures through a unified, multidimensional methodology.
Abstract
Modern data-intensive applications increasingly require database systems to manage structured records and graph data. This demand gives rise to graph-relational data management, spanning storage, query processing, and optimization across relational and graph data. In response, relational database extensions, multi-model databases, and dedicated graph-relational systems have emerged with diverse architectures. However, evaluation methodologies have not kept pace. Existing relational and graph benchmarks assess the two models largely in isolation, while multi-model benchmarks provide limited coverage of graph-relational workloads. Available graph-relational workloads mainly support functional validation and end-to-end latency measurement, revealing little about how storage, operator, and optimization designs affect performance. To evaluate system capabilities in graph-relational data management, we present GRBench. First, GRBench constructs a linked graph-relational schema from the real-world SciSciNet-v2 dataset and derives scalable instances through consistency-preserving subset extraction. Second, it organizes purpose-built query series for controlled evaluation of query processing and system components. Third, GRBench provides semantically equivalent native query formulations and evaluates representative system architectures through a unified, multidimensional methodology. Based on this evaluation, we analyze design trade-offs and identify open challenges to guide future system design and optimization.
A novel code-generating engine with factorization that enables intra-query-parallelized query execution on factorized representations and generates code to overcome their CPU-unfriendly layout, offering a unified and scalable solution for modern workloads.
Stefan Lehner, Thomas Neumann· Proceedings of the VLDB Endo...· 0 citations
Modern data-driven applications increasingly rely on distributed graph databases and machine learning pipelines to extract knowledge from massive datasets. However, efficient query processing in distributed environments remains challeng-ing due to
issues such as graph partitioning inefficiencies, dynamic connectivity u...
Praveen Kumar Kumbum, Ramachandra Reddy Vangala· Journal of Business Intellig...· 4 citations
This work presents ClickGraph and its Databricks-dialect sibling DeltaGraph, systems that translate Cypher directly onto the native relational schema and execute in place on ClickHouse, Databricks, or in-process on lakehouse files, with no import and no separate cluster.
Graph databases are frequently positioned as categorically necessary for connected-data workloads, yet the systems dimension along which they actually differ - query planning, indexing, and data-readiness cost - is rarely isolated from vendor framing. We construct a synthetic, biomedical-shaped property graph (1.02 mil...
Donald Nguyen, Gurbinder Gill, Hadi Ahmadi et al.· 0 citations
This research drives the core insight of the research: a comprehensive exploration of FMM within database query engines, bringing the theoretical power of algebraic techniques to practical data systems.
Xiao Hu· ACM SIGMOD Record· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.