Estimating the cardinality of RDF graph patterns

Authors:
Angela Maduko;Kemafor Anyanwu;Amit Sheth;Paul Schliekelman
Affiliations:
University of Georgia, Athens, GA;University of Georgia, Athens, GA;Knoesis Lab, Dayton, OH;University of Georgia, Athens, GA
Venue:
Proceedings of the 16th international conference on World Wide Web
Year:
2007

Citing 3
Cited 6

gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
SemRank: ranking complex relationship search results on the semantic web

WWW '05 Proceedings of the 14th international conference on World Wide Web
LUBM: A benchmark for OWL knowledge base systems

Web Semantics: Science, Services and Agents on the World Wide Web

RDF-3X: a RISC-style engine for RDF

Proceedings of the VLDB Endowment
Scalable join processing on very large RDF graphs

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Annotated RDF

ACM Transactions on Computational Logic (TOCL)
The RDF-3X engine for scalable management of RDF data

The VLDB Journal — The International Journal on Very Large Data Bases
Database foundations for scalable RDF processing

RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Building an efficient RDF store over a relational database

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

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.