![](https://d3ilqtpdwi981i.cloudfront.net/b_mJxqegcLBoTQtF1jeqori-DmY=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/e9/53/0f/e9530f41-bf52-4d62-bfe4-566bc8975f7c/thumbnail_ddaa2d35-28eb-43a1-b9e2-5f63a95781cb.jpg)
Presentation
Estimating the Cardinality of RDF Graph Patterns
Proceeding of the 16th International Conference on World Wide Web
Document Type
Conference Proceeding
Publication Date
5-8-2007
Disciplines
Abstract
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.
DOI
10.1145/1242572.1242782
Citation Information
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth and Paul Schliekelman. "Estimating the Cardinality of RDF Graph Patterns" Proceeding of the 16th International Conference on World Wide Web (2007) p. 1233 - 1234 ISSN: 978-1-59593-654-7 Available at: http://works.bepress.com/amit_sheth/151/
The featured PDF document is the unpublished, peer-reviewed version of this proceeding.
This paper was presented at the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8-12, 2007.