Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DATESO
2007

favoriteEmaildiscussreport

103views Database» more DATESO 2007»

Using BMH Algorithm to Solve Subset of XPath Queries

13 years 6 months ago

Using BMH Algorithm to Solve Subset of XPath Queries

Download sunsite.informatik.rwth-aachen.de

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.

David Toth

Real-time Traffic

Database | DATESO 2007 | Possible Xpath Queries | XPATH Queries | XPath Queries Execution |

claim paper

Related Content

» Rewriting XPath Queries Using Materialized Views

» XPath Typing Using a Modal Logic with Converse for Finite Trees

» Comparing XML path expressions

» XPath transitive closure logic and nested tree walking automata

» On Tree Pattern Query Rewriting Using Views

» A probabilistic XML merging tool

» SUSAX Contextspecific searching in XML documents using sequence alignment techniques

» XLeaf Twig Evaluation with Skipping Loop Joins and Virtual Nodes

» Solving Crossword Puzzles via the Google API

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	DATESO
Authors	David Toth

Comments (0)