DebEAQ - debugging empty-answer queries on large data graphs
暂无分享,去创建一个
[1] Alexandra Poulovassilis,et al. Combining Approximation and Relaxation in Semantic Web Path Queries , 2010, SEMWEB.
[2] Ulrich Junker,et al. QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.
[3] Gautam Das,et al. IQR: an interactive query relaxation system for the empty-answer problem , 2014, SIGMOD Conference.
[4] Francesco Bonchi,et al. Graph Query Reformulation with Diversity , 2015, KDD.
[5] Wolfgang Lehner,et al. GraphMCS: Discover the Unknown in Large Data Graphs , 2014, EDBT/ICDT Workshops.
[6] Marko A. Rodriguez,et al. Constructions from Dots and Lines , 2010, ArXiv.
[7] Chengfei Liu,et al. Approximating query answering on RDF databases , 2011, World Wide Web.
[8] Ambuj K. Singh,et al. Graphs-at-a-time: query language and access methods for graph databases , 2008, SIGMOD Conference.
[9] Wolfgang Lehner,et al. GRAPHITE: an extensible graph traversal framework for relational database management systems , 2014, SSDBM.
[10] Wolfgang Lehner,et al. Relaxation of subgraph queries delivering empty results , 2015, SSDBM.
[11] Gautam Das,et al. A Probabilistic Optimization Framework for the Empty-Answer Problem , 2013, Proc. VLDB Endow..