Using BMH Algorithm to Solve Subset of XPath Queries

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 can be grasp as text file contains tags and its content; that kind of view to XML is used in this work. We constraint XML document content and possible XPath queries. This work focus on key ideas and problems appertaining XPath queries execution using text search algorithm BMH.

• Type: Conference
• Year: 2007
• Where: DATESO
• Authors: David Toth
• Keywords: Database, DATESO 2007, Possible Xpath Queries, XPATH Queries, XPath Queries Execution