Difference between revisions of "CRPQ"
2020244055 (talk | contribs) (→CRPQ) |
2020244055 (talk | contribs) |
||
| Line 1: | Line 1: | ||
== 综述 == | == 综述 == | ||
# 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm] | # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm] | ||
| − | == | + | |
| + | == RPQ == | ||
# Mendelzon A O, Wood P T. Finding regular simple paths in graph databases[J]. SIAM Journal on Computing, 1995, 24(6): 1235-1258. [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.96.9492&rep=rep1&type=pdf] | # Mendelzon A O, Wood P T. Finding regular simple paths in graph databases[J]. SIAM Journal on Computing, 1995, 24(6): 1235-1258. [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.96.9492&rep=rep1&type=pdf] | ||
# Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: G+: Recursive Queries Without Recursion. Expert Database Conf. 1988: 645-666 [https://dblp.org/db/conf/eds/eds88.html#CruzMW88] | # Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: G+: Recursive Queries Without Recursion. Expert Database Conf. 1988: 645-666 [https://dblp.org/db/conf/eds/eds88.html#CruzMW88] | ||
# Cruz I F, Mendelzon A O, Wood P T. A graphical query language supporting recursion[J]. ACM SIGMOD Record, 1987, 16(3): 323-330. [https://dl.acm.org/doi/abs/10.1145/38714.38749?casa_token=YjRGjPP3oSsAAAAA:j_UgeWBy0fbnssow1haatx1j1ijvendVHguQJUch7Nlia_snX1ox3Tb03TUiMK-ujzxp_2iPVK48] | # Cruz I F, Mendelzon A O, Wood P T. A graphical query language supporting recursion[J]. ACM SIGMOD Record, 1987, 16(3): 323-330. [https://dl.acm.org/doi/abs/10.1145/38714.38749?casa_token=YjRGjPP3oSsAAAAA:j_UgeWBy0fbnssow1haatx1j1ijvendVHguQJUch7Nlia_snX1ox3Tb03TUiMK-ujzxp_2iPVK48] | ||
| − | |||
| − | |||
# 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/2101.01945.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] | # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf] | ||
| − | |||
# Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf] | # Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf] | ||
# 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. [https://link.springer.com/article/10.1007/s10115-020-01536-2] | # 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. [https://link.springer.com/article/10.1007/s10115-020-01536-2] | ||
| + | # Martens W, Trautner T. Dichotomies for evaluating simple regular path queries[J]. ACM Transactions on Database Systems (TODS), 2019, 44(4): 1-46. [https://dl.acm.org/doi/10.1145/3331446] | ||
| + | |||
| + | == CRPQ == | ||
# 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. [https://dl.acm.org/doi/10.1145/2389241.2389250] | # 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. [https://dl.acm.org/doi/10.1145/2389241.2389250] | ||
| − | # | + | |
| + | == Others == | ||
| + | # 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. [https://arxiv.org/pdf/2103.14688.pdf] | ||
Revision as of 08:52, 19 December 2021
综述
- 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [1]
RPQ
- 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]
- 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]
- Regular Path Query Evaluation on Streaming Graphs [8]
- 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. [9]
- Martens W, Trautner T. Dichotomies for evaluating simple regular path queries[J]. ACM Transactions on Database Systems (TODS), 2019, 44(4): 1-46. [10]
CRPQ
- 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]
Others
- 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. [12]
