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.
CITATION STYLE
Maduko, A., Anyanwu, K., Sheth, A., & Schliekelman, P. (2007). Estimating the cardinality of RDF graph patterns. In 16th International World Wide Web Conference, WWW2007 (pp. 1233–1234). https://doi.org/10.1145/1242572.1242782
Mendeley helps you to discover research relevant for your work.