File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Validity information retrieval for spatio-temporal queries: Theoretical performance bounds

TitleValidity information retrieval for spatio-temporal queries: Theoretical performance bounds
Authors
Issue Date2003
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2003, v. 2750, p. 159-178 How to Cite?
Abstract
The results of traditional spatial queries (i.e., range search, nearest neighbor, etc.) are usually meaningless in spatio-temporal applications, because they will be invalidated by the movements of query and/or data objects. In practice, a query result R should be accompanied with validity information specifying (i) the (future) time T that R will expire, and (ii) the change C of R at time T (so that R can be updated incrementally). Although several algorithms have been proposed for this problem, their worst-case performance is the same as that of sequential scan. This paper presents the first theoretical study on validity queries, and develops indexes and algorithms with attractive I/O complexities. Our discussion covers numerous important variations of the problem and different query/object mobility combinations. The solutions involve a set of non-trivial reductions that reveal the problem characteristics and permit the deployment of existing structures. © Springer-Verlag Berlin Heidelberg 2003.
Persistent Identifierhttp://hdl.handle.net/10722/93044
ISSN
2013 SCImago Journal Rankings: 0.310
References

 

Author Affiliations
  1. The University of Hong Kong
  2. Carnegie Mellon University
  3. Hong Kong University of Science and Technology
DC FieldValueLanguage
dc.contributor.authorTao, Yen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorPapadias, Den_HK
dc.date.accessioned2010-09-25T14:49:11Z-
dc.date.available2010-09-25T14:49:11Z-
dc.date.issued2003en_HK
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2003, v. 2750, p. 159-178en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93044-
dc.description.abstractThe results of traditional spatial queries (i.e., range search, nearest neighbor, etc.) are usually meaningless in spatio-temporal applications, because they will be invalidated by the movements of query and/or data objects. In practice, a query result R should be accompanied with validity information specifying (i) the (future) time T that R will expire, and (ii) the change C of R at time T (so that R can be updated incrementally). Although several algorithms have been proposed for this problem, their worst-case performance is the same as that of sequential scan. This paper presents the first theoretical study on validity queries, and develops indexes and algorithms with attractive I/O complexities. Our discussion covers numerous important variations of the problem and different query/object mobility combinations. The solutions involve a set of non-trivial reductions that reveal the problem characteristics and permit the deployment of existing structures. © Springer-Verlag Berlin Heidelberg 2003.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_HK
dc.titleValidity information retrieval for spatio-temporal queries: Theoretical performance boundsen_HK
dc.typeArticleen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-35248828180en_HK
dc.identifier.hkuros81300en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-35248828180&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2750en_HK
dc.identifier.spage159en_HK
dc.identifier.epage178en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridTao, Y=7402420191en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridPapadias, D=7005757795en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats