• Swapna JawariKapisha
• G. Vijaya Lakshmi

Proximity Keyword Search is especially useful when searching on the web and in long unstructured documents such as XML. This system is designed to handle novel features of Proximity Keyword Search in XML documents. It concentrates mainly on producing ranked results efficiently for keyword search queries over XML documents. The proposed system is first of its kind in which the keyword string is pre processed before searching the XML document. This system eliminates the stop words and spaces entered by the user before locating the elements which contain the keywords. The search is case insensitive. In particular, this system is implemented in two stages. In pre processing stage, a set of keyword indices are built using CTREE concept for a set of XML documents. In the searching phase, the keywords entered by the user are analyzed and searched. Lowest common ancestor of the given keywords is computed and the results are ranked based upon the distance between the keywords located.

CTREE, Indexing, Keyword Proximity Search, Minimal Connecting Trees, XML.

"USING CTREE INDEX FOR PROXIMITY SEARCH IN XML DOCUMENTS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.90-96, May 2019, Available :http://www.jetir.org/papers/JETIRDA06017.pdf

"USING CTREE INDEX FOR PROXIMITY SEARCH IN XML DOCUMENTS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp90-96, May 2019, Available at : http://www.jetir.org/papers/JETIRDA06017.pdf