Primal or dual: Which promises faster spatiotemporal search?

VLDB Journal

Volumn 17, Issue 5, 2008, Pages 1253-1270

  Tao, Yufei ^a   Xiao, Xiaokui ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Moving objects; Range search; Spatial database; Theory

Indexed keywords

EID: 46749139974     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-007-0064-z     Document Type: Article

References (22)

1. Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. In: PODS, pp. 175-186 (2000)
2. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322-331 (1990)
3. Benetis, R., Jensen, C.S., Karciauskas, G., Salteni, S.: Nearest and reverse nearest neighbor queries for moving objects. To appear in VLDB Journal
4. Berchtold, S., Bohm, C., Keim, D.A., Kriegel, H.-P.: A cost model for nearest neighbor search in high-dimensional data space. In: PODS, pp. 78-86 (1997)
5. Bruno, N., Chaudhuri, S., Gravano, L.: Stholes: a multidimensional workload-aware histogram. In: SIGMOD, pp. 211-222 (2001)
6. Elbassioni, K.M., Elmasry, A., Kamel, I.: An efficient indexing scheme for multi-dimensional moving objects. In: ICDT, pp. 425-439 (2003)
7. Goldstein, J., Ramakrishnan, R., Shaft, U., Yu, J.-B.: Processing queries by linear constraints. In: PODS, pp. 257-267 (1997)
8. Hellerstein, J.M., Koutsoupias, E., Papadimitriou, C.H.: On the analysis of indexing schemes. In: PODS, pp. 249-256 (1997)
9. Hjaltason G.R. and Samet H. (1999). Distance browsing in spatial databases. TODS 24(2): 265-318
10. Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD, pp. 479-490 (2005)
11. Jensen, C.S., Lin, D., Ooi, B.C.: Query and update efficient B+-tree based indexing of moving objects. In: VLDB, pp. 768-779 (2004)
12. Kollios, G., Gunopulos, D., Tsotras, V.J.: On indexing mobile objects. In: PODS, pp. 261-272 (1999)
13. Kollios G., Papadopoulos D., Gunopulos D. and Tsotras J. (2005). Indexing mobile objects using dual transformations. The VLDB Journal 14(2): 238-256
14. Lee, M.-L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in r-trees: a bottom-up approach. In: VLDB, pp. 608-619 (2003)
15. Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an analysis of range query performance in spatial data structures. In: PODS, pp. 214-221 (1993)
16. Patel, J.M., Chen, Y., Chakka, V.P.: Stripes: an efficient index for predicted trajectories. In: SIGMOD, pp. 637-646 (2004)
17. Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: SIGMOD, pp. 331-342 (2000)
18. Tao, Y., Papadias, D., Sun, J.: The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In: VLDB, pp. 790-801 (2003)
19. Tao Y., Sun J. and Papadias D. (2003). Analysis of predictive spatio- temporal queries. TODS 28(4): 295-336
20. Theodoridis, Y., Sellis, T.: A model for the prediction of R-tree performance. In: PODS, pp. 161-171 (1996)
21. Xiong, X., Aref, W.G.: R-trees with update memos. In: ICDE (2006)
22. dual -tree: indexing moving objects by space-filling curves in the dual space. To appear in VLDB Journal