Abstract
With the increasing applications based on location, the research on spatiotemporal data, especially queries of spatiotemporal data, has attracted a lot of attention. XML, as a standard language of information exchange over the web, should have the ability to query spatiotemporal data. In this chapter, they propose a fast leaf-to-root holistic twig query algorithm on spatiotemporal XML data, TwigSPFast. The authors represent spatiotemporal data by adding spatial and temporal attributes in common data and extending Dewey code to mark spatiotemporal data for special processes and determine the structure relationship of spatiotemporal nodes. This technique uses streams to store leaf nodes in XML corresponding to leaf query node and filters the streams to delete unmatched nodes, after filtering, they build output list for every matched leaf node that matches the query path from leaf node to root. It can be proved that TwigSPFast is optimal in time complexity and space complexity.