An efficient indexing scheme for multi-dimensional moving objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2572, Issue , 2003, Pages 425-439

  Elbassioni, Khaled ^a   Elmasry, Amr ^a   Kamel, Ibrahim ^b  

^a Alexandria University Faculty Of Science   (Egypt)

^b ZAYED UNIVERSITY   (United Arab Emirates)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION);

AVERAGE SEARCH TIME; D-DIMENSIONAL SPACES; DISJOINT REGIONS; INDEXING SCHEME; LINEAR TRAJECTORY; MOVING OBJECTS; MULTI DIMENSIONAL; TIME INTERVAL;

QUERY PROCESSING;

EID: 35248869611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36285-1_28     Document Type: Article

References (19)

1. P. K. Agarwal, L. Arge and J. Erickson, Indexing Moving points. In Proc. 19th ACM PODS, pp. 175-186, 2000.
2. P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa and J. S. Vitter, Efficient Searching with Linear Constraints. In Proc. 17th ACM PODS , pp. 169-178, 1998.
3. R. Alonso and H. F. Korth, Database System Issues in Nomadic Computing. In Proc. ACM-SIGMOD International Conference on Management of Data , pp. 388-392, 1993.
4. A. Aggarwal and J. S. Vitter, The Input/Output Complexity of Sorting and Related Problems. In Communications of the ACM, 31(9):1116-1127, 1988.
5. N. Beckmann, H.-P. Kriegel, R. Schneider and B. Seeger, The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In Proc. ACM-SIGMOD, pp. 322-331, 1990.
6. M. Cai, D. Keshwani and P. Z. Revesz, Parametric rectangles: A model for querying and animating spatiotemporal databases. In Proc. 7th International Conference on Extending Database Technology, LNCS 1777, pp. 430-444. Springer, 2000.
7. S. Chamberlain, Model-based battle command: A paradigm whose time has come. In Proc. 1st International Symposium on Command and Control Research and Technology, pp. 31-38, 1995.
8. B. Chazelle and B. Rosenberg, Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. In Proc. 19th International Colloquium on Automata, Languages and Programming, LNCS, Vol. 693, 1992.
9. d using BBS-trees. In Proc. 14th Canadian Conference on Computational Geometry (CCCG 2002), pp. 54-57, 2002.
10. J. Goldstein, R. Ramakrishnan, U. Shaft and J. B. Yu, Processing Queries by Linear Constraints. In Proc. 16th ACM PODS, pp. 257-267, 1997.
11. A. Guttman, R-trees: A Dynamic Index Structure for Spatial Searching. In Proc. ACM-SIGMOD, pp. 47-57, 1984.
12. G. Kollios, D. Gunopulos and V. Tsotras, On Indexing Mobile Objects. In Proc. 18th ACM PODS, pp. 261-272, 1999.
13. H. V. Jagadish, On Indexing Line Segments. In Proc. 16th VLDB Conference , pp. 614-625, 1990.
14. I. Kamel and C. Faloutsos, On Packing R-trees. In Proc. Second International Conference on Information and Knowledge Management, 1993.
15. J. Matoušek, Efficient Partition Trees. Disc. and Computational Geometry, 8 (1992), pp. 432-448.
16. S. Šaltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, Indexing the Positions of Continuously Moving Objects. In Proc. ACM-SIGMOD, pp. 331-342, 2000.
17. A. Schrijver. Theory of Linear and Integer Programming, Wiley-Interscience, 1986.
18. A. P. Sistla, O. Wolfson, S. Chamberlain and S. Dao, Modeling and Querying Moving Objects. In Proc. 13th IEEE ICDE Conference, pp. 422-432, April 1997.
19. J. Tayeb, O. Ulusoy and O. Wolfson, A quadtree-Based Dynamic Attribute Indexing Method. The Computer Journal, 41(3):185-200, 1998.