CRPQ - Revision history

2021244229: /* RPQ */

2022-04-09T06:40:04Z

‎RPQ

2021244229: /* 综述 */

2022-04-09T06:37:47Z

‎综述

2021244229: /* 综述 */

2022-04-09T06:36:42Z

‎综述

2020244055: /* 综述 */

2021-12-20T15:26:11Z

‎综述

2020244055: /* 综述 */

2021-12-20T15:00:55Z

‎综述

2020244055 at 08:52, 19 December 2021

2021-12-19T08:52:01Z

2020244055: /* CRPQ */

2021-12-19T08:02:32Z

‎CRPQ

2020244055: /* CRPQ */

2021-12-19T04:42:14Z

‎CRPQ

2020244055: /* CRPQ */

2021-12-19T04:34:54Z

‎CRPQ

2020244055: /* CRPQ */

2021-12-19T04:32:30Z

‎CRPQ

@@ Line 6: / Line 6: @@
 == 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]
-# Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.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]
 == CRPQ ==

@@ Line 1: / Line 1: @@
 == 综述 ==
 # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 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]

@@ Line 1: / Line 1: @@
 == 综述 ==
 # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]
 # 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 ==

@@ Line 2: / Line 2: @@
 # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]
 # 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 ==

@@ Line 1: / Line 1: @@
 == 综述 ==
 # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]
 == RPQ ==

@@ Line 14: / Line 14: @@
 # 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]
 # 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]
-# 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/2389241.2389250]
+# 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]

← Older revision		Revision as of 04:42, 19 December 2021
Line 11:		Line 11:
	# 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]
	# 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]		# 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]
		+	# 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]
		+	# 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]
		+	# 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/2389241.2389250]

← Older revision		Revision as of 04:34, 19 December 2021
Line 10:		Line 10:
	# 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]
		+	# 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]