Date of Publication :7th September 2017
Abstract: The Resource Description Framework (RDF) has been generally utilized to describe resources and their connections as a part of the semantic web. The RDF graph is one of the usually utilized representations for RDF information. In any case, in many real time application such as data extraction or integration, RDF graph incorporated from various information sources may frequently contain uncertain and conflicting data (e.g., uncertain labels or that violate facts/rules), because of the lack of quality of information sources. The formalizing the RDF data by conflicting probabilistic RDF diagrams, which contain the two anomalies and uncertainty. With such a probabilistic diagram model and concentrate on a vital issue in cache based query retrieval management in conflicting probabilistic RDF charts, which recovers sub graphs from conflicting probabilistic RDF graphs that are isomorphic to a given query graph and with excellent scores. In order to efficiently answer QA-gMatch queries, the proposed cache supported to query retrieval system, which can reducing time delay between new search and cache searching time. Finally, demonstrating the efficiency and the effectiveness of the proposed approach through extensive experiments.
Reference :
-
- X. L. Dong, L. Berti- Equille, and D. Srivastava. Integrating conflicting data: The role of source dependence. PVLDB, 2(1), 2009.
- X. L. Dong, A. Halevy, and C. Yu. Data integration with uncertainty. The VLDB Journal, 18(2), 2009.
- Xiang Lian, Lei Chen and Guoren Wang, “qualityaware subgraph matching over inconsistent probabilistic graph databases”, transaction on knowledge and data engineering, vol. 6, no. 1, may 2015.
- Jialong Han, Kai Zheng, Aixin Sun, Shuo Shang and Ji-Rong wen. “Discovering neighbourhood pattern queries by sample answers in knowledge base”, 2016 IEEE, ICDE 2016 conference.
- Wenfei Fan, Xin Wang, Yinghui Wu. JingboXu, “Association rules with graph patterns”, proceedings of the vldb endowment. Vol. 8. No 12(2015)
- Nikita b. Zambare. Snehalata s. Dongre. “An approach for keyword searching in uncertain graph data.” Vol. 3, issue 4.april 2015.
- Arun s.Maiya, Tanya y. Berger-wolf Sampling community structrute”. www 2010. April 26-30, 2010.
- W3C: Resource description framework (RDF). In http://www.w3.org/RDF/.
- E. Achtert, C. B¨ohm, P. Kr¨oger, P. Kunath, A. Pryakhin, and M. Renz. Efficient reverse k- nearest neighbor search in arbitrary metric spaces. In SIGMOD, 2006.
- G. Cong, W. Fan, F. Geerts, X. Jia, and S. Ma. Improving data quality: consistency and accuracy. In VLDB, 2007.
- N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB J., 16(4), 2007.
- P. Exner and P. Nugues. Entity extraction: From unstructured text to dbpedia rdf triples. In Proc. of the Web of Linked Entities Workshop, 2012.
- G. Beskales, M. A. Soliman, I. F. Ilyas, and S. BenDavid. Modeling and querying possible repairs in duplicate detection. PVLDB, 2(1), 2009.
- J. Chomicki and J. Marcinkowski. Minimal-change integrity maintenance using tuple deletions. Inf. Comput., 197(1/2), 2005.
- W. Fan. Dependencies revisited for improving data quality. In PODS, 2008.