Milvus: A purpose-built vector data management system

J Wang, X Yi, R Guo, H **, P Xu, S Li, X Wang… - Proceedings of the …, 2021 - dl.acm.org
Recently, there has been a pressing need to manage high-dimensional vector data in data
science and AI applications. This trend is fueled by the proliferation of unstructured data and …

Graph pattern matching in GQL and SQL/PGQ

A Deutsch, N Francis, A Green, K Hare, B Li… - Proceedings of the …, 2022 - dl.acm.org
As graph databases become widespread, the International Organization for Standardization
(ISO) and International Electrotechnical Commission (IEC) have approved a project to create …

A Researcher's Digest of GQL

N Francis, A Gheerbrant, P Guagliardo… - … on Database Theory …, 2023 - research.ed.ac.uk
Abstract GQL (Graph Query Language) is being developed as a new ISO standard for graph
query languages to play the same role for graph databases as SQL plays for relational. In …

Pg-keys: Keys for property graphs

R Angles, A Bonifati, S Dumbrava, G Fletcher… - Proceedings of the …, 2021 - dl.acm.org
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 …

The LDBC social network benchmark: Business intelligence workload

G Szárnyas, J Waudby, BA Steer, D Szakállas… - Proceedings of the …, 2022 - dl.acm.org
The Social Network Benchmark's Business Intelligence workload (SNB BI) is a
comprehensive graph OLAP benchmark targeting analytical data systems capable of …

The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores

M Besta, R Gerstenberger, M Fischer… - Proceedings of the …, 2023 - dl.acm.org
Graph databases (GDBs) are crucial in academic and industry applications. The key
challenges in develo** GDBs are achieving high performance, scalability …

Optimizing RPQs over a compact graph representation

D Arroyuelo, A Gómez-Brandón, A Hogan, G Navarro… - The VLDB Journal, 2024 - Springer
We propose techniques to evaluate regular path queries (RPQs) over labeled graphs (eg,
RDF). We apply a bit-parallel simulation of a Glushkov automaton representing the query …

Tcudb: Accelerating database with tensor processors

YC Hu, Y Li, HW Tseng - … of the 2022 International Conference on …, 2022 - dl.acm.org
The emergence of novel hardware accelerators has powered the tremendous growth of
machine learning in recent years. These accelerators deliver incomparable performance …

Time-and space-efficient regular path queries

D Arroyuelo, A Hogan, G Navarro… - 2022 IEEE 38th …, 2022 - ieeexplore.ieee.org
We introduce a time-and space-efficient technique to solve regular path queries over
labeled (RDF) graphs. We combine a bit-parallel simulation of the Glushkov automaton of …

Evaluating regular path queries on compressed adjacency matrices

D Arroyuelo, A Gómez-Brandón, G Navarro - The VLDB Journal, 2025 - Springer
Abstract Regular Path Queries (RPQs), which are essentially regular expressions to be
matched against the labels of paths in labeled graphs, are at the core of graph database …