메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 121-128

Query processing for moving objects with space-time grid storage model

Author keywords

Computer science; Costs; Filtering algorithms; Information filtering; Information management; Mobile computing; Partitioning algorithms; Query processing; Vehicles; Wireless communication

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COSTS; DIGITAL STORAGE; INFORMATION MANAGEMENT; MOBILE COMPUTING; QUERY PROCESSING; SEARCH ENGINES; VEHICLES; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 74349104710     PISSN: 15516245     EISSN: None     Source Type: Journal    
DOI: 10.1109/MDM.2002.994390     Document Type: Article
Times cited : (24)

References (12)
  • 1
    • 0035789904 scopus 로고    scopus 로고
    • Using Space-Time Grid for Efficient Management of Moving Objects
    • May
    • H. Chon, D. Agrawal, and A. E. Abbadi. Using Space-Time Grid for Efficient Management of Moving Objects. In MobiDE, May 2001.
    • (2001) MobiDE
    • Chon, H.1    Agrawal, D.2    Abbadi, A.E.3
  • 6
    • 85013870884 scopus 로고
    • A Consistent Hierarchical Representation for Vector Data
    • Aug
    • R. C. Nelson and H. Samet. A Consistent Hierarchical Representation for Vector Data. In ACM SIGGRAPH, Aug. 1986.
    • (1986) ACM SIGGRAPH
    • Nelson, R.C.1    Samet, H.2
  • 8
    • 0025436383 scopus 로고
    • Skip Lists: A Probabilistic Alternative to Balanced Trees
    • W. Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. Communications of ACM, 33(6), 1990.
    • (1990) Communications of ACM , vol.33 , Issue.6
    • Pugh, W.1


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