Abstract
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory index structure for processing trajectory and time slice queries. Efficient processing of trajectory queries requires parallel processing based on indexes and parallel access methods for the trajectory index. Several heuristic methods have been developed to decluster R-tree nodes of spatial data over multiple disks to obtain high performance for disk accesses. However, trajectory data is different from two-dimensional spatial data because of peculiarities of the temporal dimension and the connectivity of the trajectory. In this paper, we propose a declustering policy based on spatio-temporal trajectory proximity. Extensive experiments show that our STP scheme is better than other declustering schemes by about 20%.
This work was supported by grant No. (R05 -2003-000-10360-0) from the Basic Research Program of the Korea Science and Engineering Foundation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Frank, A.U., Winter, S.: CHOROCHRONOS Consortium. In: First CHOROCHRONOS Intensive Workshop CIW 1997, TECHNICAL REPORT CH-97-02
Schnitzer, B., Leutenegger, S.T.: Master-Client R-Trees: A New Parallel RTree Architecture. In: SSDBM 1999, pp. 68–77 (1999)
Seeger, B., Larson, P.-A.: Multi-disk btrees. In: Proc. ACM SIGMOD, May 1991, pp. 138–147 (1991)
Brinkhoff, T.: Generating Traffic Data. Bulletin of the Technical Committee on Data Engineering 26(2), 19–25 (2003)
Kamel, I., Faloutsos, C.: Parallel R-trees. In: ACM SIGMOD 1992, pp. 195–204 (1992)
Kamel, I., Faloutsos, C.: On Packing R-trees. In: CIKM, pp. 490–499 (1993)
Pramanik, S., Kim, M.H.: Parallel processing of large node b-trees. IEEE Transactions on Computers 39(9), 1208–1212 (1990)
Pfsor, D., Theodoridis, Y., Jensen, C.S.: Indexing Trajectories of Moving Point Objects. Chorochoronos TR CH-99-03
Sellis, T.: Research Issues in Spatio-temporal Database Systems. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 5–11. Springer, Heidelberg (1999)
Kouramajian, V., Elmasri, R., Chaudhry, A.: Declustering Techniques for Parallelizing Temporal Access Structures. In: IEEE ICDE 1994, pp. 232–242 (1994)
Theodoridis, Y., Vazirgiannis, M., Sellis, T.: Spatio-Temporal Indexing for Large Multimedia Applications. In: Proceedings, IEEE ICMCS 1996, pp. 441–448 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seo, Y., Hong, B. (2004). Declustering of Trajectories for Indexing of Moving Objects Databases. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2004. Lecture Notes in Computer Science, vol 3180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30075-5_80
Download citation
DOI: https://doi.org/10.1007/978-3-540-30075-5_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22936-0
Online ISBN: 978-3-540-30075-5
eBook Packages: Springer Book Archive