Abstract
Recently, in order to retrieve data objects efficiently according to spatial locations in the spatial main memory DBMS, various multi-dimensional index structures for the main memory have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR (Minimum Bounding Rectangle) of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases and the efficiency of search is lowered in index update and search. Thus, to reduce the cost of MBR reconstruction, this paper proposed a RSMBR (Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and the MBR size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.
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.
References
Berchtold, S., Bohm, C., Kriegel, H.P., Sander, J.: Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces. In: Proc. of the ICDE Conference, pp. 577–588 (2000)
Bohannon, P., McIlroy, P., Rastogi, R.: Main-Memory Index Structures with Fixed-Size Partial Keys. In: Proc. of Proceedings of the ACM SIGMOD Conference, pp. 163–174. ACM Press, New York (2001)
Boncz, P., Manegold, S., Kersten, M.: Database Architecture Optimized for the New Bottleneck: Memory Access. In: Proc. of the International Conference on VLDB, pp. 54–65 (1999)
Chen, S., Gibbons, P.B., Mowry, T.C., Valentin, G.: Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performances. In: Proc. of the ACM SIGMOD Conference, pp. 157–168. ACM Press, New York (2002)
Guttman, A.: R-Trees: a Dynamic Index Structure for Spatial Searching. In: Proc. of the ACM SIGMOD Conference, pp. 47–54. ACM Press, New York (1984)
Kim, J.J., Hong, D.S., Kang, H.K., Han, K.J.: TMOM: A Moving Object Main Memory-Based DBMS for Telematics Services. In: Carswell, J.D., Tezuka, T. (eds.) Web and Wireless Geographical Information Systems. LNCS, vol. 4295, pp. 259–268. Springer, Heidelberg (2006)
Kim, K.H., Cha, S.K., Kwon, K.J.: Optimizing Multidimensional Index Tree for Main Memory Access. In: Proc. of the ACM SIGMOD Conference, pp. 139–150. ACM Press, New York (2001)
Mindaugas, P., Simonas, S., Christian, S.: Indexing the Past, Present, and Anticipated Future Positions of Moving Objects. ACM Transactions on Database Systems 31(1), 255–298 (2006)
Shim, J.M., Song, S.I., Min, Y.S., Yoo, J.S.: An Efficient Cache Conscious Multi-dimensional Index Structure. In: Proc. of the Computational Science and Its Applications, pp. 869–876 (2004)
Sitzmann, I., Stuckey, P.: Compacting Discriminator Information for Spatial Trees. In: Proc of the Australian Database Conference, pp. 167–176 (2002)
Zhou, J., Ross, K.A.: Buffering Accesses of Memory-Resident Index Structures. In: Proc. of the International Conference on VLDB, pp. 405–416 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, JJ., Kang, HK., Hong, DS., Han, KJ. (2007). An Efficient Compression Technique for a Multi-dimensional Index in Main Memory. In: Qiu, G., Leung, C., Xue, X., Laurini, R. (eds) Advances in Visual Information Systems. VISUAL 2007. Lecture Notes in Computer Science, vol 4781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76414-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-76414-4_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76413-7
Online ISBN: 978-3-540-76414-4
eBook Packages: Computer ScienceComputer Science (R0)