Paper Details

The dramatic enhancement of the networks has resulted in a growing need for supporting effective querying and miningmethods on high-scale graph having structured data. Unfortunately, the graph query is hard due to the NP-completenature of subgraph isomorphism. We propose a complementary approach that permitsdeclarative query answering overduplicated data, where data having copy with a chance of residing in the clean database. We rewrite queries over adatabase containing duplicates to return each answer with the probability that the answer is in the clean database. As afirst step to building such a system, we introduce the concept of probabilistic schema mappings and analyze their formalfoundations. We show that there are two feasible meanings for such mappings: according to the table semantics takesthat there resides an accurate mapping but we are confused what it is; according to - tuple semantics takes that thecorrect mapping may probably depend on the specific tuple in the source data. We show the query complications andalgorithms for providing answering queries in the existence of approximate schema mappings, and we brief an algorithmfor better computing the top level -k answers to queries . Because to the presence of noise (e.g., missing edges) in thelarge DB graph, we enquire the problem of approximate subgraph indexing, i.e., searching the occurrences of a querygraph in a large database graph with (possible and probable) missing edges

Prof. Mrs. Archana Jadhav, Ms. Ashwini S. Deshpande, Ms. Snehal Yadav, Mr. Praneet Chaturvedi, Mr. Deepak Swami, “Subgraph matching and ranking quality aware on discrepant large databases”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 4, pp. 1162-1167, April 2017.