Difference between revisions of "CRPQ"

From dbgroup
Jump to: navigation, search
(Created page with "== 综述 == # 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/v...")
 
(→‎RPQ)
 
(17 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 
== 综述 ==
 
== 综述 ==
 +
# Ali W, Saleem M, Yao B, et al. A survey of RDF stores & SPARQL engines for querying knowledge graphs[J]. The VLDB Journal, 2021: 1-26.
 +
# 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]
 +
# Besta M, Peter E, Gerstenberger R, et al. Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries[J]. arXiv preprint arXiv:1910.09017, 2019. [https://arxiv.org/abs/1910.09017]
 +
# Wylot, Marcin, et al. "RDF Data Storage and Query Processing Schemes: A Survey." ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]
 +
 +
== RPQ ==
 +
# 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]
 +
# 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]
 +
# Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf]
 +
# 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]
 +
# Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.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]
 
# 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]
 +
# 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]
 +
 +
== 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]
 +
 +
== 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]

Latest revision as of 06:40, 9 April 2022

综述

  1. Ali W, Saleem M, Yao B, et al. A survey of RDF stores & SPARQL engines for querying knowledge graphs[J]. The VLDB Journal, 2021: 1-26.
  2. 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [1]
  3. Besta M, Peter E, Gerstenberger R, et al. Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries[J]. arXiv preprint arXiv:1910.09017, 2019. [2]
  4. Wylot, Marcin, et al. "RDF Data Storage and Query Processing Schemes: A Survey." ACM Computing Surveys (CSUR) 51(4):84, 2018.[3]

RPQ

  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. [4]
  2. Casel K, Schmid M L. Fine-Grained Complexity of Regular Path Queries[J]. arXiv preprint arXiv:2101.01945, 2021. [5]
  3. 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. [6]
  4. Regular Path Query Evaluation on Streaming Graphs [7]
  5. Martens W, Trautner T. Dichotomies for evaluating simple regular path queries[J]. ACM Transactions on Database Systems (TODS), 2019, 44(4): 1-46. [8]
  6. Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [9]
  7. Mendelzon A O, Wood P T. Finding regular simple paths in graph databases[J]. SIAM Journal on Computing, 1995, 24(6): 1235-1258. [10]
  8. Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: G+: Recursive Queries Without Recursion. Expert Database Conf. 1988: 645-666 [11]
  9. Cruz I F, Mendelzon A O, Wood P T. A graphical query language supporting recursion[J]. ACM SIGMOD Record, 1987, 16(3): 323-330. [12]

CRPQ

  1. 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. [13]

Others

  1. 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. [14]
Retrieved from "http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&oldid=457982"