Abstract
In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases stored on SD cards. As the price for these SD cards heavily depends on their capacity and as digital map databases are rather space-consuming, relatively high hardware costs go along with digital map databases covering large areas like Europe or the USA. In this paper, we propose new techniques for the compact storage of the most important part of these databases, i.e., the road network data. Our solution applies appropriate techniques from combinatorial optimization, e.g., adapted solutions for the minimum bandwidth problem, and from data mining, e.g., clustering based on suitable distance measures. In a detailed experimental evaluation based on real-world data, we demonstrate the characteristics and benefits of our new approaches.
This work was supported in part by KOSEF grant No. R01-2006-000-10536-0(2007) and in part by the Brain Korea 21 Project in 2007.
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
Williams, H.E., Zobel, J.: Compressing integers for fast file access. The Computer Journal 42(3), 193–201 (1999)
Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canadian Cartographer 10(2), 112–122 (1973)
Papadimitriou, C.H.: The np-completeness of the bandwidth minimization problem. Computing 16, 263–270 (1976)
Garey, M., Graham, R., Johnson, D., Knuth, D.: Complexity results for bandwidth minimization. SIAM Journal of Applied Mathematics 34(3), 477–495 (1978)
Caprara, A., Salazar-Gonzalez, J.-J.: Laying out sparse graphs with provably minimum bandwidth. Informs Journal on Computing 17(3), 356–373 (2005)
Campos, V. Piñana, E., MartÃ, R.: Adaptive memory programming for matrix bandwidth minimization. Technical Report, University of Valencia, Spain (2006)
Gibbs, N., Poole, W., Stockmeyer, P.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 13(2), 235–251 (1976)
Orenstein, J.: A comparison of spatial query processing techniques for native and parameter spaces. In: SIGMOD 1990. Proceedings of the 1990 ACM SIGMOD international conference on Management of data, Atlantic City, New Jersey, United States, pp. 343–352. ACM Press, New York, NY, USA (1990)
Jagadish, H.V.: Linear clustering of objects with multiple attributes. In: SIGMOD 1990. Proceedings of the 1990 ACM SIGMOD international conference on Management of data, pp. 332–342. ACM Press, New York, NY, USA (1990)
Ng, R.T., Han, J.: Clarans: A method for clustering objects for spatial data mining. IEEE Transactions on Knowledge and Data Engineering 14(5), 1003–1016 (2002)
Pruefer, H.: Neuer beweis eines satzes uber permutationen. Archiv fur Mathematik und Physik 27, 142–144 (1918)
Brecheisen, S., Kriegel, H.P., Kroger, P., Pfeifle, M.: Visually mining through cluster hierarchies. In: Jonker, W., Petković, M. (eds.) SDM 2004. LNCS, vol. 3178, pp. 400–412. Springer, Heidelberg (2004)
Ankerst, M., Breunig, M., Kriegel, H.-P., Sander, J.: Optics: ordering points to identify the clustering structure. In: SIGMOD 1999. Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pp. 49–60. ACM Press, New York, NY, USA (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suh, J., Jung, S., Pfeifle, M., Vo, K.T., Oswald, M., Reinelt, G. (2007). Compression of Digital Road Networks. In: Papadias, D., Zhang, D., Kollios, G. (eds) Advances in Spatial and Temporal Databases. SSTD 2007. Lecture Notes in Computer Science, vol 4605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73540-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-73540-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73539-7
Online ISBN: 978-3-540-73540-3
eBook Packages: Computer ScienceComputer Science (R0)