Authors
Angela Maduko, Kemafor Anyanwu, Amit Sheth, Paul Schliekelman
Publication date
2007/5/8
Book
Proceedings of the 16th international conference on World Wide Web
Pages
1233-1234
Description
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.
Total citations
Scholar articles
A Maduko, K Anyanwu, A Sheth, P Schliekelman - Proceedings of the 16th international conference on …, 2007