Vykonávání XPath dotazů na XML datech validních k existujícímu XML Schema

Abstract

XML is a mark-up language, which is increasingly used for storing data in the field of information technology. Like it is possible to search in relational databases with help of SQL language, it is also possible to search in XML databases. XPath is the most commonly used XML query language, which queries are processed, besides others, by holistic algorithms. These are designed to work with a particular data structure that contains the XML document nodes pre-processed so that these can be effectively treated. The main goal of this work is to test functionality of holistic algorithms when there is not any pre-processing of XML document and XML document is being processed sequentially from the input. Operating with streams of nodes is unthinkable part of work holistic algorithms. Work efficiency of these algorithms is also dependent on the size of the input streams. In this work, we are about to reduce nodes in input streams of algorithm by using valid XML Schema to current XML document. This reduction works based on prefix and postfix optimization of twig pattern query. Twig pattern query is one of the most common types of queries, which handle holistic algorithms.