Histogram Domain Ordering for Path Selectivity Estimation
暂无分享,去创建一个
[1] Ulf Leser,et al. Estimating Result Size and Execution Times for Graph Queries , 2010, ADBIS.
[2] Juan Sequeda,et al. G-CORE: A Core for Future Graph Query Languages , 2017, SIGMOD Conference.
[3] Jignesh M. Patel,et al. Using histograms to estimate answer sizes for XML queries , 2003, Inf. Syst..
[4] Sungpack Hong,et al. PGQL: a property graph query language , 2016, GRADES '16.
[5] Alexandra Poulovassilis,et al. Efficient regular path query evaluation using path indexes , 2016, EDBT.
[6] Guido Moerkotte,et al. Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins , 2011, 2011 IEEE 27th International Conference on Data Engineering.
[7] Amine Mhedhbi,et al. The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing , 2017 .
[8] George H. L. Fletcher,et al. gMark: Schema-Driven Generation of Graphs and Queries , 2015, IEEE Transactions on Knowledge and Data Engineering.
[9] Jeffrey F. Naughton,et al. Estimating the Selectivity of XML Path Expressions for Internet Scale Applications , 2001, VLDB.
[10] Yun Peng,et al. Selectivity estimation of twig queries on cyclic graphs , 2011, 2011 IEEE 27th International Conference on Data Engineering.