Stephen Alstrup
ABSTRACT
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S \subseteq U, where U = \{0,1,\dots,2^w-1\}, which support various queries for integer intervals of U. For the query of reporting all integers in S contained within a query interval, we present an optimal data structure with linear space cost and with query time linear in the number of integers reported. This result holds in the unit cost RAM model with word size w and a standard instruction set. We also present a linear space data structure for approximate range counting. A range counting query for an interval returns the number of integers in S contained within the interval. For any constant ε>0, our range counting data structure returns in constant time an approximate answer which is within a factor of at most 1+ε of the correct answer.
- 1.P.K.Agarwal Range searching.In Handbook of Discrete and Computational Geometry, CRC Press 1997. Google Scholar
Digital Library
- 2.A.Agarwal and J.S.Vitter.The input/output complexityof sorting and related prob ems. Communications of the ACM 31(9):1116 -1127,1988. Google ScholarDigital Library
- 3.M.Ajtai.A ower bound for .nding predecessors in Yao's cell probe model.Combinatorica (8):235 -247, 1988.Google Scholar
- 4.A.Amir,A.Efrat,P.Indyk,and H.Samet.E .cient regular data structures and algorithms for location and proximityproblems.In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS),pages 160 -170,1999. Google ScholarDigital Library
- 5.A.Andersson,T.Hagerup,S.Ni sson,and R.Raman. Sorting in linear time?Journal of Computer and System Sciences 57(1):74 -93,1998. Google ScholarDigital Library
- 6.A.Andersson and O.Petersson.Approximate indexed lists.Journal of Algorithms 29(2):256 -276,1998. Google ScholarDigital Library
- 7.A.Andersson and M.Thorup.Tight(er)worst-case bounds on dynamic searching and priority queues.In Proc. 32nd ACM Symposium on Theory of Computing (STOC),pages 335 -342,2000. Google ScholarDigital Library
- 8.P.Beame and F.Fich.Optima bounds for the predecessor prob em.In Proc. 31st ACM Symposium on Theory of Computing (STOC),pages 295 --304, 1999. Google ScholarDigital Library
- 9.K.L.Clarkson.An algorithm for approximate closest-point queries.In Proc. 10th Annual Symposium on Computational Geometry pages 160 -164,Stony Brook,NY,USA,1994.ACM Press. Google ScholarDigital Library
- 10.M.Dietzfe binger.Universa hashing and k-wise independent random variables via integer arithmetic without primes.In 13th Annual Symposium on Theoretical Aspects of Computer Science volume 1046 of Lecture Notes in Computer Science pages 569 -580. Springer Verlag,Berlin,1996. Google ScholarDigital Library
- 11.R.W.Floyd.A gorithm 245:Treesort3. Communications of the ACM 7(12):701,1964. Google ScholarDigital Library
- 12.M.L.Fredman,J.Komlos,and E.Szemeredi.Storing a sparse table with O(1)worst case access time. Journal of the ACM 31(3):538 -544,1984. Google ScholarDigital Library
- 13.M.L.Fredman and D.E.Willard.Surpassing the information theoretic bound with fusion trees.Journal of Computer and System Sciences 47:424 -436,1993. Google ScholarDigital Library
- 14.M.L.Fredman and D.E.Willard.Trans-dichotomous a gorithms for minimum spanning trees and shortest paths.Journal of Computer and System Sciences 48:533 -551,1994. Google ScholarDigital Library
- 15.D.Hare and R.Tarjan.Fast a gorithms for .nding nearest common ancestors.SIAM Journal of Computing 13(2):338 -355,1984. Google ScholarDigital Library
- 16.C.T.M.Jacobs and P.van Emde Boas.Two results on tab es.Information Processing Letters 22(1):43 -48, 1986. Google ScholarDigital Library
- 17.Y.Matias,J.S.Vitter,and N.E.Young. Approximate data structures with applications.In Proc. 5th ACM-SIAM Symp. Discrete Algorithms (SODA),pages 187 -194,1994. Google ScholarDigital Library
- 18.K.Mehlhorn.Data Structures and Algorithms: 3. Multidimensional Searching and Computational Geometry Springer,1984. Google ScholarDigital Library
- 19.P.B.Mi tersen,N.Nisan,S.Safra,and A.Wigderson. On data structures and asymmetric communication complexity.Journal of Computer and System Sciences 57(1):37 -49,1998. Google ScholarDigital Library
- 20.F.P.Preparata and M.Shamos.Computational Geometry Springer-Verlag,New York,1985. Google ScholarDigital Library
- 21.J.P.Schmidt and A.Siege .The spatia complexityof oblivious k -probe hash functions.SIAM Journal of Computing 19(5):775 -786,1990. Google ScholarDigital Library
- 22.R.Seidel and C.R.Aragon.Randomized search trees. Algorithmica 16(4/5):464 -497,1996.Google Scholar
- 23.M.Thorup.Faster deterministic sorting and priority queues in linear space.In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA),pages 550 -555,1998. Google ScholarDigital Library
- 24.D.E.Willard.Log-logarithmic worst-case range queries are possible in space ~(N ).Information Processing Letters 17(2):81 -84,1983.Google ScholarCross Ref
- 25.J.W.J.Williams.Algorithm 232:Heapsort. Communications of the ACM 7(6):347 -348,1964.Google Scholar
Index Terms
- Optimal static range reporting in one dimension
Recommendations
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
SoCG '10: Proceedings of the twenty-sixth annual symposium on Computational geometryOrthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. While the 2-d version of the problem was completely characterized in the ...
External memory range reporting on a grid
ISAAC'07: Proceedings of the 18th international conference on Algorithms and computationIn this paper we present external memory data structures for orthogonal range reporting queries on a grid. Our data structure for twodimensional orthogonal range reporting queries uses O((N/B) log2 N) blocks of space of size B and supports queries in ...
Near-optimal range reporting structures for categorical data
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithmsRange reporting on categorical (or colored) data is a well-studied generalization of the classical range reporting problem in which each of the N input points has an associated color (category). A query then asks to report the set of colors of the ...
Comments