CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Survey on Spatio-Temporal Access Methods

by K. Appathurai, S. Karthikeyan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 18 - Number 4
Year of Publication: 2011
Authors: K. Appathurai, S. Karthikeyan
10.5120/2270-2925

K. Appathurai, S. Karthikeyan . A Survey on Spatio-Temporal Access Methods. International Journal of Computer Applications. 18, 4 ( March 2011), 40-42. DOI=10.5120/2270-2925

@article{ 10.5120/2270-2925,
author = { K. Appathurai, S. Karthikeyan },
title = { A Survey on Spatio-Temporal Access Methods },
journal = { International Journal of Computer Applications },
issue_date = { March 2011 },
volume = { 18 },
number = { 4 },
month = { March },
year = { 2011 },
issn = { 0975-8887 },
pages = { 40-42 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume18/number4/2270-2925/ },
doi = { 10.5120/2270-2925 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:05:27.191297+05:30
%A K. Appathurai
%A S. Karthikeyan
%T A Survey on Spatio-Temporal Access Methods
%J International Journal of Computer Applications
%@ 0975-8887
%V 18
%N 4
%P 40-42
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Nowadays many new indexing structures are introduced for spatiotemporal access metods. Spatiotemporal access methods are classified into four categories: (1) Indexing the past data, (2) Indexing the current data, (3) Indexing the future data, and (4) Indexing data at all points of time. In this short survey we consider the 4th category, in that survey mainly deals with the comparative analysis of BBx – index, PCFI+ index and RPPF – TREE

References
  1. Long-Van Nguyen-Dinh, Walid G. Aref, Mohamed F. Mokbel 2010. Spatio-Temporal Access Methods: Part 2 (2003 - 2010). Bulletin of the IEEE Computer Society Technical Committee on Data Engineering
  2. M. Pelanis, S. ˇ Saltenis, and C. Jensen. Indexing the past, present, and anticipated future positions of moving objects.TODS, 31(1):255–298, 2006.
  3. 3) Z.-H. Liu, X.-L. Liu, J.-W. Ge, and H.-Y. Bae. Indexing large moving objects from past to future with PCFI+-index. In COMAD, pages 131–137, 2005.
  4. V. Chakka, A. Everspaugh, and J. Patel. Indexing large trajectory data sets with SETI. In CIDR, 2003
  5. Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In VLDB, 2003.
  6. D. Lin, C. Jensen, B. Ooi, and S. ˇ Saltenis. Efficient indexing of the historical, present, and future positions of moving objects. In MDM, pages 59–66, 2005.
  7. 7) C. Jensen, D. Lin, and B. Ooi. Query and update efficient B+-tree based indexing of moving objects. In VLDB, 2004.
  8. M. Mokbel, T. Ghanem, andW. G. Aref. Spatio-temporal access methods. IEEE Data Eng. Bull., 26(2):40–49, 2003.
  9. J. Ni and C. V. Ravishankar. PA-tree: A parametric indexing scheme for spatio-temporal trajectories. In SSTD, 2005.
  10. P. Zhou, D. Zhang, B. Salzberg, G. Cooperman, and G. Kollios. Close pair queries in moving object databases. In GIS, pages 2–11, 2005.
  11. S. Chen, B. Ooi, K. Tan, and M. Nascimento. ST2B-tree: A self-tunable spatio-temporal B+- tree index for moving objects. In SIGMOD, pages 29–42, 2008.
  12. P. K. Agarwal and C. M. Procopiuc. Advances in Indexing for Mobile Objects. IEEE Data Eng. Bull., 25(2): 25–34, 2002.
  13. G. Kollios, D. Gunopulos, V. J. Tsotras. On Indexing Mobile Objects. In Proc. PODS, pp. 261–272, 1999.
Index Terms

Computer Science
Information Sciences

Keywords

Index query access methods insertion method

Powered by PhDFocusTM