Algorithms for XML Tree Pattern Matching and Query Processing

Free registration required

Executive Summary

XML Tree Pattern Query (TPQ) processing is a research stream within XML data management that focuses on efficient TPQ answering. With the increasing popularity of XML for data representation, there is a lot of interest in query processing over data that conforms to a tree-structured data model. Queries on XML data are commonly expressed in the form of tree patterns (or twig patterns), which represent a very useful subset of XPath and XQuery. Efficiently finding all tree pattern matches in an XML database is a major concern of XML query processing. In the past few years, many algorithms have been proposed to match such tree patterns. This paper presents an overview of the state of the art in TPQ processing.

  • Format: PDF
  • Size: 1031.2 KB