Difference between revisions of "数据管理小组"
2020244055 (talk | contribs) (→子图匹配查询相关) |
2020244055 (talk | contribs) (→综述) |
||
Line 5: | Line 5: | ||
# 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):2049–2060,2017. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109] | # 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):2049–2060,2017. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109] | ||
# 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] | # 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] | ||
− | # 王鑫, 邹磊, 王朝坤, 彭鹏. | + | # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 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] | # 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] | ||
Revision as of 12:37, 26 December 2021
Contents
综述
- Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [1]
- Özsu, M. Tamer. "A survey of RDF data management systems." Frontiers of Computer Science 10(3): 418-432, 2016.[2]
- 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[3]
- 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):2049–2060,2017. [4]
- Wylot, Marcin, et al. "RDF Data Storage and Query Processing Schemes: A Survey." ACM Computing Surveys (CSUR) 51(4):84, 2018.[5]
- 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019.[6]
- 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. [7]
子图匹配查询相关
- Mehmood Q, Saleem M, Jha A, et al. Efficient distributed path computation on RDF knowledge graphs using partial evaluation[J]. World Wide Web, 2021: 1-32.[8]
- Arroyuelo D, Hogan A, Navarro G, et al. Time-and Space-Efficient Regular Path Queries on Graphs[J]. arXiv preprint arXiv:2111.04556, 2021.[9]
- Wu J, Chen R, Xia Y. Fast and Accurate Optimizer for Query Processing over Knowledge Graphs[C]//Proceedings of the ACM Symposium on Cloud Computing. 2021: 503-517.[10]
- Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[11]
- Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[12]
- A. K. Chandra, P. M. Merlin, Optimal implementation of conjunctive queries in relational databases, in ACM Symposium on Theory of Computing, pp.77–90, 1997. [13]
- Z. Sun, H. Wang, H. Wang, B. Shao, J. Li, Efficient subgraph matching on billion node graphs, Proceedings of the VLDB Endowment 5(9):788–799, 2012.[14]
- L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [15]
- # P.Peng,L.Zou, M.T.Özsu, L.Chen, and D.Zhao.Processing SPARQL Queries over Distributed RDF Graphs. VLDB J., 25(2):243–268, 2016. [16]
- L. Lai, L. Qin, X. Lin, Y. Zhang, L. Chang, S. Yang, Scalable distributed subgraph enumeration, Proceedings of the Vldb Endowment 10(3)217–228, 2016. [17]
- 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):2049–2060, 2017. [18]
- I. Abdelaziz, R. Harbi, Z. Khayyat, and P. Kalnis. A Survey and Experimental Comparison of Distributed SPARQL Engines for Very Large RDF Data. PVLDB, 10(13):2049–2060, 2017. [19]
- Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[20]
编码
- Singh G, Upadhyay D, Atre M. Efficient RDF dictionaries with B+ trees[C]//Proceedings of the ACM India Joint International Conference on Data Science and Management of Data. 2018: 128-136.[21]
- Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[22]
分布式数据管理
- Gurajada S, Seufert S, Miliaraki I, et al. TriAD: a distributed shared-nothing RDF engine based on asynchronous message passing[C]//Proceedings of the 2014 ACM SIGMOD international conference on Management of data. 2014: 289-300.[23]
- Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[24]
- Shao B, Wang H, Li Y. Trinity: A distributed graph engine on a memory cloud[C]//Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. 2013: 505-516.[25]
- Zeng K, Yang J, Wang H, et al. A distributed graph engine for web scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(4): 265-276.[26]
- Zou L, Özsu M T, Chen L, et al. gStore: a graph-based SPARQL query engine[J]. The VLDB journal, 2014, 23(4): 565-590.[27]