Difference between revisions of "CRPQ"
2020244055 (talk | contribs) (→CRPQ) |
2020244055 (talk | contribs) (→CRPQ) |
||
| Line 8: | Line 8: | ||
== CRPQ == | == CRPQ == | ||
# Arroyuelo D, Hogan A, Navarro G, et al. Time-and Space-Efficient Regular Path Queries on Graphs[J]. arXiv preprint arXiv:2111.04556, 2021. [https://arxiv.org/pdf/2111.04556.pdf] | # Arroyuelo D, Hogan A, Navarro G, et al. Time-and Space-Efficient Regular Path Queries on Graphs[J]. arXiv preprint arXiv:2111.04556, 2021. [https://arxiv.org/pdf/2111.04556.pdf] | ||
| − | # Casel K, Schmid M L. Fine-Grained Complexity of Regular Path Queries[J]. arXiv preprint arXiv:2101.01945, 2021. [https://arxiv.org/pdf/ | + | # Casel K, Schmid M L. Fine-Grained Complexity of Regular Path Queries[J]. arXiv preprint arXiv:2101.01945, 2021. [https://arxiv.org/pdf/2101.01945.pdf] |
| + | # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf] | ||
Revision as of 04:32, 19 December 2021
综述
- 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [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]
- Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: G+: Recursive Queries Without Recursion. Expert Database Conf. 1988: 645-666 [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
- 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]
- Casel K, Schmid M L. Fine-Grained Complexity of Regular Path Queries[J]. arXiv preprint arXiv:2101.01945, 2021. [6]
- Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [7]
