References
- R. Ding, X. Meng, and Y. Bai, 'Efficient index update for moving objects with future trajectories,' Proc. Eighth International Conference on Database Systems for Advanced Applications, pp.183-194, 2003 https://doi.org/10.1109/DASFAA.2003.1192382
- A. Guttman, 'R-trees : A dynamic index structure for spatial searching,' Proc. ACM SIGMOD Conference, pp. 47-57, 1984 https://doi.org/10.1145/602259.602266
- D. S. Kwon, S. J. Lee, and S. H. Lee, 'Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree,' Proc. International Conference on Mobile Data Management, pp.113-120, 2002 https://doi.org/10.1109/MDM.2002.994387
- S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch, 'Query indexing and velocity constrained indexing : scalable techniques for continuous queries on moving objects,' IEEE Transactions on Computers, Vol.51, No.10, pp.1124-1140, 2002 https://doi.org/10.1109/TC.2002.1039840
- S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, 'Indexing the Positions of Continuously Moving Objects,' Proc. ACM SIGMOD Conference, pp.331-342, 2000 https://doi.org/10.1145/342009.335427
- A. Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' In Proceedings of ACM SIGMOD International Conference on Management of Data, pp.47-57, Jun., 1984 https://doi.org/10.1145/602259.602266
- X. Yuni and S. Prabhakar, 'Q+Rtree : Efficient Indexing for Moving Object Database,' Proc. Eighth International Conference on Database Systems for Advanced Applications, pp. 175-182, 2003 https://doi.org/10.1109/DASFAA.2003.1192381
- O. Ratko and Y. Byunggu, 'Implementing KDB-Trees to support High-Dimensional Data,' Proc. International Database Engineering and Applications Symposium, pp. 58-67, 2001 https://doi.org/10.1109/IDEAS.2001.938071
- A. Henrich, H. S. Six, and P. Widmayer, 'The LSD-tree : Spatial Access to Multidimensional Point and Non-point Objects,' Proc. International Conference on Very Large Data Bases, pp. 45-53, 1989
- J. M. Hellerstein, J. F. Naughton, and A. Pfeffer, 'Generalized Search Trees for Database Systems,' Proc. International Conference on Very Large Data Bases, pp. 562-573, 1995
- N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, 'The R*-tree : An Efficient and Robust Access Method for Points and Rectangles,' Proc. ACM SIGMOD Conference, pp. 322-331, 1990
- J. Basch, L. J. Guibas, and J. Hershberger, 'Data Structures for Mobile Data,' Proc. Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 747-756, 1997
- H. Chon, D. Agrawal, and A. Abbadi, 'Using Space-Time Grid for Efficient Management of Moving Objects,' Proc. International ACM Workshop on Data Engineering for Wireless and Mobile Access, pp. 59-65, 2001 https://doi.org/10.1145/376868.376899
- C. Procopiuc, P. Agarwal, and S. Har-Peled, 'STAR-Tree : An Efficient Self-Adjusting Index for Moving Objects,' 4th International Workshop of Algorithm Engineering and Experimentation, pp. 178-194, 2002
- B. C. Ooi, K. L. Tan, and C. Yu, 'Frequent Update and Efficient Retrieval : an Oxymoron on Moving Object Indexes?,' Proc. 3rd International Conference on Web Information Systems Engineering Workshops, pp. 3-12, 2002 https://doi.org/10.1109/WISEW.2002.1177841
- M. L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Kenglik, 'Supporting Frequent Updates in R-Trees : A Bottom-Up Approach,' Proc. 29th International Conference on Very Large Data Bases, pp. 608-619, 2003