Enhanced Coherency Technique for XML Keyword Search-A Review
Shabnam1, Sumit Kumar Yadav2

1Shabnam, Computer Science and Engineering, Lovely Professional University, Jalandhar (Punjab), India.
2Asst. Prof. Sumit Kumar Yadav, Information Security, IIIT, Allahabad (Uttar Pradesh) , India.
Manuscript received on March 05, 2013. | Revised Manuscript received on March 11, 2013. | Manuscript published on March 15, 2013. | PP: 69-72 | Volume-1 Issue-4, March 2013. | Retrieval Number: D0197031413/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Keyword search techniques which use advantages of XML structure make it simpler for ordinary users to query XML databases, but latest approaches to processing these queries depend on heuristics that are ultimately ad hoc. These approaches often retrieve not correct answers, overlook appropriate answers, and cannot rank answers properly. To remove these problems for data-centric XML, we propose enhanced coherency ranking, a domain and database design-independent ranking method for XML keyword queries that is based on an extension of the concept of mutual information. Keyword search is widely recognized as a best way to retrieve information from XML data. In order to specifically meet users search requirements, we proof how to effectively return the targets that users intend to search for. We mold XML document as a set of interconnected object-trees, where each object contains a sub tree to represent a concept in the real world. The work focuses on study and performance evaluation of these categories using MATLAB 7.14.
Keywords: XML, DATABASE, DATA MINING, Enhanced Coherency.