2010年国家杰出青年基金项目答辩-VLDB.pptVIP

Then we shows the running time on different database sizes. Sfiltering denotes the structural pruning. Pfiltering denotes the probabilistic pruning. E-bound denotes the iterative bound approach in the verification. * To test the impact of uncertainties, we change the mean and variance of Gaussian distribution. Structural pruning holds unchanged, which shows uncertainty does not have impact on it. Probabilistic pruning behaves good scalabilities under different uncertainties. * Our detail solution... Just read it… * * Solutions * Performance Evaluation Response and Construction time Solutions * Performance Evaluation Results on synthetic dataset Mean Variance Conclusions V Outline Problem Definition Query Processing Framework Solutions Background Ⅰ Ⅱ Ⅲ Ⅳ Conclusion * We propose the first efficient solution to answer threshold-based probabilistic sub-graph search over uncertain graph databases. We employ a filter and verification framework, and develop probability bounds for filtering. We design a cost model to select minimum number of features with the largest pruning ability. We demonstrate the effectiveness of our solution through experiments on real and synthetic data sets. * Thanks! Good morning, everyone. The title of the paper is ... I am ... * The talk consists of four parts...(read one by one). Let us see the first part--background. Graph is a complicated data structure, and has many applications. In bioinformatics, Gene regulatory and Yeast PPI networks can be modeled as graphs. * In chemistry, scientists build compounds database to analyze the characters of compounds. Compounds can be molded as graphs * In analysis of social network, EntityCube (developed by MSR) and web can be modeled as graphs. * Just read one by one... Based on the above applications, it is important to study query processing on large uncertain graphs. * The second part, problem definition. The uncertain graph model has vertex and edge uncertainties which denotes the existe