Abstract
While the volumes of spatial data are tremendous and spatial operations are time-intensive, mobile devices own limited storages and low computational resources. Therefore, a spatial index for mobile map services should be small and efficiently filter out the candidate objects of a spatial operation as well. This paper proposes a spatial index called MHF(Multilevel Hashing File) for the mobile map service. The MHF has a simple structure for storage utilization and uses a hashing technique for search efficiency. This paper also designs a compression scheme of MBR(Minimum Bounding Rectangle) called HMBR. Although the HMBR scheme reduces the volume of MBR to almost a third, it still achieves a good filtering efficiency because of no information loss by quantization in case of small objects that occupy a major portion. Our experimental tests show that the proposed MHF with HMBR is appropriate for mobile devices in terms of the volume of index, the number of the MBR comparisons, the filtering efficiency and the execution time of spatial operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Int. Conf. on ACM SIGMOD, pp. 322–331 (1990)
Hoel, E.G., Samet, H.: A Qualitative Study of Data Structures for Large Line Segment Databases. In: Int. Conf. on ACM SIGMOD, pp. 205–214 (1992)
Kim, K.H., Cha, S.K., Kwon, K.J.: Optimizing multidimensional index trees for main memory access. In: Int. Conf. on ACM SIGMOD (2001)
Lehman, T.J., Carey, M.J.: A Study of index structures for main memory database management system. In: Int. Conf. on VLDB, pp. 294–303 (1986)
Lu, H., Ooi, B.C.: Spatial Indexing: Past and Future. IEEE Data Engineering Bulletin 16(3), 16–21 (1993)
Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: Int. Conf. on VLDB, pp. 78–89 (1999)
Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: Int. Conf. on ACM SIGMOD, pp. 475–486 (2000)
Shatdal, A., Kant, C., Naughton, J.F.: Cache conscious algorithms for relational query processing. In: Int. Conf. on VLDB, pp. 510–521 (1994)
Stonebraker, M., Frew, J., Gardels, K., Meredith, J.: The SEQUOIA 2000 Storage Benchmark. In: Int. Conf. on ACM SIGMOD, pp. 2–11 (1993)
Whang, K.Y., Krishnamurthy, R.: The Multilevel Grid Files – a Dynamic Hierarchical Multidimensional File Structure. In: Int. Conf. on Database Systems for Advanced Applications, pp. 449–459 (1991)
Shekhar, S., Huang, Y., Djugash, J.: Dictionary Design Algorithms for Vector Map Compression. In: Proc. of Data Compression Conf., p. 471 (2002)
Shekhar, S., Huang, Y., Djugash, J., Zhou, C.: Vector Map Compression: A Clustering Approach. In: ACM Int. Symposium on Advances in GIS, pp. 74–80 (2002)
Wong, P.W., Koplowitz, J.: Chain Codes and Their Linear Reconstruction Filters. IEEE Trans. On Information Theory 38(2), 268–280 (1992)
Zhou, X., Abel, D.J.: David Truffet: Data Partitioning for Parallel Spatial Join Processing. In: Int. Conf. on SSD, pp. 178–196 (1997)
Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: Spatial indexing of high-dimensional data based on relative approximation. VLDB J. 11, 93–108 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, JD., Moon, SH., Choi, JO. (2005). A Spatial Index Using MBR Compression and Hashing Technique for Mobile Map Service. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_58
Download citation
DOI: https://doi.org/10.1007/11408079_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)