Abstract
The prefix sum approach is a powerful technique to answer range-sum queries over multi-dimensional arrays in constant time by requiring only a few look-ups in an array of precomputed prefix sums. In this paper, we propose the sparse prefix sum approach that is based on relative prefix sums and exploits sparsity in the data to vastly reduce the storage costs for the prefix sums. The proposed approach has desirable theoretical properties and works well in practice. It is the first approach achieving constant query time with sub-linear update costs and storage costs for range-sum queries over sparse low-dimensional arrays. Experiments on real-world data sets show that the approach reduces storage costs by an order of magnitude with only a small overhead in query time, thus preserving microsecond-fast query answering.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
www.openstreetmap.org.
References
Facebook Connectivity Lab, Center for International Earth Science Information Network - CIESIN - Columbia University 2016. High Resolution Settlement Layer (HRSL). Source imagery for HRSL \(\copyright \) 2016 DigitalGlobe. http://www.ciesin.columbia.edu/data/hrsl/. Accessed 01 Mar 2017
Agarwal, P.K., Erickson, J., et al.: Geometric range searching and its relatives. Contemp. Math. 223, 1–56 (1999)
Bengtsson, F., Chen, J.: Space-efficient range-sum queries in OLAP. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2004. LNCS, vol. 3181, pp. 87–96. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30076-2_9
Chan, C.Y., Ioannidis, Y.E.: Hierarchical prefix cubes for range-sum queries. In: VLDB, pp. 675–686 (1999)
Chazelle, B.: Filtering search: a new approach to query-answering. SIAM J. Comput. 15(3), 703–724 (1986)
Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3), 427–462 (1988)
Chun, S., Chung, C., Lee, S.: Space-efficient cubes for OLAP range-sum queries. Decis. Support Syst. 37(1), 83–102 (2004)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational geometry. Computational Geometry, pp. 1–17. Springer, Heidelberg (2000). doi:10.1007/978-3-662-04245-8_1
Geffner, S., Agrawal, D., Abbadi, A.: The dynamic data cube. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 237–253. Springer, Heidelberg (2000). doi:10.1007/3-540-46439-5_17
Geffner, S., Agrawal, D., El Abbadi, A., Smith, T.R.: Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes. In: ICDE, pp. 328–335 (1999)
Ho, C., Agrawal, R., Megiddo, N., Srikant, R.: Range queries in OLAP data cubes. In: SIGMOD Conference, pp. 73–88 (1997)
Kang, H., Min, J., Chun, S., Chung, C.: A compression method for prefix-sum cubes. Inf. Process. Lett. 92(2), 99–105 (2004)
Liang, W., Wang, H., Orlowska, M.E.: Range queries in dynamic OLAP data cubes. Data Knowl. Eng. 34(1), 21–38 (2000)
Riedewald, M., Agrawal, D., El Abbadi, A.: pCUBE: update-efficient online aggregation with progressive feedback and error bounds. In: SSDBM, pp. 95–108 (2000)
Riedewald, M., Agrawal, D., El Abbadi, A.: Dynamic multidimensional data cubes. In: Multidimensional Databases, pp. 200–221 (2003)
Riedewald, M., Agrawal, D., Abbadi, A.E., Pajarola, R.: Space-efficient data cubes for dynamic environments. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol. 1874, pp. 24–33. Springer, Heidelberg (2000). doi:10.1007/3-540-44466-1_3
Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. Electr. Notes Theor. Comput. Sci. 61, 191–200 (2002)
Viola, P.A., Jones, M.J.: Rapid object detection using a boosted cascade of simple features. In: CVPR (1), pp. 511–518 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Shekelyan, M., Dignös, A., Gamper, J. (2017). Sparse Prefix Sums. In: Kirikova, M., Nørvåg, K., Papadopoulos, G. (eds) Advances in Databases and Information Systems. ADBIS 2017. Lecture Notes in Computer Science(), vol 10509. Springer, Cham. https://doi.org/10.1007/978-3-319-66917-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-66917-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66916-8
Online ISBN: 978-3-319-66917-5
eBook Packages: Computer ScienceComputer Science (R0)