RWTH Aachen University
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper, is used to solve the constraint subset of XPath queries offering effective algorithm to resolve such queries. XML (eXtensible Markup Language) can be grasp as text file contains tags and its content; that kind of view to XML is used in this paper. The authors constraint XML document content and possible XPath queries. This paper focus on key ideas and problems appertaining XPath queries execution using text search algorithm BMH.