Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/eswc2008/paper/330> ?p ?o. }

• 330 creator amit-sheth.
• 330 creator angela-maduko.
• 330 creator kemafor-anyanwu.
• 330 creator paul-schliekelman.
• 330 type InProceedings.
• 330 label "Graph Summaries for Subgraph Frequency Estimation".
• 330 sameAs 330.
• 330 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".
• 330 hasAuthorList authorList.
• 330 hasTopic Database_management_system.
• 330 hasTopic SPARQL.
• 330 hasTopic Semantic_Web.
• 330 isPartOf proceedings.
• 330 keyword "graph summaries".
• 330 keyword "result cardinality estimation".
• 330 keyword "subgraph cardinality estimation".
• 330 title "Graph Summaries for Subgraph Frequency Estimation".