• Sreeramula Santhosh
• Mr.N. NAVEEN KUMAR

Typically, an XML document can be modeled as a node labeled tree. For a given keyword query, several semantics have been proposed to define meaningful results, for which the basic semantics is Lowest Common Ancestor. Existing methods are not solved the common-ancestor-repetition (CAR) and visiting-useless-nodes (VUN) problems. In this paper, we propose a generic top-down processing strategy to resolve the common-ancestor-repetition problem and also we propose to use child nodes, rather than descendant nodes to test the satisfiability of a node with respect to the given semantics to address the Visiting-Useless-Nodes. Through these two proposed strategies, we can improve the overall search performance.

XML keyword, Common Ancestor

"Significant Hash-based Methods for Reducing the Time Complexity in XML Keyword Search", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.4, Issue 10, page no.32-34, October-2017, Available :http://www.jetir.org/papers/JETIR1710004.pdf

"Significant Hash-based Methods for Reducing the Time Complexity in XML Keyword Search", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.4, Issue 10, page no. pp32-34, October-2017, Available at : http://www.jetir.org/papers/JETIR1710004.pdf