|Title||Estimating the Cardinality of RDF Graph Patterns|
|Publication Type||Conference Paper|
|Year of Publication||2007|
|Authors||Angela Maduko, Paul Schliekelman, Kemafor Anyanwu, Amit Sheth|
|Publisher||16th World Wide Web Conference (WWW2007)|
|Keywords||RDF and RDF graph patterns and RDF Semantic Summary and RDF Structural Summary and RDF Query processing and Statistical Summaries and Pattern Cardinality Estimation|
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is determining the join order which depends on the expected cardinality of intermediate results. This work proposes a pattern-based summarization framework for estimating the cardinality of RDF graph patterns. We present experiments on real world and synthetic datasets which confirm the feasibility of our approach.
|Full Text|| |
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, and Paul Schliekelman, 'Estimating the Cardinality of RDF Graph Patterns,'in Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8-12, 2007, C.L. Williamson et al. (Eds.), ACM 2007, pp. 12337ndash;1234.