Handling Frequent Updates of Moving Objects Using the Dynamic Non-uniform Grid
For services related with the u-LBS and u-GIS, most previous works had try to solve frequent updates as a lot of moving objects by extending traditional R-tree. In related works, however, processing for a situation occurring partial denseness of many objects is so hard because these haven’t considering the non-uniform distribution. Thus, we proposed new scheme to solve problems above by using the dynamic non-uniform grid. Due to its result of split isn’t equal, our proposed scheme can allow distributed processing locally for dense moving objects. Also it has several in-memory buffers to handle frequent updates of massively moving objects lazily.
KeywordsMoving Object Dynamic Non-uniform Grid Frequent Updates R-Tree
Unable to display preview. Download preview PDF.
- 1.Guttman, A.: R-Trees: A Dynamic Index Structure For Spatial Searching. Association for Computing Machinery (1984)Google Scholar
- 2.Lee, M.L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: Proceedings of the 29th VLDB Conference, Berlin, Germany (2003)Google Scholar
- 3.Xiong, X., Aref, W.G.: R-Trees with Update Memos, CSD TR #05-020 (2005)Google Scholar
- 4.Biveinis, L.: Towards Efficient Main Memory Use For Optimum Tree Index Update. In: PVLDB 2008, Auckland, New Zealand, pp. 23–28 (2008)Google Scholar