CRPQ

综述

1. 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [1]

经典论文

1. Mendelzon A O, Wood P T. Finding regular simple paths in graph databases[J]. SIAM Journal on Computing, 1995, 24(6): 1235-1258. [2]
2. Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: G+: Recursive Queries Without Recursion. Expert Database Conf. 1988: 645-666 [3]
3. Cruz I F, Mendelzon A O, Wood P T. A graphical query language supporting recursion[J]. ACM SIGMOD Record, 1987, 16(3): 323-330. [4]

CRPQ

1. Arroyuelo D, Hogan A, Navarro G, et al. Time-and Space-Efficient Regular Path Queries on Graphs[J]. arXiv preprint arXiv:2111.04556, 2021. [5]
2. Casel K, Schmid M L. Fine-Grained Complexity of Regular Path Queries[J]. arXiv preprint arXiv:2101.01945, 2021. [6]
3. Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [7]
4. Shemetova E, Azimov R, Orachev E, et al. One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries[J]. arXiv preprint arXiv:2103.14688, 2021. [8]
5. Regular Path Query Evaluation on Streaming Graphs [9]
6. Guo X, Gao H, Zou Z. Distributed processing of regular path queries in RDF graphs[J]. Knowledge and Information Systems, 2021, 63(4): 993-1027. [10]
7. Barceló P, Libkin L, Lin A W, et al. Expressive languages for path queries over graph-structured data[J]. ACM Transactions on Database Systems (TODS), 2012, 37(4): 1-46. [11]
8. Martens W, Trautner T. Dichotomies for evaluating simple regular path queries[J]. ACM Transactions on Database Systems (TODS), 2019, 44(4): 1-46. [12]