Graph Summaries for Subgraph Frequency Estimation

A paper written by Kemafor Anyanwu, Paul Schliekelman, Amit Sheth and Angela Maduko. It was presented at the ESWC2008. It is about Graph Summaries, Result Cardinality Estimation and Subgraph Cardinality Estimation

See on Revyu.com.

[edit] Abstract

Graphs are increasingly used to model data in many disciplines. Structure search which matches a query graph against a data graph, is a common information retrieval paradigm for graph structured data. A crucial factor in optimizing such searches is the ability to estimate the frequency of substructures within a query graph. In this work, we present and evaluate two techniques for estimating the frequency of subgraphs from a summary of the data graph. In the first technique, we assume that edge occurrences on edge sequences are position independent and summarize only the most informative dependencies. In the second technique, we prune small subgraphs based on a valuation scheme that blends information about their importance and estimation power. In both techniques, we assume conditional independence to estimate the frequencies of larger subgraphs. We validate the effectiveness of our techniques using experiments on real and synthetic datasets

This data has been imported from the ESWC2008 data