Spatial Index Compression for Location-Based Services Based on a MBR Semi-approximation Scheme (original) (raw)

Abstract

The increased need for spatial data for location-based services or geographical information systems (GISs) in mobile computing has led to more research on spatial indexing, such as R-tree. The R-tree variants approximate spatial data to a minimal bounding rectangle (MBR). Most studies are based on adding or changing various options in R-tree, while a few studies have focused on increasing search performance via MBR compression. This study proposes a novel MBR compression scheme that uses semi-approximation (SA) MBRs and SAR-tree. Since SA decreases the size of MBR keys, halves QMBR enlargement, and increases node utilization, it improves the overall search performance. This scheme decreases quantized space more than existing quantization schemes do, and increases the utilization of each disk allocation unit. This study mathematically analyzes the number of node accesses and evaluates the performance of SAR-tree using real location data. The results show that the proposed index performs better than existing MBR compression schemes.

This work was supported by the Korea Research Foundation Grant funded by the Korea Government(MOEHRD) (KRF-2005-041-D00665).

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Schiller, J., Voisard, A.: Location-Based Services. Elsevier, Morgan Kaufmann (2004)
    Google Scholar
  2. Wu, S.Y., Wu, K.T.: Dynamic Data Management for Location Based Services in Mobile Environments. IDEAS, 180–191 (2003)
    Google Scholar
  3. Kim, J.-D., Moon, S.-H., Choi, J.-O.: A spatial index using MBR compression and hashing technique for mobile map service. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 625–636. Springer, Heidelberg (2005)
    Chapter Google Scholar
  4. Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD Int. Conf. on Management of Data, pp. 47–57 (1984)
    Google Scholar
  5. Kim, K.H., Cha, S.K., Kwon, K.J.: Optimizing Multidimensional Index trees for Main Memory Access. In: Int. Conf. on ACM SIGMD, pp. 139–150 (2001)
    Google Scholar
  6. Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: Spatial indexing of high-dimensional data based on relative approximation. VLDB J., 93–108 (2002)
    Google Scholar
  7. Goldstein, J., Ramakrishnan, R., Shaft, U.: Compressing Relations and Indexes. In: Proceedings of IEEE Conference on Data Engineering, pp. 370–379 (1998)
    Google Scholar
  8. The R-tree Portal, http://www.rtreeportal.org
  9. Schwetman, H.: CSIM19: A Powerful Tool for Building System Models. In: Proceedings of the 2001 Winter Simulation Conference, pp. 250–255 (2001)
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Korea University, Seoul, Korea
    Jongwan Kim, SeokJin Im, Sang-Won Kang & Chong-Sun Hwang

Authors

  1. Jongwan Kim
  2. SeokJin Im
  3. Sang-Won Kang
  4. Chong-Sun Hwang

Editor information

Editors and Affiliations

  1. Chinese University of Hong Kong, Hong Kong, China
    Jeffrey Xu Yu
  2. Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, 153-8505, Tokyo, Japan
    Masaru Kitsuregawa
  3. Department of Computing, Hong Kong Polytechnic University, Hong Kong
    Hong Va Leong

Rights and permissions

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, J., Im, S., Kang, SW., Hwang, CS. (2006). Spatial Index Compression for Location-Based Services Based on a MBR Semi-approximation Scheme. In: Yu, J.X., Kitsuregawa, M., Leong, H.V. (eds) Advances in Web-Age Information Management. WAIM 2006. Lecture Notes in Computer Science, vol 4016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775300\_3

Download citation

Publish with us