Lower bounds for dynamic range query problems that permit subtraction (extended abstract)

  • Dan E. Willard
  • Suny Albany
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


Fredman has shown that Θ(logkN) lower bounds the complexity for doing aggregate orthogonal range queries on a set of N records in a dynamic environment, where the computing machine can use only addition for calculating aggregates [Fr81a,Me84]. We show that a natural generalization of [KMR85]'s contiguous segment assumption extends Fredman's formalism so that subtraction as well as addition may be included in the Θ(logkN) lower bound. Since subtraction operarions are known to speed up orthogonal range queries in a static environment [Ch85a, Wi85a, Wi85b, Wi86], it is surprising that subtraction is not also helpful in a dynamic environment.

The techniques introduced in section 2 are stated in very general terms because they should have applications to other types of problems, besides those we consider.


Range Query Aggregate Query Dynamic Data Structure Letter Symbol Aggregate Counter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Be75]
    J.L. Bentley, Multidimensional binary tree used for associative searching, Comm. of ACM 18 (1975), pp. 509–517.Google Scholar
  2. [Be80]
    __, Multidimensional divide-and-conquer, Comm. of ACM 23 (1980), pp. 214–228.Google Scholar
  3. [BM80]
    J.L. Bentley and H.A. Mauer, Efficient worst-case data structures for range searching, Acta Informatica 13 (1980), pp. 155–168.Google Scholar
  4. [BS77]
    J.L. Bentley and M.I. Shamos, A problem in multi-variate statistics: algorithm, data structure and applications, 15-th Allerton Conf. on Comm., Contr., and Comp. (1977), p. 193–201.Google Scholar
  5. [BS80]
    J.L. Bentley and J.B. Saxe, Decomposable searching problems #1: static to dynamic transformations, J. Alg. (1980), pp. 301–358.Google Scholar
  6. [Ch83]
    B. Chazelle, Filter Search a New Approach to Query Processing, 24th IEEE Symp. on Foundations of Computer Science, 1983, pp. 122–132.Google Scholar
  7. [Ch85a]
    _____, Slimming Down Data Structures a Functinal Approach to Algorithm Design, 25-th IEEE Symp. on Foundations of Computer Science, pp 165–174.Google Scholar
  8. [Ch85b]
    _____, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, an expanded version of [Ch85a] issued as Brown Univ TR CS-85-16, 1985.Google Scholar
  9. [CG85]
    B. Chazelle and L.J. Guibas, Fractional Cascading: A Data Structure Technique with Geometric Applications, 12-th ICALP (1985), pp. 90–100.Google Scholar
  10. [Ed81]
    H. Edelsbrunner, A Note on Dynamic Range Searching, Bulletin of EATCS 15(1981), pp. 34–40.Google Scholar
  11. [EO82]
    H. Edelsbrunner and M. Overmars, On the equivalence of some rectangle search problems, Inf. Proc. Letters 14(1982), pp. 124–127.Google Scholar
  12. [EW83]
    H. Edelsbrunner and E. Welzl, Halfplanar range search in linear space and O(N.695) time, Univ. of Graz report F111, 1983.Google Scholar
  13. [Fr80]
    M.L. Fredman, The Inherent Compl. of Dynamic Data Structures Which Accomodate Range Queries, 21st FOCS, 1980, pp 191–199.Google Scholar
  14. [Fr81a]
    __, A lower bound on the complexity of orthogonal range queries, Journal of ACM 28 (1981), pp. 696–706.Google Scholar
  15. [Fr81b]
    __, The Spanning Bound as a Measure of Range Query Complexity, Journal of Algorithms 1 (1981), pp 77–87.Google Scholar
  16. [Fr81c]
    __, Lower Bounds on the Complexity of Some Optimal Data Structures, SIAM J. Comp. 10 (1981), pp 1–10.Google Scholar
  17. [Fr85]
    _____, private communication, June 1985.Google Scholar
  18. [FMN85]
    O. Fries, K. Mehlhorn and St. Naher, Dynamization of geometric Data Structures, 1-st ACM Com. Geom. Conference, 1985, 168–177.Google Scholar
  19. [FP83]
    P. Flajolet and C. Puech, Tree Structures for Partial Match Retrieval, 24-th IEEE Symp. on FOCS (1983), pp. 282–286.Google Scholar
  20. [GBT84]
    H. Gabow, J. Bentley and R. Tarjan, Scaling and Related Techniques for Geometry, 16th ACM STOC Symp. (1984), pp. 135–143.Google Scholar
  21. [KMR85]
    R.G. Karlsson, J.I. Munro and E.L. Robertson, The Nearest Neighbor Problem on Bounded Domains The 12-th ICALP Symposium, (1985), pp. 318–327.Google Scholar
  22. [KV85]
    M. Katz and D. Volper, Data Structures for Retrieval on Square Grids, to appear in SIAM J. on Comp. Google Scholar
  23. [LP84]
    D.T. Lee and F. Preparata, Computational Geometry A Survey, IEEE Trans Comp 33 (1984), pp. 1072–1101.Google Scholar
  24. [LW77]
    D.T. Lee and C.K. Wong, Worst-case analysis of region and partial region searches in multi-dimensional binary search trees and balance quad trees, Acta Informatica 9 (1977), pp. 23–29.Google Scholar
  25. [LW80]
    D.T. Lee and C.K. Wong, Quintary tree: a file structure for multidimensional database systems, ACM TODS 5 (1980), pp. 339–347.Google Scholar
  26. [LW82]
    G.S. Lueker and D.E. Willard, A data structure for dynamic range queries, Inf. Proc. Letters 15 (1982), pp. 209–213.Google Scholar
  27. [Me84]
    K. Mehlhorn, Data Structures and Algorithms (Volume 3), a 12-page summary of [Fr81a]'s formalism appears here; Springer-Verlag, 1984; pp60–72.Google Scholar
  28. [Ov85]
    M. Overmars, Range Searching on a Grid, Univ. Utrecht, RUU-CS-85-179, 1985.Google Scholar
  29. [OL81]
    M. Overmars and J v. Leeuvwen, Two General Methods for Dynamizing Decomposable Searching Problems, Computing 26 (1981), pp155–166.Google Scholar
  30. [PS85]
    F.P. Preperata and M. I. Shamos, Computational Geometry An Introduction, Springer-Verlag, 1985.Google Scholar
  31. [Va85]
    P.M. Vaidya, Space Time Tradeoffs for Orthogonal Range Queries, 17-th ACM STOC (1985), pp. 169–174.Google Scholar
  32. [Wi82]
    D.E. Willard, Polygon Retrieval, SIAM J. on Comp. 11(1982), pp. 149–165.Google Scholar
  33. [Wi85a]
    __, New data structure for orthogonal range queries, SIAM Journal on Computing, 14(1985), pp. 233–253.Google Scholar
  34. [Wi85b]
    _____, Reduced Memory Space for Multi-Dimensional Serach Trees, 2-nd Symposium on Theoretical Aspects of Computer Science (published in Springer-Verlag LNCS182), 1985, pp. 363–374.Google Scholar
  35. [Wi86]
    _____, On the application of sheared retrieval to orthogonal range queries, published in the Proceedings of the Second ACM Symposium on Computational Geometry, June 1986.Google Scholar
  36. [WL85]
    D.E. Willard and G.S. Lueker, Adding range restriction capabiity to dynamic data structures, JACM 32 (1985) pp.597–619.Google Scholar
  37. [Ya85]
    A.C. Yao, On the complexity of maintaining partial sums, SIAM Journal on Computing, 14(1985), pp. 277–289.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Dan E. Willard
    • 1
  • Suny Albany
    • 1
  1. 1.Department of Computer ScienceAlbany

Personalised recommendations