Abstract
We define the range 1 query (R1Q) problem as follows. Given a d-dimensional (d ≥ 1) input bit matrix A, preprocess A so that for any given region \(\mathcal{R}\) of A, one can efficiently answer queries asking if \(\mathcal{R}\) contains a 1 or not. We consider both orthogonal and non-orthogonal shapes for \(\mathcal{R}\) including rectangles, axis-parallel right-triangles, certain types of polygons, and spheres. We provide space-efficient deterministic and randomized algorithms with constant query times (in constant dimensions) for solving the problem in the word RAM model. The space usage in bits is sublinear, linear, or near linear in the size of A, depending on the algorithm.
Rezaul Chowdhury & Pramod Ganapathi are supported in part by NSF grant CCF-1162196. Michael A. Bender & Samuel McCauley are supported in part by NSF grants IIS-1247726, CCF-1217708, CCF-1114809, and CCF-0937822.
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.
Similar content being viewed by others
References
Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. Contemporary Mathematics 223, 1–56 (1999)
Amir, A., Fischer, J., Lewenstein, M.: Two-dimensional range minimum queries. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 286–294. Springer, Heidelberg (2007)
Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88–94. Springer, Heidelberg (2000)
Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms 57(2), 75–94 (2005)
Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM Journal on Computing 22(2), 221–242 (1993)
Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. Algorithmica 63(4), 815–830 (2012)
Chazelle, B., Rosenberg, B.: Computing partial sums in multidimensional arrays. In: SoCG, pp. 131–139. ACM (1989)
Cormode, G., Muthukrishnan, S.: An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms 55(1), 58–75 (2005)
De Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational geometry. Springer (2008)
Fischer, J.: Optimal succinctness for range minimum queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158–169. Springer, Heidelberg (2010)
Fischer, J., Heun, V.: A new succinct representation of rmq-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459–470. Springer, Heidelberg (2007)
Fischer, J., Heun, V., Stiihler, H.: Practical entropy-bounded schemes for o(1)-range minimum queries. In: Data Compression Conference, pp. 272–281. IEEE (2008)
Golynski, A.: Optimal lower bounds for rank and select indexes. TCS 387(3), 348–359 (2007)
González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proc. WEA, pp. 27–38 (2005)
Navarro, G., Nekrich, Y., Russo, L.: Space-efficient data-analysis queries on grids. TCS (2012)
Overmars, M.H.: Efficient data structures for range searching on a grid. Journal of Algorithms 9(2), 254–275 (1988)
Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems 41(4), 589–607 (2007)
Sadakane, K.: Succinct data structures for flexible text retrieval systems. JDA 5(1), 12–22 (2007)
Sharir, M., Shaul, H.: Semialgebraic range reporting and emptiness searching with applications. SIAM Journal on Computing 40(4), 1045–1074 (2011)
Tang, Y., Chowdhury, R., Kuszmaul, B.C., Luk, C.K., Leiserson, C.E.: The Pochoir stencil compiler. In: SPAA, pp. 117–128. ACM (2011)
Yao, A.C.: Space-time tradeoff for answering range queries. In: STOC, pp. 128–136. ACM (1982)
Yuan, H., Atallah, M.J.: Data structures for range minimum queries in multidimensional arrays. In: SODA, pp. 150–160 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bender, M.A., Chowdhury, R.A., Ganapathi, P., McCauley, S., Tang, Y. (2014). The Range 1 Query (R1Q) Problem. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds) Computing and Combinatorics. COCOON 2014. Lecture Notes in Computer Science, vol 8591. Springer, Cham. https://doi.org/10.1007/978-3-319-08783-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-08783-2_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08782-5
Online ISBN: 978-3-319-08783-2
eBook Packages: Computer ScienceComputer Science (R0)