College of Information Science and Engineering, Northeastern University, Shenyang 110819, China.

---

Abstract—With the increasing applications based on location, the researches on spatiotemporal data, especially queries of spatiotemporal data have attracted a lot of attention. XML, as a standard language of information exchanging over the Web, should have the ability to query spatiotemporal data. In this paper, we propose an algorithm, TwigSPFast, for matching a spatiotemporal XML query twig pattern. We represent spatiotemporal data by adding spatial and temporal attributes in common data and extend Dewey code to mark spatiotemporal data for special process and determine structure relationship of spatiotemporal nodes. Our technique uses streams to store leaf nodes in XML corresponding to leaf query node and filters the streams to delete unmatched nodes, after filtering, we 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.

Index Terms—Spatiotemporal data, query, Dewey code, XML twig pattern.

[PDF]

Cite: Luyi Bai, Yin Li, Jiemin Liu, "Fast Leaf-to-Root Holistic Twig Query on XML Spatiotemporal Data," Journal of Computers vol. 12, no. 6, pp. 534-542, 2017.