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.
Sheth, A. P.,
& Schliekelman, P.
(2007). Estimating the Cardinality of RDF Graph Patterns. Proceeding of the 16th International Conference on World Wide Web, 1233-1234.