Product Description

Answering Approximate Queries XML Data Final year IEEE project 2016

There is a lot of interest in searching XML data with the increasing popularity of XML for data representations.Answering Approximate Queries XML Data Final year IEEE project 2016.

It is daunting for users to formulate exact queries and search accurate answers, due to the structural heterogeneity and textual content’s diversity of XML. Therefore, approximate matching is introduced to deal with the difficulty in answering users’ queries, and this matching could be addressed by first relaxing the structure and content of a given query and, then, looking for answers that match the relaxed queries.

Answering Approximate Queries XML Data Final year IEEE project 2016. Ranking and returning the most relevant results of a query have become the most popular paradigm in XML query processing. However, the existing proposals do not adequately take structures into account, and they, therefore, lack the strength to elegantly combine structures with contents to answer the relaxed queries.

To address this problem, a sophisticated framework of query relaxations for supporting approximate queries over XML data is proposed in the system. The answers underlying this framework are not compelled to strictly satisfy the given query formulation; instead, they can be founded on properties infer able from the original query.

A novel top-k retrieval approach that can smartly generate the most promising answers in an order correlated with the ranking measure is developed. The set of experiments shows the effectiveness of the proposed approach in terms of precision and recall metrics.