Article: Approximate spatio-temporal retrieval

File Download Links for fulltext
(May Require Subscription)
Supplementary
  • Basic View
  • Metadata View
  • XML View
TitleApproximate spatio-temporal retrieval
AuthorsPapadias, D2
Mamoulis, N1
Delis, V3
KeywordsH.2.2 [Database Management]: Physical Design - Access Methods
H.2.4 [Database Management]: Systems - Multimedia Databases
H.2.8 [Database Management]: Database Applications - Spatial Databases And Gis
Issue Date2001
CitationAcm Transactions On Information Systems, 2001, v. 19 n. 1, p. 53-96 [How to Cite?]
AbstractThis 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, which retrieve configurations matching a particular spatio-temporal structure, and (iv) special cases of motion queries. Considering the current large availability of multidimensional data and the increasing need for flexible query-answering mechanisms, our techniques can be used as the core of spatio-temporal query processors. © 2001 ACM.
ISSN1046-8188
2011 Impact Factor: 1.077
2011 SCImago Journal Rankings: 0.068
ReferencesReferences in Scopus
DC Field
Value
dc.contributor.authorPapadias, D
dc.contributor.authorMamoulis, N
dc.contributor.authorDelis, V
dc.date.accessioned2012-06-26T06:37:00Z
dc.date.available2012-06-26T06:37:00Z
dc.date.issued2001
dc.description.abstractThis 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, which retrieve configurations matching a particular spatio-temporal structure, and (iv) special cases of motion queries. Considering the current large availability of multidimensional data and the increasing need for flexible query-answering mechanisms, our techniques can be used as the core of spatio-temporal query processors. © 2001 ACM.
dc.description.natureLink_to_subscribed_fulltext
dc.identifier.citationAcm Transactions On Information Systems, 2001, v. 19 n. 1, p. 53-96 [How to Cite?]
dc.identifier.epage96
dc.identifier.issn1046-8188
2011 Impact Factor: 1.077
2011 SCImago Journal Rankings: 0.068
dc.identifier.issue1
dc.identifier.scopuseid_2-s2.0-0038895731
dc.identifier.spage53
dc.identifier.urihttp://hdl.handle.net/10722/152296
dc.identifier.volume19
dc.languageeng
dc.publisher.placeUnited States
dc.relation.ispartofACM Transactions on Information Systems
dc.relation.referencesReferences in Scopus
dc.subjectH.2.2 [Database Management]: Physical Design - Access Methods
dc.subjectH.2.4 [Database Management]: Systems - Multimedia Databases
dc.subjectH.2.8 [Database Management]: Database Applications - Spatial Databases And Gis
dc.titleApproximate spatio-temporal retrieval
dc.typeArticle
Author Affiliations
  1. Centrum voor Wiskunde en Informatica
  2. Hong Kong University of Science and Technology
  3. Panepistimion Patron