HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Journal/Magazine Articles >

Please use this identifier to cite or link to this item:
Title: Approximate spatio-temporal retrieval
Authors: Papadias, Dimitris
Mamoulis, Nikos
Delis, Vasilis
Keywords: Spatio-temporal queries
Relation similarity
Issue Date: 2001
Citation: ACM transactions on information systems (TOIS), vol. 19, no. 1, p. 53-93, 2001
Abstract: This paper proposes a framework for the handling of spatio-temporal queries with inexact matches, using the concept of relation similarity. We initially describe a binary string encoding for 1D relations that permits the automatic derivation of similarity measures. We then extend this model to various granularity levels and many dimensions, and show that reasoning on spatio-temporal structure is significantly facilitated in the new framework. Finally, we provide algorithms and optimization methods for four types of queries: (i) object retrieval based on some spatio-temporal relations with respect to a reference object, (ii) spatial joins, i.e., retrieval of object pairs that satisfy some input relation, (iii) structural queries, that retrieve configurations matching a particular spatio-temporal structure and (iv) special cases of motion queries. Considering the current large availability of multi-dimensional data and the increasing need for flexible query answering mechanisms, our techniques can be used as the core of spatio-temporal query processors.
Rights: © ACM, 2001. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Information Systems (TOIS) vol. 19 (1), pp. 53-93, 2001
Appears in Collections:CSE Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
TOIS99revised5.pdfpre-published version498KbAdobe PDFView/Open

Find published version via OpenURL Link Resolver

All items in this Repository are protected by copyright, with all rights reserved.