01471nas a2200205 4500008004100000245005400041210005400095260002900149520085700178653001901035653002501054653002001079653002301099653002401122100001901146700002101165700002301186700001601209856004001225 2008 eng d00aGraph Summaries for Subgraph Frequency Estimation0 aGraph Summaries for Subgraph Frequency Estimation aTenerife, Spainc06/20083 aA fundamental problem related to graph structured databases is searching for substructures. One issue with respect to 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 using 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 through experiments on real and synthetic datasets.10aData summaries10aFrequency estimation10aGraph summaries10aRDF graph patterns10aRDF query optimizer1 aMaduko, Angela1 aAnyanwu, Kemafor1 aSchliekelman, Paul1 aSheth, Amit uhttp://knoesis.wright.edu/node/1282