SWST: A Disk Based Index for Sliding Window Spatio-Temporal Data

Singh, Manish and Zhu, Q and Jagadish, H V (2012) SWST: A Disk Based Index for Sliding Window Spatio-Temporal Data. In: IEEE 28th International Conference on Data Engineering, 1-5 April 2012, Washington DC, USA.

Full text not available from this repository. (Request a copy)


Numerous applications such as wireless communication and telematics need to keep track of evolution of spatio-temporal data for a limited past. Limited retention may even be required by regulations. In general, each data entry can have its own user specified lifetime. It is desired that expired entries are automatically removed by the system through some garbage collection mechanism. This kind of limited retention can be achieved by using a sliding window semantics similar to that from stream data processing. However, due to the large volume and relatively long lifetime of data in the aforementioned applications (in contrast to the real-time transient streaming data), the sliding window here needs to be maintained for data on disk rather than in memory. It is a new challenge to provide fast access to the information from the recent past and, at the same time, facilitate efficient deletion of the expired entries. In this paper, we propose a disk based, two-layered, sliding window indexing scheme for discretely moving spatio-temporal data. Our index can support efficient processing of standard time slice and interval queries and delete expired entries with almost no overhead. In existing historical spatio-temporal indexing techniques, deletion is either infeasible or very inefficient. Our sliding window based processing model can support both current and past entries, while many existing historical spatio-temporal indexing techniques cannot keep these two types of data together in the same index. Our experimental comparison with the best known historical index (i.e., the MV3R tree) for discretely moving spatio-temporal data shows that our index is about five times faster in terms of insertion time and comparable in terms of search performance. MV3R follows a partial persistency model, whereas our index can support very efficient deletion and update.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Singh, Manishhttp://orcid.org/0000-0001-5787-1833
Item Type: Conference or Workshop Item (Paper)
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: Library Staff
Date Deposited: 11 Sep 2019 07:02
Last Modified: 11 Sep 2019 07:02
URI: http://raiith.iith.ac.in/id/eprint/6182
Publisher URL: https://ieeexplore.ieee.org/abstract/document/6228...
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 6182 Statistics for this ePrint Item