Distinct Shortest Walk Enumeration for RPQs
Abstract
References
Index Terms
- Distinct Shortest Walk Enumeration for RPQs
Recommendations
Distributed Asynchronous Regular Path Queries (RPQs) on Graphs
Middleware '23: Proceedings of the 24th International Middleware Conference: Industrial TrackGraph engines play a crucial role in modern data analytics pipelines, serving as a middleware for handling complex queries across various domains, such as financial fraud detection. Graph queries enable flexible exploration and analysis, akin to SQL in ...
Dichotomies for Evaluating Simple Regular Path Queries
Best of EDBT 2017, Best of EDBT 2018, Best of ICDT 2018 and Regular PapersRegular path queries (RPQs) are a central component of graph databases. We investigate decision and enumeration problems concerning the evaluation of RPQs under several semantics that have recently been considered: arbitrary paths, shortest paths, paths ...
Expressiveness and static analysis of extended conjunctive regular path queries
We study the expressiveness and the complexity of static analysis of extended conjunctive regular path queries (ECRPQs), introduced by Barcelo et al. (2010) [3]. ECRPQs are an extension of conjunctive regular path queries (CRPQs), a well-studied ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 27Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)9
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in