Skip to main content
SpringerLink
Log in

Handling Frequent Updates of Moving Objects Using the Dynamic Non-uniform Grid

  • Conference paper
Multimedia, Computer Graphics and Broadcasting (MulGraB 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 263))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Medical IT and Marketing, Eulji University, 553, Sanseong-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, 461-713, Korea

    Ki-Young Lee, Chae-Gyun Lim, Myung-Jae Lim & Kyu-Ho Kim

  2. Department of Information and Comminication, Dong Seoul University, 76, Bokjeong-ro, Sujeong-gu, Seongnam-si, Gyeonggi-do, 461-714, Korea

    Jeong-Jin Kang

  3. Division of Computer Science and Engineering, Konkuk University, 1, Hwayang-dong, Gwangjin-gu, Seoul, 143-701, Korea

    Joung-Joon Kim

  4. Department of Biomedical Engineering, Eulji University, 553, Sanseong-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, 461-713, Korea

    Jeong-Lae Kim

Authors
  1. Ki-Young Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeong-Jin Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joung-Joon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chae-Gyun Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Myung-Jae Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Kyu-Ho Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Jeong-Lae Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Multimedia Engineering Department, Hannam University, 133 Ojeong-dong, Daeduk-gu, Daejeon, Korea

    Tai-hoon Kim

  2. The Ohio State University, 470 Hitchcock Hall, 2070 Neil Avenue, 43210-1275, Columbus, OH, USA

    Hojjat Adeli

  3. Department of Computer and Information Science, University of Michigan – Dearborn, 4901 Evergreen Road, 48128, Dearborn, MI, USA

    William I. Grosky

  4. Florida International University, EC 2910, 10555 W. Flagler Street, 33174, Miami, FL, USA

    Niki Pissinou

  5. National Taipei University of Education, No.134, Sec. 2, Heping E. Rd., Da-an District, 106, Taipei City, Taiwan (R.O.C.)

    Timothy K. Shih

  6. Michigan State University, 48824-1226, East Lansing, MI, USA

    Edward J. Rothwell

  7. School of Computing and Information Systems, University of Tasmania, Hobart, TAS, Australia

    Byeong-Ho Kang

  8. Dept of IT, Hansei University, 604-5, Dangjung-Dong, Gunpo-Si, Gyunggi-Do, Korea

    Seung-Jung Shin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, KY. et al. (2011). Handling Frequent Updates of Moving Objects Using the Dynamic Non-uniform Grid. In: Kim, Th., et al. Multimedia, Computer Graphics and Broadcasting. MulGraB 2011. Communications in Computer and Information Science, vol 263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27186-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27186-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27185-4

  • Online ISBN: 978-3-642-27186-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation