메뉴 건너뛰기




Volumn 3453, Issue , 2005, Pages 600-611

Towards optimal utilization of main memory for moving object indexing

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; INDEXING (OF INFORMATION); INFORMATION MANAGEMENT; INFORMATION RETRIEVAL;

EID: 24644511315     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11408079_56     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 1
    • 74349104710 scopus 로고    scopus 로고
    • Query processing for moving objects with space-time grid storage model
    • H. D. Chon, D. Agrawal, and A. El Abbadi. Query processing for moving objects with space-time grid storage model. In Proc. MDM, pages 121-128, 2002.
    • (2002) Proc. MDM , pp. 121-128
    • Chon, H.D.1    Agrawal, D.2    El Abbadi, A.3
  • 3
    • 84941153196 scopus 로고    scopus 로고
    • GHOST: Fine granularity buffering of index
    • C. H. Goh, B. C. Ooi, D. Sim, and K. L. Tan. GHOST: Fine granularity buffering of index. In Proc. VLDB, pages 339-350, 1999.
    • (1999) Proc. VLDB , pp. 339-350
    • Goh, C.H.1    Ooi, B.C.2    Sim, D.3    Tan, K.L.4
  • 4
    • 84983469675 scopus 로고    scopus 로고
    • Query and update efficient B+-Tree based indexing of moving objects
    • C. S. Jensen, D. Lin, and B. C. Ooi. Query and update efficient B+-Tree based indexing of moving objects. In Proc. VLDB, 2004.
    • (2004) Proc. VLDB
    • Jensen, C.S.1    Lin, D.2    Ooi, B.C.3
  • 6
    • 84948448303 scopus 로고    scopus 로고
    • Index the current positions of moving objects using the lazy update R-tree
    • D. K won, S. J. Lee, and S. H. Lee. Index the current positions of moving objects using the lazy update R-tree. In MDM, pages 113-120, 2002.
    • (2002) MDM , pp. 113-120
    • Won, D.K.1    Lee, S.J.2    Lee, S.H.3
  • 7
    • 85012191028 scopus 로고    scopus 로고
    • Supporting frequent updates in R-Trees: A bottom-up approach
    • M. L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Teo. Supporting frequent updates in R-Trees: A bottom-up approach. In Proc. VLDB, pages 608-619, 2003.
    • (2003) Proc. VLDB , pp. 608-619
    • Lee, M.L.1    Hsu, W.2    Jensen, C.S.3    Cui, B.4    Teo, K.L.5
  • 8
    • 3142783648 scopus 로고    scopus 로고
    • Stripes: An efficient index for predicted trajectories
    • J. M. Patel, Y. Chen, and V. P. Chakka. Stripes: An efficient index for predicted trajectories. In Proc. ACM SIGMOD, pages 637-646, 2004.
    • (2004) Proc. ACM SIGMOD , pp. 637-646
    • Patel, J.M.1    Chen, Y.2    Chakka, V.P.3
  • 9
    • 0346374710 scopus 로고
    • Index access with a finite buffer
    • G. M. Sacco. Index access with a finite buffer. In Proc. VLDB, pages 301-309, 1987.
    • (1987) Proc. VLDB , pp. 301-309
    • Sacco, G.M.1
  • 11
    • 84944039336 scopus 로고    scopus 로고
    • Hashing moving objects
    • Z. Song and N. Roussopoulos. Hashing moving objects. In Proc. MDM, pages 161-172, 2001.
    • (2001) Proc. MDM , pp. 161-172
    • Song, Z.1    Roussopoulos, N.2
  • 12
    • 85009167046 scopus 로고    scopus 로고
    • The TPR*-Tree: An optimized spatiotemporal access method for predictive queries
    • Y. Tao, D. Papadias, and Jimeng Sun. The TPR*-Tree: An optimized spatiotemporal access method for predictive queries. In Proc. VLDB, pages 790-801, 2003.
    • (2003) Proc. VLDB , pp. 790-801
    • Tao, Y.1    Papadias, D.2    Sun, J.3
  • 13
    • 84943380080 scopus 로고    scopus 로고
    • Q+Rtree: Efficient indexing for moving object databases
    • Y. Xia and S. Prabhakar. Q+Rtree: Efficient indexing for moving object databases. In Proc. DASFAA, pages 175-182, 2003.
    • (2003) Proc. DASFAA , pp. 175-182
    • Xia, Y.1    Prabhakar, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.