  A lot of advances in the processing of XML data have been proposed in last
two decades. There were many approaches focused on the efficient processing of
twig pattern queries (TPQ). However, including the TPQ into an XQuery compiler
is not a straightforward task and current XML DBMSs process XQueries without
any TPQ detection. In this paper, we demonstrate our prototype of a native XML
DBMS called RadegastXDB that uses a TPQ detection to accelerate structural
XQueries. Such a detection allows us to utilize state-of-the-art TPQ processing
algorithms. Our experiments show that, for the structural queries, these
algorithms and state-of-the-art XML indexing techniques make our prototype
faster than all of the current XML DBMSs, especially for large data
collections. We also show that using the same techniques is also efficient for
the processing of queries with value predicates.
