메뉴 건너뛰기




Volumn 2453, Issue , 2002, Pages 731-740

Efficient evaluation of continuous range queries on moving objects

Author keywords

[No Author keywords available]

Indexed keywords

EXPERT SYSTEMS; INDEXING (OF INFORMATION);

EID: 84949787132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46146-9_72     Document Type: Conference Paper
Times cited : (54)

References (12)
  • 4
    • 24444433838 scopus 로고    scopus 로고
    • Efficient evaluation of continuous range queries on moving objects
    • Purdue University, June
    • D. V. Kalashnikov, S. Prabhakar, S. Hambrusch, and W. Aref. Efficient evaluation of continuous range queries on moving objects. In TR 02-015, Purdue University, June 2002.
    • (2002) TR 02-015
    • Kalashnikov, D.V.1    Prabhakar, S.2    Hambrusch, S.3    Aref, W.4
  • 5
    • 0034819131 scopus 로고    scopus 로고
    • Optimizing mutidimensionalindex trees for main memory access
    • Santa Barbara, CA, May
    • K. Kim, S. Cha, and K. Kwon. Optimizing mutidimensionalindex trees for main memory access. In Proc of ACM SIGMOD Conf., Santa Barbara, CA, May 2001.
    • (2001) Proc of ACM SIGMOD Conf
    • Kim, K.1    Cha, S.2    Kwon, K.3
  • 8
    • 0002412271 scopus 로고    scopus 로고
    • Novelapproac hes in query processing for moving objects
    • Cairo, Egypt, September
    • D. Pfoser, C. Jensen, and Y. Theodoridis. Novelapproac hes in query processing for moving objects. In Proc of VLDB Conf., Cairo, Egypt, September 2000.
    • (2000) Proc of VLDB Conf
    • Pfoser, D.1    Jensen, C.2    Theodoridis, Y.3
  • 10
    • 0039785294 scopus 로고    scopus 로고
    • Making B+-trees cache conscious in main memory
    • Dallas, TX, May
    • J. Rao and K. A. Ross. Making B+-trees cache conscious in main memory. In Proc of ACM SIGMOD Conf., Dallas, TX, May 2000.
    • (2000) Proc of ACM SIGMOD Conf
    • Rao, J.1    Ross, K.A.2


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