http://www.tjudb.cn/dbgroup/index.php?action=history&feed=atom&title=%E6%95%B0%E6%8D%AE%E7%AE%A1%E7%90%86%E5%B0%8F%E7%BB%84 数据管理小组 - Revision history 2026-05-05T23:56:01Z Revision history for this page on the wiki MediaWiki 1.31.1 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=457983&oldid=prev 2021244137: /* 分布式数据管理 */ 2022-04-09T06:40:22Z <p>‎<span dir="auto"><span class="autocomment">分布式数据管理</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 06:40, 9 April 2022</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l28" >Line 28:</td> <td colspan="2" class="diff-lineno">Line 28:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 分布式数据管理 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 分布式数据管理 ==</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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.</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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][https://www.graphengine.io/downloads/papers/Trinity.RDF.pdf]</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del class="diffchange diffchange-inline"># 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]</del></div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>&#160;</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del class="diffchange diffchange-inline"># 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]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del class="diffchange diffchange-inline"># 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]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 存储相关 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 存储相关 ==</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td></tr> </table> 2021244137 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=457981&oldid=prev 2021244137: /* 编码 */ 2022-04-09T06:39:26Z <p>‎<span dir="auto"><span class="autocomment">编码</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 06:39, 9 April 2022</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l24" >Line 24:</td> <td colspan="2" class="diff-lineno">Line 24:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 编码 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 编码 ==</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del class="diffchange diffchange-inline"># 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]</del></div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>&#160;</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 分布式数据管理 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 分布式数据管理 ==</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> </table> 2021244137 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=457980&oldid=prev 2021244137: /* 子图匹配查询相关 */ 2022-04-09T06:39:05Z <p>‎<span dir="auto"><span class="autocomment">子图匹配查询相关</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 06:39, 9 April 2022</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l9" >Line 9:</td> <td colspan="2" class="diff-lineno">Line 9:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"># 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]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"># 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]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"># 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]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"># 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]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"># 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]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l21" >Line 21:</td> <td colspan="2" class="diff-lineno">Line 16:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 编码 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 编码 ==</div></td></tr> </table> 2021244137 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&oldid=prev 2020244055: /* 存储相关 */ 2021-12-26T12:38:46Z <p>‎<span dir="auto"><span class="autocomment">存储相关</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 12:38, 26 December 2021</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l35" >Line 35:</td> <td colspan="2" class="diff-lineno">Line 35:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> </table> 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&oldid=prev 2020244055: /* 综述 */ 2021-12-26T12:37:25Z <p>‎<span dir="auto"><span class="autocomment">综述</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 12:37, 26 December 2021</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l5" >Line 5:</td> <td colspan="2" class="diff-lineno">Line 5:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div># 王鑫, 邹磊, 王朝坤, 彭鹏. <del class="diffchange diffchange-inline">知识图谱构建技术综述[J]</del>. 软件学报, 30(7):<del class="diffchange diffchange-inline">1000</del>-<del class="diffchange diffchange-inline">9825</del>, 2019. [http://<del class="diffchange diffchange-inline">apps</del>.<del class="diffchange diffchange-inline">webofknowledge</del>.<del class="diffchange diffchange-inline">com</del>/<del class="diffchange diffchange-inline">full_record</del>.<del class="diffchange diffchange-inline">do?product=UA&amp;search_mode=GeneralSearch&amp;qid=2&amp;SID=5A8ngFeHmXRHcuUqaNS&amp;page=1&amp;doc=1</del>]</div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div># 王鑫, 邹磊, 王朝坤, 彭鹏<ins class="diffchange diffchange-inline">, 冯志勇</ins>. <ins class="diffchange diffchange-inline">知识图谱数据管理研究综述</ins>. 软件学报, 30(7):<ins class="diffchange diffchange-inline">2139</ins>-<ins class="diffchange diffchange-inline">2174</ins>, 2019.[http://<ins class="diffchange diffchange-inline">jos</ins>.<ins class="diffchange diffchange-inline">org</ins>.<ins class="diffchange diffchange-inline">cn/html/2019/7</ins>/<ins class="diffchange diffchange-inline">5841</ins>.<ins class="diffchange diffchange-inline">htm</ins>]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> </table> 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&oldid=prev 2020244055: /* 子图匹配查询相关 */ 2021-11-16T13:58:30Z <p>‎<span dir="auto"><span class="autocomment">子图匹配查询相关</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 13:58, 16 November 2021</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l9" >Line 9:</td> <td colspan="2" class="diff-lineno">Line 9:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div># 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://<del class="diffchange diffchange-inline">arxiv</del>.<del class="diffchange diffchange-inline">org</del>/<del class="diffchange diffchange-inline">pdf</del>/<del class="diffchange diffchange-inline">2111</del>.<del class="diffchange diffchange-inline">04556.pdf</del>]</div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div># 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://<ins class="diffchange diffchange-inline">link</ins>.<ins class="diffchange diffchange-inline">springer.com</ins>/<ins class="diffchange diffchange-inline">article</ins>/<ins class="diffchange diffchange-inline">10</ins>.<ins class="diffchange diffchange-inline">1007/s11280-021-00965-5</ins>]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> </table> 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&oldid=prev 2020244055: /* 子图匹配查询相关 */ 2021-11-16T13:57:52Z <p>‎<span dir="auto"><span class="autocomment">子图匹配查询相关</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 13:57, 16 November 2021</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l9" >Line 9:</td> <td colspan="2" class="diff-lineno">Line 9:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> </table> 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&oldid=prev 2020244055: /* 子图匹配查询相关 */ 2021-11-16T13:57:06Z <p>‎<span dir="auto"><span class="autocomment">子图匹配查询相关</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 13:57, 16 November 2021</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l9" >Line 9:</td> <td colspan="2" class="diff-lineno">Line 9:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> </table> 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&oldid=prev 2020244055: /* 子图匹配查询相关 */ 2021-11-16T13:55:52Z <p>‎<span dir="auto"><span class="autocomment">子图匹配查询相关</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 13:55, 16 November 2021</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l9" >Line 9:</td> <td colspan="2" class="diff-lineno">Line 9:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> </table> 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&oldid=prev 2020244055: /* 子图匹配查询相关 */ 2021-11-16T13:54:45Z <p>‎<span dir="auto"><span class="autocomment">子图匹配查询相关</span></span></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 13:54, 16 November 2021</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l9" >Line 9:</td> <td colspan="2" class="diff-lineno">Line 9:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 子图匹配查询相关 ==</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"># 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]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div># 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]</div></td></tr> </table> 2020244055