A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval

dc.contributor.author	George, L	en
dc.contributor.author	Lorentzos, N	en
dc.contributor.author	Spyros, S	en
dc.contributor.author	Evaggelos, T	en
dc.date.accessioned	2014-06-06T06:48:15Z
dc.date.available	2014-06-06T06:48:15Z
dc.date.issued	2008	en
dc.identifier.uri	http://dx.doi.org/10.1145/1815933.1815936	en
dc.identifier.uri	http://62.217.125.90/xmlui/handle/123456789/4043
dc.subject	Data Structure	en
dc.subject	Efficient Implementation	en
dc.subject	Index Structure	en
dc.subject	Indexation	en
dc.subject	Temporal Constraints	en
dc.subject	Temporal Pattern	en
dc.title	A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/1815933.1815936	en
heal.publicationDate	2008	en
heal.abstract	The paper is concerned with the time efficient processing of spatiotemporal predicates, i.e. spatial predicates associated with an exact temporal constraint. A set of such predicates forms a buffer query or a Spatio-temporal Pattern (STP) Query with time. In the more general case of an STP query, the temporal dimension is introduced via the relative order of the spatial predicates	en
heal.journalName	Sigmod Record	en
dc.identifier.doi	10.1145/1815933.1815936	en