Difference between revisions of "数据管理小组"
Line 6: | Line 6: | ||
# 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 2019, 30(7):1000-9825. [http://apps.webofknowledge.com/full_record.do?product=UA&search_mode=GeneralSearch&qid=2&SID=5A8ngFeHmXRHcuUqaNS&page=1&doc=1] | # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 2019, 30(7):1000-9825. [http://apps.webofknowledge.com/full_record.do?product=UA&search_mode=GeneralSearch&qid=2&SID=5A8ngFeHmXRHcuUqaNS&page=1&doc=1] | ||
== 子图匹配查询相关 == | == 子图匹配查询相关 == | ||
+ | # A. K. Chandra, P. M. Merlin, Optimal implementation of conjunctive queries in relational databases, in ACM Symposium on Theory of Computing, 1977, pp. 77–90. [https://dl.acm.org/doi/abs/10.1145/800105.803397] | ||
# Z. Sun, H. Wang, H. Wang, B. Shao, J. Li, Efficient subgraph matching on billion node graphs, Proceedings of the VLDB Endowment 5 (9) (2012) 788–799.[https://arxiv.org/abs/1205.6691] | # Z. Sun, H. Wang, H. Wang, B. Shao, J. Li, Efficient subgraph matching on billion node graphs, Proceedings of the VLDB Endowment 5 (9) (2012) 788–799.[https://arxiv.org/abs/1205.6691] | ||
# L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8 (10) (2015) 974–985. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368] | # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8 (10) (2015) 974–985. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368] | ||
# L. Lai, L. Qin, X. Lin, Y. Zhang, L. Chang, S. Yang, Scalable distributed subgraph enumeration, Proceedings of the Vldb Endowment 10 (3) (2016) 217–228. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937] | # L. Lai, L. Qin, X. Lin, Y. Zhang, L. Chang, S. Yang, Scalable distributed subgraph enumeration, Proceedings of the Vldb Endowment 10 (3) (2016) 217–228. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937] | ||
+ | # I. Abdelaziz, R. Harbi, Z. Khayyat, P. Kalnis, A survey and experimental comparison of distributed SPARQL engines for very large RDF data, Proceedings of the Vldb Endowment 10 (13) (2017) 2049–2060. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109] |
Revision as of 11:46, 11 November 2020
综述
- Özsu, M. Tamer. "A survey of RDF data management systems." Frontiers of Computer Science 10.3 (2016): 418-432.[1]
- 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 2017, 54(6):1213-1224.[2]
- I. Abdelaziz, R. Harbi, Z. Khayyat, P. Kalnis, A survey and experimental comparison of distributed SPARQL engines for very large RDF data, Proceedings of the Vldb Endowment 10 (13) (2017) 2049–2060.
- Wylot, Marcin, et al. "RDF Data Storage and Query Processing Schemes: A Survey." ACM Computing Surveys (CSUR) 51.4 (2018):84.[3]
- 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 2019, 30(7):1000-9825. [4]
子图匹配查询相关
- A. K. Chandra, P. M. Merlin, Optimal implementation of conjunctive queries in relational databases, in ACM Symposium on Theory of Computing, 1977, pp. 77–90. [5]
- Z. Sun, H. Wang, H. Wang, B. Shao, J. Li, Efficient subgraph matching on billion node graphs, Proceedings of the VLDB Endowment 5 (9) (2012) 788–799.[6]
- L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8 (10) (2015) 974–985. [7]
- L. Lai, L. Qin, X. Lin, Y. Zhang, L. Chang, S. Yang, Scalable distributed subgraph enumeration, Proceedings of the Vldb Endowment 10 (3) (2016) 217–228. [8]
- I. Abdelaziz, R. Harbi, Z. Khayyat, P. Kalnis, A survey and experimental comparison of distributed SPARQL engines for very large RDF data, Proceedings of the Vldb Endowment 10 (13) (2017) 2049–2060. [9]