Querying mobile objects in spatio-temporal databases

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

Volumn 2121, Issue , 2001, Pages 59-78

  Porkaew, Kriengkrai ^a   Lazaridis, Iosif ^b   Mehrotra, Sharad ^b  

^a KING MONGKUT'S UNIVERSITY OF TECHNOLOGY THONBURI   (Thailand)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INDEXING (OF INFORMATION); QUERY PROCESSING;

INDEXING TECHNIQUES; MOBILE ENVIRONMENTS; PARAMETRIC SPACES; PERFORMANCE STUDY; QUERY PROCESSING ALGORITHMS; QUERY PROCESSING TECHNIQUES; SPATIO-TEMPORAL DATABASE; SPATIO-TEMPORAL ENVIRONMENT;

INDEXING (MATERIALS WORKING);

EID: 84944077469     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47724-1_4     Document Type: Conference Paper

References (18)

1. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion b-tree. VLDB Journal, 5(4):264–275, 1996.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In ACM SIGMOD Int’l Conf. on Management of Data, pages 322–331, May 1990.
3. A. Guttman. R-tree: a dynamic index structure for spatial searching. In ACM SIGMOD Int’l Conf. on Management of Data, pages 47–57, June 1984.
4. G. R. Hjaltason and H. Samet. Ranking in spatial databases. In Int’l Symposium on Large Spatial Databases, 1995.
5. G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects. In Symposium on Principles of Database Systems, 1999.
6. D. Lomet and B. Salzberg. The hB-Tree: A multiattribute indexing method with good guaranteed performance. ACM Trans. on Database Systems, 15(4):625–658, 1990.
7. D. Lomet and B. Salzberg. The performance of a multiversion access method. In ACM SIGMOD Int’l Conf. on Management of Data, 1990.
8. J. A. Orenstein. A comparison of spatial query processing techniques for native and parameter spaces. In ACM SIGMOD Int’l Conf. on Management of Data, pages 343–352, 1990.
9. K. Porkaew. Database support for similarity retrieval and querying mobile objects. Technical report, PhD thesis, University of Illinois at Urbana-Champaign, 2000.
10. J. T. Robinson. The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In ACM SIGMOD Int’l Conf. on Management of Data, 1981.
11. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In ACM SIGMOD Int’l Conf. on Management of Data, 1995.
12. S. Saltenis, C. Jensen, S. Leutenegger, and M. Lopez. Indexing the positions of continuously moving objects. In ACM SIGMOD Int’l Conf. on Management of Data, 2000.
13. B. Salzberg and V. Tsotras. Comparison of access methods for time-evolving data. ACM Computing Surveys, 31(2):158–221, 1999.
14. H. Samet. The quadtree and related hierarchial data structures. ACM Computing Surveys, 16(2):187–260, 1984.
15. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+ tree: A dynamic index for multi-dimensional objects. In Int’l Conf. on Very Large Data Bases, 1987.
16. J. Tayeb, O. Ulusoy, and O. Wolfson. A quadtree based dynamic attribute indexing method. Computer Journal, 41(3):185–200, 1998.
17. Y. Theodoridis, T. Sellis, A. N. Papadopoulos, and Y. Manolopoulos. Specifications for efficient indexing in spatiotemporal databases. In Int’l Conf. on Scientific and Statistical Database Management, pages 123–132, 1998.
18. O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving objects databases: Issues and solutions. In Int’l Conf. on Scientific and Statistical Database Management, pages 111–122, 1998.