GSBRL : Efficient RDF graph storage based on reinforcement learning
暂无分享,去创建一个
[1] Peter Sanders,et al. Recent Advances in Graph Partitioning , 2013, Algorithm Engineering.
[2] Jens Lehmann,et al. DBpedia SPARQL Benchmark - Performance Assessment with Real Queries on Real Data , 2011, SEMWEB.
[3] Peter A. Boncz,et al. Exploiting Emergent Schemas to Make RDF Systems More Efficient , 2016, SEMWEB.
[4] Alex Graves,et al. Playing Atari with Deep Reinforcement Learning , 2013, ArXiv.
[5] LiChun Cao,et al. An Overview of Deep Reinforcement Learning , 2019, CACRE.
[6] Jeff Heflin,et al. LUBM: A benchmark for OWL knowledge base systems , 2005, J. Web Semant..
[7] Timos K. Sellis,et al. View selection for designing the global data warehouse , 2001, Data Knowl. Eng..
[8] Rich Caruana,et al. An empirical comparison of supervised learning algorithms , 2006, ICML.
[9] Gerhard Weikum,et al. RDF-3X: a RISC-style engine for RDF , 2008, Proc. VLDB Endow..
[10] Lei Zou,et al. gStore: a graph-based SPARQL query engine , 2014, The VLDB Journal.
[11] Yanbing Liu,et al. RLINK: Deep reinforcement learning for user identity linkage , 2020, World Wide Web.
[12] Lixin Gao,et al. GStar: an efficient framework for answering top-k star queries on billion-node knowledge graphs , 2018, World Wide Web.
[13] François Goasdoué,et al. View Selection in Semantic Web Databases , 2011, Proc. VLDB Endow..
[14] G Stix,et al. The mice that warred. , 2001, Scientific American.