Abstract
Point-transformation schemes transform multidimensional points to one-dimensional values so that conventional access methods can be used to index multidimensional points, enabling convenient integration of multidimensional query facilities into complex transactional database management systems. However, in high-dimensional data spaces, the computational complexity of the required query transformation is prohibitive. This paper proposes a near-optimal solution based on our novel ideas of adaptive Z-ordering. The experimental results show that the proposed approach significantly improves the query performance of point-transformation schemes. The idea can easily be generalized to accommodate any hierarchical space-filling curve, not just the Z-curve.
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
Baeza-Yates, R.A.: Expected Behavior of B+-Trees under Random Insertions. Acta Informatica 26, 439–471 (1989)
Bayer, R.: The Universal B-Tree for Multidimensional Indexing: General Concepts. In: Masuda, T., Tsukamoto, M., Masunaga, Y. (eds.) WWCA 1997. LNCS, vol. 1274, pp. 198–209. Springer, Heidelberg (1997)
Berchtold, S., Bohm, C., Kriegel, H.P.: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 142–153 (1998)
Faloutsos, C., Rong, Y.: DOT: A Spatial Access Method Using Fractals. In: Proc. 7th IEEE Int. Conf. on Data Engineering, pp. 152–159 (1991)
Kamel, I., Faloutsos, C.: Hilbert R-tree: An Improved R-tree Using Fractals. In: Proc. 20th Int. Conf. on Very Large Data Bases, pp. 500–509 (1994)
Orenstein, J.A., Merrett, T.H.: A Class of Data Structures for Associative Searching. In: Proc. ACM PODS Symposium on Principles of Database Systems, pp. 181–190 (1984)
Orlandic, R., Mahmoud, H.: Storage Overhead of O-trees, B-trees and Prefix B-trees: A Comparative Analysis. Int. Journal of Foundations of Computer Science 7(3), 209–226 (1996)
Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the UB-Tree into a Database System Kernel. In: Proc. 26th Int. Conf. on Very Large Data Bases, pp. 263–272 (2000)
Yu, B., Orlandic, R.: Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse. In: Proc. ACM CIKM Int. Conf. on Information and Knowledge Management, pp. 141–149 (2000)
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
Yu, B. (2005). Adaptive Query Processing in Point-Transformation Schemes. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_20
Download citation
DOI: https://doi.org/10.1007/11546924_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)