Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases

Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description Framework (RDF) data management. All these works assume that the underlying data are certain. However, in reality, graphs are often noisy and uncertain due to various factors, such as errors in data extraction, inconsistencies in data integration, and privacy preserving purposes. Therefore, in this paper, the authors explain subgraph similarity search on large probabilistic graph databases. Different from previous works assuming that edges in an uncertain graph are independent of each other, they explain the uncertain graphs where edges' occurrences are correlated.

Provided by: VLD Digital Topic: Data Management Date Added: May 2012 Format: PDF

Download Now

Find By Topic