Milvus: A purpose-built vector data management system
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 …
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 …
(ISO) and International Electrotechnical Commission (IEC) have approved a project to create …
A Researcher's Digest of GQL
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 …
query languages to play the same role for graph databases as SQL plays for relational. In …
Pg-keys: Keys for property graphs
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 …
property graph constraints. The standardization for a property graph query language is …
The LDBC social network benchmark: Business intelligence workload
The Social Network Benchmark's Business Intelligence workload (SNB BI) is a
comprehensive graph OLAP benchmark targeting analytical data systems capable of …
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
Graph databases (GDBs) are crucial in academic and industry applications. The key
challenges in develo** GDBs are achieving high performance, scalability …
challenges in develo** GDBs are achieving high performance, scalability …
Optimizing RPQs over a compact graph representation
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 …
RDF). We apply a bit-parallel simulation of a Glushkov automaton representing the query …
Tcudb: Accelerating database with tensor processors
The emergence of novel hardware accelerators has powered the tremendous growth of
machine learning in recent years. These accelerators deliver incomparable performance …
machine learning in recent years. These accelerators deliver incomparable performance …
Time-and space-efficient regular path queries
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 …
labeled (RDF) graphs. We combine a bit-parallel simulation of the Glushkov automaton of …
Evaluating regular path queries on compressed adjacency matrices
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 …
matched against the labels of paths in labeled graphs, are at the core of graph database …