Aug 2026· Proceedings of the VLDB Endowment· 0 citations· 9 references
TL;DR
This demo presents cuRPQ +, a GPU-based engine and interactive system for extended CRPQs with three representative path constraints: word equality, prefix, and bounded length, which supports these constraints within a unified execution framework.
Abstract
Many graph analyses require reasoning about relationships between matched paths, but plain conjunctive regular path queries (CRPQs) cannot express such conditions directly. This demo presents
cuRPQ
+, a GPU-based engine and interactive system for extended CRPQs with three representative path constraints: word equality, prefix, and bounded length. Building on
cuRPQ, cuRPQ
+ supports these constraints within a unified execution framework. The web interface lets users construct extended CRPQs, inspect sampled paths, compare plain and constrained results, and observe runtime and memory usage. Through these interactions, users can see how path constraints change query semantics and execution behavior. A demonstration video is available at https://youtu.be/V7Qtb9dsMTc.
Conjunctive regular path queries (CRPQs) form a critical backbone of modern graph query languages, integrating subgraph matching with regular path queries (RPQs). Despite their ubiquity in applications like social networks, finance, and scientific data analysis, CRPQ optimization lacks a unified framework, relying inst...
Yue Pang, Lei Zou, Angela Bonifati et al.· Proceedings of the VLDB Endo...· 0 citations
Graphs model relationships in social, information, and collaboration networks, where users often need to reason about both the current graph and its possible evolution. However, graph databases such as Neo4j primarily query the present graph, while link-prediction methods typically run as separate workflows that output...
Evangelos Iliadis, Christos Gkartzios, Evaggelia Pitoura· Proceedings of the VLDB Endo...· 0 citations
Traditional e-commerce search-and-filter interfaces often lead to high cart abandonment rates due to rigid keyword matching and complex navigation. This paper presents an architecture for conversational e-commerce that integrates large language models (LLMs), Model Context Protocol (MCP) servers, and a Neo4j graph data...
Andrii Baran, I. Spivak, S. Krepych· CEUR Workshop Proceedings, V...· 0 citations
Mosaic is presented, a training-free framework that formulates GraphRAG retrieval as a per-query control problem that converts query-specific evidence requirements into a bounded policy over seed selection, graph traversal, stopping, and evidence selection while the corpus graph, indexes, scoring functions, grounding p...
Eunkyeong Lee, Kyeong-Jin Oh, Jinwon Kim et al.· 0 citations
Modern data management systems must simultaneously address three critical challenges: efficient query optimization for large queries, reliable detection of logical errors in database engines, and high-performance processing across heterogeneous hardware
architectures. Traditional query optimizers rely on dynamic progra...
Praveen Kumar Kumbum, Ramachandra Reddy Vangala· Journal of Data Science and...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
