QMBRi: Inverse quantization of minimum bounding rectangles for spatial data compression

Authors

  • Jongwan Kim Department of Management Information Systems, Sahmyook University, Seoul
  • Dukshin Oh Department of Management Information Systems, Sahmyook University, Seoul
  • Keecheon Kim Department of Computer Science and Engineering, Konkuk University, Seoul

Keywords:

Spatial data, spatial-data compression, MBR, RMBR, HMBR, QMBR

Abstract

In this paper, we propose QMBRi, the inverse representation of the quantized minimum bounding rectangles (MBRs) scheme, which compresses a minimum bounding rectangle key into one byte for spatial-data compression. QMBRi is a novel spatial-data compression scheme that is based on inverse quantization and overcomes the shortcomings of conventional relative coordination or quantization schemes. If a spatial data is far from the starting point of the search region, the relative coordination scheme does not guarantee compression. In a quantization scheme, since the MBRs are expanded, the overlapping of MBRs is increased and the search performance is reduced. The proposed scheme overcomes these shortcomings, and simulation results suggest that it performs better than other schemes.

Downloads

Download data is not yet available.

Downloads

Published

2013-11-15

How to Cite

Kim, J., Oh, D., & Kim, K. (2013). QMBRi: Inverse quantization of minimum bounding rectangles for spatial data compression. Computing and Informatics, 32(4), 679–696. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/1967