Benchmarking Holistic Approaches to XML Tree Pattern Query Processing (Extended Abstract of Invited Talk)
Jiaheng Lu · 2010
In this talk I outlined and surveyed some developments in the field of XML tree pattern query processing, especially focussing on holis- tic approaches. XML tree pattern query (TPQ) processing is a research stream within XML data management that focuses on efficient TPQ an- swering. 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 ex- pressed 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. In the talk, I presented an overview of the state of the art in TPQ processing. This overview shall start by provid- ing some background in holistic approaches to process TPQ and then introduce different algorithms and finally present benchmark datasets and experiments.