Estimating the cardinality of RDF graph patterns

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. Categories and Subject Descriptors H.2.4 [Systems]: Query processing General Terms: Management, Performance.

• Type: Conference
• Year: 2007
• Where: WWW
• Authors: Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman
• Keywords: Internet Technology, Most RDF Query, Pattern-based Summarization Framework, RDF Graph Patterns, WWW 2007