Abstract
Selectivity factor is obtained by database query optimizer for estimating the size of data that satisfy a query condition. This allows to choose the optimal query execution plan. In this paper we consider the problem of selectivity estimation for inequality predicates based on two attributes, therefore the proposed solution allows to estimate the size of data that satisfy theta-join conditions. The proposed method is based on Discrete Fourier Transform and convolution theorem. DFT spectrums are used as representations of distribution of attribute values. We compute selectivity either performing Inverse DFT (for an inequality condition based on two attributes) or avoiding it (for a single-attribute range one). Selectivity calculation is a time-critical operation performed during an on-line query preparing phase. We show that by applying parallel processing capabilities of Graphical Processing Unit, the implementation of the method satisfies the assumed time constraint.
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
CUFFT vs FFTW comparison (2008), http://www.sharcnet.ca/~merz/CUDA_benchFFT
Abdellah, M., Saleh, S., Eldeib, A., Shaarawi, A.: High performance multi-dimensional (2d/3d) fft-shift implementation on graphics processing units (gpus)
Augustyn, D.R.: The method of query selectivity estimation for selection conditions based on sum of sub-independent attributes. In: Gruca, A., Czachórski, T., Kozielski, S. (eds.) Man-Machine Interactions 3. AISC, vol. 242, pp. 601–609. Springer, Heidelberg (2014)
Augustyn, D.R., Zederowski, S.: Applying cuda technology in dct-based method of query selectivity estimation. In: Pechenizkiy, M., Wojciechowski, M. (eds.) New Trends in Databases & Inform. AISC, vol. 185, pp. 3–12. Springer, Heidelberg (2012)
Breß, S., Beier, F., Rauhe, H., Sattler, K.U., Schallehn, E., Saake, G.: Efficient co-processor utilization in database query processing. Inf. Syst. 38(8), 1084–1096 (2013), http://dx.doi.org/10.1016/j.is.2013.05.004 , doi:10.1016/j.is.2013.05.004
Breß, S., Heimel, M., Siegmund, N., Bellatreche, L., Saake, G.: Exploring the design space of a GPU-aware database architecture. In: Catania, B., Cerquitelli, T., Chiusano, S., Guerrini, G., Kämpf, M., Kemper, A., Novikov, B., Palpanas, T., Pokorny, J., Vakali, A. (eds.) New Trends in Databases and Information Systems. AISC, vol. 241, pp. 225–234. Springer, Heidelberg (2014)
Chakrabarti, K., Garofalakis, M., Rastogi, R., Shim, K.: Approximate query processing using wavelets. The VLDB Journal 10(2-3), 199–223 (2001), http://dl.acm.org/citation.cfm?id=767141.767147
Frigo, M., Johnson, S.G.: FFTW Library (2014), http://www.fftw.org
Harris, M.: Optimizing Parallel Reduction in CUDA (2011), http://developer.download.nvidia.com/assets/cuda/files/reduction.pdf
He, B., Lu, M., Yang, K., Fang, R., Govindaraju, N.K., Luo, Q., Sander, P.V.: Relational query coprocessing on graphics processors. ACM Transactions on Database Systems (TODS)Â 34(4), 21 (2009)
Heimel, M., Markl, V.: A first step towards gpu-assisted query optimization. In: The Third International Workshop on Accelerating Data Management Systems using Modern Processor and Storage Architectures, Istanbul, Turkey, pp. 1–12. Citeseer (2012)
Intel Corporation: Intel®65 and IA-32 Architectures Software Developers Manual (2001)
Lee, J.H., Kim, D.H., Chung, C.W.: Multi-dimensional selectivity estimation using compressed histogram information. SIGMOD Rec. 28(2), 205–214 (1999), http://doi.acm.org/10.1145/304181.304200 , doi:10.1145/304181.304200
NVidia Corporation: NVIDIA CUDATMC Programming Guide, version 6.0 (2014), http://docs.nvidia.com/cuda/pdf/CUDA/C/ProgrammingGuide.pdf
NVidia Corporation: NVIDIA cuFFT Library User’s Guide (2014), http://docs.nvidia.com/cuda/pdf/CUFFT_Library.pdf
Saraç, K., Egecioglu, Ö., Abbadi, A.E.: Dft techniques for size estimation of database join operations. Int. J. Found. Comput. Sci. 10(1), 81–102 (1999), http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs10.html#SaracEA99
Yan, F., Hou, W.C., Jiang, Z., Luo, C., Zhu, Q.: Selectivity estimation of range queries based on data density approximation via cosine series. Data Knowl. Eng. 63(3), 855–878 (2007), http://dx.doi.org/10.1016/j.datak.2007.05.003 , doi:10.1016/j.datak.2007.05.003
Zhang, J., You, S., Gruenwald, L.: Parallel selectivity estimation for optimizing multidimensional spatial join processing on gpus
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Augustyn, D.R., Warchal, L. (2015). GPU-Accelerated Method of Query Selectivity Estimation for Non Equi-Join Conditions Based on Discrete Fourier Transform. In: Bassiliades, N., et al. New Trends in Database and Information Systems II. Advances in Intelligent Systems and Computing, vol 312. Springer, Cham. https://doi.org/10.1007/978-3-319-10518-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-10518-5_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10517-8
Online ISBN: 978-3-319-10518-5
eBook Packages: EngineeringEngineering (R0)