http://www.tjudb.cn/dbgroup/api.php?action=feedcontributions&feedformat=atom&user=2020244055 dbgroup - User contributions [en] 2026-05-06T06:02:25Z User contributions MediaWiki 1.31.1 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457951 Conferences 2022-03-13T14:20:26Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-23 || || 2022.7.8 / 2022.10.8 || || || || https://icde2023.ics.uci.edu/research-papers-track/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-22/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || 2022.5.9 || 2022.5.16 || || || || https://www.cikm2022.org/calls<br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-22 || 2022.4.28 || 2022.5.5 || || 2022.7.13 || 2022.7.13 || https://iswc2022.semanticweb.org/index.php/<br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |-<br /> | C || WISE-22 || 2022.3.1 || 2022.3.8 || || || || https://wise2022.sigappfr.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457950 Conferences 2022-03-13T14:18:57Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-23 || || 2022.7.8 / 2022.10.8 || || || || https://icde2023.ics.uci.edu/research-papers-track/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-22/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || 2022.5.9 || 2022.5.16 || || || || <br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-22 || 2022.4.28 || 2022.5.5 || || 2022.7.13 || 2022.7.13 || https://iswc2022.semanticweb.org/index.php/<br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |-<br /> | C || WISE-22 || 2022.3.1 || 2022.3.8 || || || || https://wise2022.sigappfr.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457941 Conferences 2022-02-05T07:00:53Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-22 || || 2021.11.17 || || || || https://icde2022.ieeecomputer.my/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-22/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || TBD || || || || || <br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-22 || 2022.4.28 || 2022.5.5 || || TBD || TBD || https://iswc2022.semanticweb.org/index.php/<br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |-<br /> | C || WISE-22 || 2022.3.1 || 2022.3.8 || || || || https://wise2022.sigappfr.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457940 Conferences 2022-02-05T06:59:51Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-22 || || 2021.11.17 || || || || https://icde2022.ieeecomputer.my/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-22/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || TBD || || || || || <br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-22 || 2022.4.28 || 2022.5.5 || || TBD || TBD || https://iswc2022.semanticweb.org/index.php/dates/<br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |-<br /> | C || WISE-22 || 2022.3.1 || 2022.3.8 || || || || https://wise2022.sigappfr.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457925 数据管理小组 2021-12-26T12:38:46Z <p>2020244055: /* 存储相关 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019.[http://jos.org.cn/html/2019/7/5841.htm]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # 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.[https://link.springer.com/article/10.1007/s11280-021-00965-5]<br /> # 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]<br /> # 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.[https://dl.acm.org/doi/abs/10.1145/3472883.3486991]<br /> # Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[https://arxiv.org/pdf/2110.13348.pdf]<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]<br /> # Li G, Zhou X, Sun J, et al. opengauss: An autonomous database system[J]. Proceedings of the VLDB Endowment, 2021, 14(12): 3028-3042.[https://www.vldb.org/pvldb/vol14/p3028-li.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457924 数据管理小组 2021-12-26T12:37:25Z <p>2020244055: /* 综述 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019.[http://jos.org.cn/html/2019/7/5841.htm]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # 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.[https://link.springer.com/article/10.1007/s11280-021-00965-5]<br /> # 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]<br /> # 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.[https://dl.acm.org/doi/abs/10.1145/3472883.3486991]<br /> # Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[https://arxiv.org/pdf/2110.13348.pdf]<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457923 CRPQ 2021-12-20T15:26:11Z <p>2020244055: /* 综述 */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 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]<br /> <br /> == RPQ ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> # 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]<br /> # 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]<br /> # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf]<br /> # Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> <br /> == Others ==<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457922 CRPQ 2021-12-20T15:00:55Z <p>2020244055: /* 综述 */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> <br /> == RPQ ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> # 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]<br /> # 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]<br /> # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf]<br /> # Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> <br /> == Others ==<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457921 CRPQ 2021-12-19T08:52:01Z <p>2020244055: </p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> <br /> == RPQ ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> # 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]<br /> # 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]<br /> # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf]<br /> # Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> <br /> == Others ==<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457920 CRPQ 2021-12-19T08:02:32Z <p>2020244055: /* CRPQ */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> == 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> # 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]<br /> # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf]<br /> # 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]<br /> # Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf]<br /> # 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]<br /> # 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]<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457919 CRPQ 2021-12-19T04:42:14Z <p>2020244055: /* CRPQ */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> == 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> # 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]<br /> # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf]<br /> # 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]<br /> # Regular Path Query Evaluation on Streaming Graphs [https://cs.uwaterloo.ca/~apacaci/papers/sigmod2020.pdf]<br /> # 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]<br /> # 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]<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457918 CRPQ 2021-12-19T04:34:54Z <p>2020244055: /* CRPQ */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> == 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> # 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]<br /> # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf]<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457917 CRPQ 2021-12-19T04:32:30Z <p>2020244055: /* CRPQ */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> == 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> # 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]<br /> # Grahne G, Thomo A. Provenance for Regular Path Queries[J]. arXiv preprint arXiv:2001.09864, 2020. [https://arxiv.org/pdf/2001.09864.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457916 CRPQ 2021-12-19T04:31:06Z <p>2020244055: /* CRPQ */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> == 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]<br /> # Casel K, Schmid M L. Fine-Grained Complexity of Regular Path Queries[J]. arXiv preprint arXiv:2101.01945, 2021. [https://arxiv.org/pdf/2111.04556.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457915 CRPQ 2021-12-19T04:27:29Z <p>2020244055: /* 经典论文 */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> == 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]<br /> <br /> == CRPQ ==<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457914 CRPQ 2021-12-19T03:23:56Z <p>2020244055: /* 经典论文 */</p> <hr /> <div>== 综述 ==<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇. 知识图谱数据管理研究综述. 软件学报, 30(7):2139-2174, 2019. [http://jos.org.cn/html/2019/7/5841.htm]<br /> == 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457913 CRPQ 2021-12-19T03:22:52Z <p>2020244055: /* 经典论文 */</p> <hr /> <div>== 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> # 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]<br /> # 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]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457912 CRPQ 2021-12-19T03:18:38Z <p>2020244055: /* 早期论文 */</p> <hr /> <div>== 经典论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457911 CRPQ 2021-12-19T03:18:21Z <p>2020244055: /* 论文 */</p> <hr /> <div>== 早期论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457910 CRPQ 2021-12-19T03:18:03Z <p>2020244055: /* 论文 */</p> <hr /> <div>== 论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457909 CRPQ 2021-12-19T03:17:52Z <p>2020244055: /* 综述 */</p> <hr /> <div>== 论文 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]<br /> <br /> == 论文 ==</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=CRPQ&diff=457908 CRPQ 2021-12-19T03:17:31Z <p>2020244055: Created page with &quot;== 综述 == # 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...&quot;</p> <hr /> <div>== 综述 ==<br /> # 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&amp;rep=rep1&amp;type=pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Papers&diff=457907 Papers 2021-12-19T03:15:34Z <p>2020244055: /* 科研方向 */</p> <hr /> <div>{{DISPLAYTITLE:必读文献}}<br /> <br /> == 科研方向 ==<br /> &lt;strong&gt;[[CRPQ | CRPQ]]&lt;/strong&gt;<br /> <br /> &lt;strong&gt;[[数据管理小组 | 数据管理小组]]&lt;/strong&gt;<br /> <br /> &lt;strong&gt;[[表示学习小组 | 表示学习小组]]&lt;/strong&gt;<br /> <br /> &lt;strong&gt;[[图谱构建小组 | 图谱构建小组]]&lt;/strong&gt;<br /> <br /> &lt;strong&gt;[[可视化小组 | 可视化小组]]&lt;/strong&gt;<br /> <br /> == 英语写作 ==<br /> <br /> [[media:Writing_Science.pdf | Writing Science ]]<br /> <br /> [[media:English_for_Writing_Research_Papers.pdf | English for Writing Research Papers]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457903 数据管理小组 2021-11-16T13:58:30Z <p>2020244055: /* 子图匹配查询相关 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 30(7):1000-9825, 2019. [http://apps.webofknowledge.com/full_record.do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # 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.[https://link.springer.com/article/10.1007/s11280-021-00965-5]<br /> # 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]<br /> # 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.[https://dl.acm.org/doi/abs/10.1145/3472883.3486991]<br /> # Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[https://arxiv.org/pdf/2110.13348.pdf]<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457902 数据管理小组 2021-11-16T13:57:52Z <p>2020244055: /* 子图匹配查询相关 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 30(7):1000-9825, 2019. [http://apps.webofknowledge.com/full_record.do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # 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.[https://arxiv.org/pdf/2111.04556.pdf]<br /> # 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]<br /> # 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.[https://dl.acm.org/doi/abs/10.1145/3472883.3486991]<br /> # Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[https://arxiv.org/pdf/2110.13348.pdf]<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457901 数据管理小组 2021-11-16T13:57:06Z <p>2020244055: /* 子图匹配查询相关 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 30(7):1000-9825, 2019. [http://apps.webofknowledge.com/full_record.do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # 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]<br /> # 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.[https://dl.acm.org/doi/abs/10.1145/3472883.3486991]<br /> # Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[https://arxiv.org/pdf/2110.13348.pdf]<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457900 数据管理小组 2021-11-16T13:55:52Z <p>2020244055: /* 子图匹配查询相关 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 30(7):1000-9825, 2019. [http://apps.webofknowledge.com/full_record.do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # 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.[https://dl.acm.org/doi/abs/10.1145/3472883.3486991]<br /> # Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[https://arxiv.org/pdf/2110.13348.pdf]<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457899 数据管理小组 2021-11-16T13:54:45Z <p>2020244055: /* 子图匹配查询相关 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 30(7):1000-9825, 2019. [http://apps.webofknowledge.com/full_record.do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # Lassila O, Schmidt M, Bebee B, et al. Graph? Yes! Which one? Help![J]. arXiv preprint arXiv:2110.13348, 2021.[https://arxiv.org/pdf/2110.13348.pdf]<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457898 数据管理小组 2021-11-16T13:53:07Z <p>2020244055: /* 子图匹配查询相关 */</p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 30(7):1000-9825, 2019. [http://apps.webofknowledge.com/full_record.do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J], 2020.[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> <br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84&diff=457897 数据管理小组 2021-11-16T13:51:51Z <p>2020244055: </p> <hr /> <div>== 综述 ==<br /> # Z. Kaoudi and I. Manolescu. RDF in the Clouds: A Survey. VLDB J., 24(1):67–91, 2015. [https://link.springer.com/article/10.1007/s00778-014-0364-z]<br /> # Özsu, M. Tamer. &quot;A survey of RDF data management systems.&quot; Frontiers of Computer Science 10(3): 418-432, 2016.[https://link.springer.com/article/10.1007/s11704-016-5554-y]<br /> # 邹磊, 彭鹏. 分布式 RDF 数据管理综述[J]. 计算机研究与发展, 54(6):1213-1224, 2017.[http://crad.ict.ac.cn/CN/abstract/abstract3420.shtml]<br /> # 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]<br /> # Wylot, Marcin, et al. &quot;RDF Data Storage and Query Processing Schemes: A Survey.&quot; ACM Computing Surveys (CSUR) 51(4):84, 2018.[https://dl.acm.org/doi/abs/10.1145/3177850]<br /> # 王鑫, 邹磊, 王朝坤, 彭鹏. 知识图谱构建技术综述[J]. 软件学报, 30(7):1000-9825, 2019. [http://apps.webofknowledge.com/full_record.do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1]<br /> # 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]<br /> <br /> == 子图匹配查询相关 ==<br /> # Huang C, Zhang Q, Guo D, et al. GQARDF: An Efficient SPARQL Query Answering Engine on RDF Graphs[J].[http://www.semantic-web-journal.net/system/files/swj2922.pdf]<br /> # 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. [https://dl.acm.org/doi/abs/10.1145/800105.803397]<br /> # 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.[https://arxiv.org/abs/1205.6691]<br /> # L. Lai, L. Qin, X. Lin, L. Chang, Scalable subgraph enumeration in MapReduce, Proceedings of the VLDB Endowment 8(10):974–985, 2015. [https://dl.acm.org/doi/abs/10.14778/2794367.2794368]<br /> # # 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. [https://link.springer.com/article/10.1007/S00778-015-0415-0]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3021924.3021937]<br /> # 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]<br /> # 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. [https://dl.acm.org/doi/abs/10.14778/3151106.3151109]<br /> # Yang Z, Lai L, Lin X, et al. Huge: An efficient and scalable subgraph enumeration system[J]. arXiv preprint arXiv:2103.14294, 2021.[https://arxiv.org/pdf/2103.14294.pdf]<br /> == 编码 ==<br /> # 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.[https://cse.iitk.ac.in/users/atrem/papers/cods-comad2018.pdf]<br /> # Urbani J, Dutta S, Gurajada S, et al. KOGNAC: efficient encoding of large knowledge graphs[J]. arXiv preprint arXiv:1604.04795, 2016.[https://arxiv.org/pdf/1604.04795.pdf]<br /> == 分布式数据管理 ==<br /> # 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.[http://resources.mpi-inf.mpg.de/d5/triad/mod375-gurajada.pdf]<br /> # Schätzle A, Przyjaciel-Zablocki M, Skilevic S, et al. S2RDF: RDF querying with SPARQL on spark[J]. arXiv preprint arXiv:1512.07021, 2015.[https://arxiv.org/pdf/1512.07021.pdf]<br /> # 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.[https://dl.acm.org/doi/pdf/10.1145/2463676.2467799]<br /> # 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.[https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]<br /> # 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.[https://link.springer.com/article/10.1007/s00778-013-0337-7]<br /> == 存储相关 ==<br /> # Yuan P, Liu P, Wu B, et al. TripleBit: a fast and compact system for large scale RDF data[J]. Proceedings of the VLDB Endowment, 2013, 6(7): 517-528.[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.3012&amp;rep=rep1&amp;type=pdf]<br /> # Urbani J, Jacobs C. Adaptive low-level storage of very large knowledge graphs[C]//Proceedings of The Web Conference 2020. 2020: 1761-1772.[https://arxiv.org/pdf/2001.09078.pdf]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Writing&diff=457893 Writing 2021-11-07T05:20:16Z <p>2020244055: /* 词汇辨析 */</p> <hr /> <div>{{DISPLAYTITLE:学术写作指南}}<br /> <br /> == 词汇辨析 == <br /> # may, would, can（may的不确定性太强，尽量少出现在论文中）<br /> # get-&gt;obtain（都表示获得）<br /> # calculation-&gt;computation（calculation指数学计算，computation指范围更大的计算）<br /> # use-&gt;employ<br /> # workflow（用于工作流程图）<br /> # be extend to, accommodate（表示框架容纳模型用后者）<br /> # shown -&gt; depicted<br /> # edges-&gt;triples（知识图谱中更多用triples）<br /> # on top of（在xx之上，固定搭配）<br /> # at the same time -&gt; meanwhile<br /> # Nevertheless, However<br /> # classify, divide, categorize（表达方法归类时classify更好）<br /> # first-&gt;initial（表达第一个工作时用initial）<br /> # Currently, at present（目前）<br /> # already基本不用<br /> # unified统一的, uniform一致均匀的<br /> # scale to large-scale KGs-&gt; achieve the scalability for large KGs（扩展到大型知识图谱）<br /> # It is worthwhile to highlight our main contributions in this paper: -&gt; Our contributions in this paper can be summarized as follows:（介绍贡献的表达方式）<br /> # be on par with-&gt;be comparable to（可以表示与xx相当）<br /> # smoothly（顺利的）<br /> # conduct extensive experiments（做了大量实验，也可用被动）<br /> # varieties of methods =&gt; various methods<br /> # statistics-based methods =&gt; statistical methods 统计的方法<br /> # researches =&gt; research works<br /> # considered as =&gt; referred to as<br /> # as it is shown/mentioned =&gt; as shown/mentioned<br /> # Although it has been identified in [ ] that the problems ... 介绍相关文献的工作<br /> # apply to =&gt; be applicable to 适用于<br /> # above =&gt; aforementioned<br /> # To the best of our knowledge<br /> # meeting =&gt; satisfying 满足<br /> # specify A to B =&gt; assign A to B<br /> # with no specified type =&gt; without specified type<br /> # in this way =&gt; in this manner<br /> # for our future work =&gt; in the future work<br /> # the ontology hierarchy that we extract, =&gt; the extracted ontology hierarchy,<br /> # subsequent tasks =&gt; downstream tasks<br /> # according to =&gt; as per<br /> # A, B, and C<br /> <br /> == 英文写作资料 ==<br /> #[[media:English for Writing Research Papers.pdf |English for Writing Research Papers]]<br /> #[[media:Writing Science.pdf |Writing Science]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457892 Conferences 2021-11-07T05:17:55Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-22 || || 2021.11.17 || || || || https://icde2022.ieeecomputer.my/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-22/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || TBD || || || || || <br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-22 || TBD || || || || || <br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |-<br /> | C || WISE-22 || 2022.3.1 || 2022.3.8 || || || || https://wise2022.sigappfr.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457887 柳鹏凯 2021-11-02T09:09:45Z <p>2020244055: /* 2020-2021 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 分布式知识图谱数据管理关键技术与系统, 国家重点研发计划项目, 2020.12.01--2022.11.30. (2019YFE0198600)<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B.(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部 优秀学生党支部书记<br /> # 智算学部 优秀共产党员<br /> # CCF天津大学学生分会 主席<br /> # 天津大学 优秀共青团干部<br /> <br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457841 Conferences 2021-08-11T13:22:45Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-22 || || 2021.11.17 || || || || https://icde2022.ieeecomputer.my/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-22/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || TBD || || || || || <br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-22 || TBD || || || || || <br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457840 Conferences 2021-08-11T13:19:59Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-22 || || 2021.11.17 || || || || https://icde2022.ieeecomputer.my/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-21/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || TBD || || || || || <br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-22 || TBD || || || || || <br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Conferences&diff=457839 Conferences 2021-08-11T13:19:12Z <p>2020244055: /* 重要时间 */</p> <hr /> <div>{{DISPLAYTITLE:科学研究}}<br /> &lt;/big&gt;<br /> == 重要时间 ==<br /> <br /> {| class=&quot;wikitable&quot;<br /> |-<br /> ! CCF !! Conference !! Abstract !! Full Paper !! Short Paper !! Demo !! Poster !! Link<br /> |-<br /> | A || SIGMOD-22 || || 2021.9.15 || 2021.9.15 || || || https://2022.sigmod.org/<br /> |-<br /> | A || VLDB-22 || || 20th of each month || || || || https://vldb.org/2022/<br /> |-<br /> | A || ICDE-22 || || 2021.11.17 || || || || https://icde2022.ieeecomputer.my/<br /> |-<br /> | A || WWW-22 || 2021.10.14 || 2021.10.21 || || 2022.02.03 || 2022.02.03 || https://www2022.thewebconf.org/<br /> |-<br /> | A || IJCAI-22 || TBD || || || || || https://ijcai-22.org/<br /> |-<br /> | A || AAAI-22 || 2021.8.30 || 2021.9.8 || || || || https://aaai.org/Conferences/AAAI-21/<br /> |-<br /> | A || KDD-22 || TBD || || || || ||<br /> |-<br /> | A || SIGIR-22 || TBD || || || || || https://sigir.org/sigir2022/<br /> |-<br /> | A || ACL-22 || || 2022.1.7 || 2022.1.7 || || || https://2022.aclweb.org<br /> |-<br /> | A || NeurIPS-22 ||TBD || || || || ||<br /> |-<br /> | A || ICML-22 || TBD || || || || ||<br /> |-<br /> | B || EMNLP-22 || TBD || || || || ||<br /> |-<br /> | B || CIKM-22 || TBD || || || || || <br /> |-<br /> | B || EDBT-22 || || 2021.10.1 || 2021.10.1|| || || https://conferences.inf.ed.ac.uk/edbticdt2022/<br /> |-<br /> | B || ISWC-21 || TBD || || || || || <br /> |-<br /> | B || DASFAA-22 || 2021.10.28 || 2021.11.4 || 2021.11.4 || 2021.11.28 || || https://www.dasfaa2022.org/<br /> |}<br /> <br /> == 学术写作 ==<br /> [[ Writing | 学术写作指南 ]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457830 柳鹏凯 2021-07-29T11:56:44Z <p>2020244055: /* 2020-2021 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 分布式知识图谱数据管理关键技术与系统, 国家重点研发计划项目, 2020.12.01--2022.11.30. (2019YFE0198600)<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B.(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部 优秀学生党支部书记<br /> # 智算学部 优秀共产党员<br /> # CCF天津大学学生分会 主席<br /> <br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457829 柳鹏凯 2021-07-29T11:55:46Z <p>2020244055: /* 参与项目 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 分布式知识图谱数据管理关键技术与系统, 国家重点研发计划项目, 2020.12.01--2022.11.30. (2019YFE0198600)<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B.(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> # 智算学部 优秀共产党员<br /> # CCF天津大学学生分会 主席<br /> <br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457828 柳鹏凯 2021-07-29T11:55:32Z <p>2020244055: /* 参与项目 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> # 分布式知识图谱数据管理关键技术与系统, 国家重点研发计划项目, 2020.12.01--2022.11.30. (2019YFE0198600)<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B.(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> # 智算学部 优秀共产党员<br /> # CCF天津大学学生分会 主席<br /> <br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457827 柳鹏凯 2021-07-29T11:52:03Z <p>2020244055: /* 2020-2021 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B.(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> # 智算学部 优秀共产党员<br /> # CCF天津大学学生分会 主席<br /> <br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457826 柳鹏凯 2021-07-29T11:51:36Z <p>2020244055: /* 2020-2021 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B.(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> # 智算学部 优秀共产党员<br /> <br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457825 柳鹏凯 2021-07-29T11:48:45Z <p>2020244055: /* 发表论文 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B.(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457824 柳鹏凯 2021-07-29T11:46:19Z <p>2020244055: </p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> 数据库系统工程师&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B,(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Activities&diff=457782 Activities 2021-06-19T02:41:30Z <p>2020244055: </p> <hr /> <div>{{DISPLAYTITLE:集体活动}}<br /> <br /> == 水上公园团建 ==<br /> <br /> [[File:团建1.jpeg | 900px]]<br /> <br /> [[File:团建2.jpeg | 900px]]<br /> <br /> == 海上团建 ==<br /> [[File:团建3.jpg | 900px]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=File:%E5%9B%A2%E5%BB%BA3.jpg&diff=457781 File:团建3.jpg 2021-06-19T02:39:42Z <p>2020244055: </p> <hr /> <div></div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Activities&diff=457780 Activities 2021-06-19T02:39:23Z <p>2020244055: </p> <hr /> <div>[[File:Example.jpg]]{{DISPLAYTITLE:集体活动}}<br /> <br /> == 水上公园团建 ==<br /> <br /> [[File:团建1.jpeg | 900px]]<br /> <br /> [[File:团建2.jpeg | 900px]]<br /> <br /> == 海上团建 ==<br /> [[File:团建3.jpg | 900px]]</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457767 柳鹏凯 2021-04-15T11:16:22Z <p>2020244055: </p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B,(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> # Ran Zhang, '''Pengkai Liu''', Xiefan Guo, Sizhuo Li, Xin Wang. A Unified Relational Storage Scheme for RDF and Property Graphs. 第16届中国信息系统及应用大会 (WISA 2019).<br /> <br /> <br /> == 专利 ==<br /> #王鑫, '''柳鹏凯''', 张然, 郭谢帆. 一种基于关系模型的RDF图和属性图统一存储方法. 国家发明专利, 申请号：201910748425.3<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457766 柳鹏凯 2021-04-15T11:07:46Z <p>2020244055: /* 参与项目 */</p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> # 面向RDF知识图谱的图数据库研究与开发，国家级大学生创新创业项目，负责人，2018.05.01--2019.05.01（201810056090）<br /> <br /> == 发表论文 ==<br /> <br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B,(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=%E6%9F%B3%E9%B9%8F%E5%87%AF&diff=457765 柳鹏凯 2021-04-15T11:01:58Z <p>2020244055: </p> <hr /> <div>&lt;big&gt;<br /> 天津大学 智能与计算学部 计算机科学与技术学院 硕士研究生<br /> <br /> '''研究方向'''：图数据库、知识图谱数据管理&lt;/br&gt;<br /> '''通讯地址'''：天津市津南区海河教育园区雅观路135号 天津大学 北洋园校区 智能与计算学部&lt;/br&gt;<br /> '''邮政编码'''：300354&lt;/br&gt;<br /> '''办公地址'''：55教学楼B区324室&lt;/br&gt;<br /> <br /> 电子邮箱：liupengkai@tju.edu.cn<br /> <br /> &lt;/big&gt;<br /> == 简历 ==<br /> 2020年6月于天津大学获得工学学士（计算机科学与技术）学位。&lt;/br&gt;<br /> 2020年9月至今 天津大学智能与计算学部硕士研究生在读。&lt;/br&gt;<br /> <br /> == 参与项目 ==<br /> # 统一模型和语言的知识图谱数据库管理系统研发, CCF-华为数据库创新研究计划项目, 2019.09.01--2020.12.31 (CCF-Huawei DBIR2019004B)<br /> <br /> == 发表论文 ==<br /> <br /> # '''Pengkai Liu''', Shunting Cai, Baozhu Liu, Xin Wang. OntoCSM: An Ontology-aware Characteristic Set Merging Approach for RDF Type Discovery. The 26th International Conference on Database Systems for Advanced Applications. DASFAA 2021. (accepted as regular full paper) (CCF B类会议)<br /> # Sizhuo Li, Guozheng Rao, Baozhu Liu, '''Pengkai Liu''', Sicong Dong, Zhiyong Feng. An Ontology-Aware Unified Storage Scheme for Knowledge Graphs. APWeb-WAIM 2019. （CCF C类会议）<br /> # 刘宝珠,王鑫,'''柳鹏凯''',李思卓,张小旺,杨雅君.KGDB:统一模型和语言的知识图谱数据库管理系统.软件学报. 2021(3). http://www.jos.org.cn/1000-9825/6181.htm, CCF B,(已录用)<br /> # Baozhu Liu, Xin Wang, '''Pengkai Liu''', SiZhuo Li, Qiang Fu, Yunpeng Chai. UniKG: A Unified Interoperable Knowledge Graph Database System. IEEE 37th International Conference on Data Engineering. ICDE 2021 (accepted as demo paper) (CCF A类会议)<br /> <br /> == 获奖情况 ==<br /> === 2020-2021 ===<br /> # 北洋启航自立奖<br /> # 智算学部2020年度 优秀学生党支部书记<br /> === 2019-2020 === <br /> # 天津大学优秀毕业生<br /> === 2018-2019 ===<br /> # 天津大学初心奖学金 <br /> # 学习进步先进个人<br /> # 社团活动先进个人<br /> # 科技创新先进个人<br /> # 党务工作先进个人<br /> # 天津大学三好学生<br /> # 天津大学社研会优秀学生干部<br /> # 智算学部学生党建工作办公室拓展实践中心主任<br /> === 2017-2018 ===<br /> # 美国大学生数学建模竞赛（Honorable Mention）<br /> # 天津大学社研会优秀学生干部<br /> # 社团活动先进个人 <br /> # 天津大学三好学生<br /> === 2016-2017 === <br /> # 天津大学三好学生 <br /> # 志愿服务先进个人</div> 2020244055 http://www.tjudb.cn/dbgroup/index.php?title=Writing&diff=457702 Writing 2021-02-04T03:55:20Z <p>2020244055: /* 词汇辨析 */</p> <hr /> <div>{{DISPLAYTITLE:学术写作指南}}<br /> <br /> == 词汇辨析 == <br /> # may, would, can（may的不确定性太强，尽量少出现在论文中）<br /> # get-&gt;obtain（都表示获得）<br /> # calculation-&gt;computation（calculation指数学计算，computation指范围更大的计算）<br /> # use-&gt;employ<br /> # workflow（用于工作流程图）<br /> # be extend to, accommodate（表示框架容纳模型用后者）<br /> # shown -&gt; depicted<br /> # edges-&gt;triples（知识图谱中更多用triples）<br /> # on top of（在xx之上，固定搭配）<br /> # at the same time -&gt; meanwhile<br /> # Nevertheless, However<br /> # classify, divide, categorize（表达方法归类时classify更好）<br /> # first-&gt;initial（表达第一个工作时用initial）<br /> # Currently, at present（目前）<br /> # already基本不用<br /> # unified统一的, uniform一致均匀的<br /> # scale to large-scale KGs-&gt; achieve the scalability for large KGs（扩展到大型知识图谱）<br /> # It is worthwhile to highlight our main contributions in this paper: -&gt; Our contributions in this paper can be summarized as follows:（介绍贡献的表达方式）<br /> # be on par with-&gt;be comparable to（可以表示与xx相当）<br /> # smoothly（顺利的）<br /> # conduct extensive experiments（做了大量实验，也可用被动）<br /> # varieties of methods =&gt; various methods<br /> # statistics-based methods =&gt; statistical methods 统计的方法<br /> # researches =&gt; research works<br /> # considered as =&gt; referred to as<br /> # as it is shown/mentioned =&gt; as shown/mentioned<br /> # Although it has been identified in [ ] that the problems ... 介绍相关文献的工作<br /> # apply to =&gt; be applicable to 适用于<br /> # above =&gt; aforementioned<br /> # To the best of our knowledge<br /> # meeting =&gt; satisfying 满足<br /> # specify A to B =&gt; assign A to B<br /> # with no specified type =&gt; without specified type<br /> # in this way =&gt; in this manner<br /> # for our future work =&gt; in the future work<br /> # the ontology hierarchy that we extract, =&gt; the extracted ontology hierarchy,<br /> # subsequent tasks =&gt; downstream tasks</div> 2020244055