Applications of range query theory to relational data base join and selection operations

Journal of Computer and System Sciences

Volumn 52, Issue 1, 1996, Pages 157-169

  Willard, Dan E ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; DATA STRUCTURES; INFORMATION RETRIEVAL; LOGIC GATES; QUERY LANGUAGES; SET THEORY;

ENACTMENT DEGREE; EQUALITY ATOM; LIST ATOM; MEMORY SPACE; ONLINE REPORTING PROBLEM; ORDER ATOM; RANGE QUERY THEORY; REPORTING JOIN; TABULAR ATOM;

RELATIONAL DATABASE SYSTEMS;

EID: 0030086633     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0012     Document Type: Article

References (55)

1. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time, in "Proceedings, 27th ACM Symposium on Theory of Computing, 1995," pp. 427-436.
2. J. L. Bentley, Multidimensional binary search trees used for associative searching, Comm. ACM 18 (1975), 509-517.
3. J. L. Bentley, Multidimensional divide-and-conquer, Comm. ACM 23 (1980), 214-229.
4. J. L. Bentley and H. A. Mauer, Efficient worst-case data structures for range searching, Acta Inform. 13 (1980), 155-168.
5. J. L. Bentley and M. I. Shamos, A problem in multi-variate statistics: Algorithm, data structure and applications, in "15th Allerton Conf. on Comm., Contr., and Comp., 1977," pp. 193-201.
6. J. L. Bentley and J. B. Saxe, Decomposable searching problems #1: Static to dynamic transformations, J. Algebra (1980), 301-358.
7. B. Chazelle, Filtering search: A new approach to query processing, SIAM J. Comput. 15 (1986), 703-724.
8. B. Chazelle, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput. 17 (1988), 427-462.
9. B. Chazelle, Lower bounds for orthogonal range searching. I. The reporting case, J. Assoc. Comput. Mach. 37 (1990), 200-212.
10. B. Chazelle, Lower bounds for orthogonal range searching. II. The arithmetic model, J. Assoc. Comput. Mach. 37 (1990), 439-463.
11. B. Chazelle and L. J. Guibas, Fractional cascading: A data structuring technique, Algorithmica 1 (1986), 133-162; 163-191.
12. J. Cai and R. Paige, Binding performance of language design, in "Proceedings, POPL-1987," pp. 85-97.
13. P. Dietz, Optimal algorithms for list indexing and subset rank, J. Algorithms, to appear.
14. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, Dynamic perfect hashing: Upper and lower bounds, in "Proceedings 29th IEEE Symposium on Foundations of Computer Science, 1988," pp. 524-531.
15. H. Edelsbrunner, A note on dynamic range searching, Bull. EATCS 15 (1981), 34-40.
16. H. Edelsbrunner, "Algorithms in Combinatorial Theory," Springer-Verlag, New York/Berlin, 1987.
17. H. Edelsbrunner and M. Overmars, On the equivalence of some rectangle search problems, Inform Proc. Lett. 14 (1982), 124-127.
18. H. Edelsbrunner and M. Overmars, Batch solutions to decomposable search problems, J. Algorithms 5 (1985), 515-542.
19. M. L. Fredman, Lower bounds on some optimal data structures, SIAM J. Comput. 10 (1981), 1-10.
20. M. L. Fredman, A lower bound on the complexity of orthogonal range queries, J. Assoc. Comput. Mach. 28 (1981), 696-706.
21. M. L. Fredman, J. Komlos, and E. Szemeredi, Storing a sparse table with O(1) worst-case acces time, J. Assoc. Comput. Mach. 31 (1984), 538-544.
22. M. L. Fredman and D. E. Willard, BLASTING through the information theoretic barrier with FUSION TREES, in "Proceedings, ACM STOC-1990 Conference," pp. 1-7; J. Comput. System Sci. 47 (1993), 424-436.
23. M. L. Fredman and D. E. Willard, BLASTING through the information theoretic barrier with FUSION TREES, in "Proceedings, ACM STOC-1990 Conference," pp. 1-7; J. Comput. System Sci. 47 (1993), 424-436.
24. D. T. Lee and F. Preparata, Computational geometry; A survey, IEEE Trans. Comput. 33 (1984), 1072-1101.
25. D. T. Lee and C. K. Wong, Worst-case analysis of region and partial region searches in multi-dimensional binary search trees and balanced quad trees, Acta Inform. 9 (1977), 23-29.
26. D. T. Lee and C. K. Wong, Quintary tree: A file structure for multidimensional database systems, ACM Trans. Database Systems 1 (1980), 339-347.
27. G. S. Lueker and D. E. Willard, A data structure for dynamic range queries, Inform. Proc. Lett. 15 (1982), 209-213.
28. K. Mehlhorn, "Data Structures and Algorithms, Vol. 3: Multidimensional Searching and Computational Geometry," Springer-Verlag, New York/Berlin, 1984.
29. K. Mehlhorn and S. Naher, Dynamic fractional cascading, Algorithmic 5 (1990), 215-241.
30. M. Overmars, "The Design of Dynamic Data Structures," Lect. Notes in Comput. Sci., Vol. 156, Springer-Verlag, New York/ Berlin, 1983.
31. M. Overmars, Range searching on a grid, J. Algorithms 9 (1988), 254-275.
32. M. Overmars and J. v. Leeuwen, Two general methods for dynamizing decomposable searching problems, Computing 26 (1981), 155-166.
33. M. Overmars and M. Smid, Maintaining a range tree in secondary memory, Acta Algorithmica 27 (1990), 423-452, 453-480.
34. R. Paige, "Formal Differentiation - A Program Synthesis Technique," UMI Research Press, 1981; revised Ph.D. thesis, New York University, June 1979; in Courant Computer Sci. Report # 15, pp. 269-658, Sept. 1979.
35. R. Paige, "Formal Differentiation - A Program Synthesis Technique," UMI Research Press, 1981; revised Ph.D. thesis, New York University, June 1979; in Courant Computer Sci. Report # 15, pp. 269-658, Sept. 1979.
36. R. Paige, Applications of finite differencing to database integrity control and query transaction optimization, in "Advances in Database Theory," Vol. 2, pp. 171-210 (H. Gallaire, J. Minker, and J. M. Nicolas, Eds.), Plenum, 1984.
37. R. Paige and F. Henglein, Mechanical translation of set theoretic problem specifications into efficient RAM code - A case study, J. Symbolic Comput. 4, No. 2 (1987), 207-232.
38. R. Paige and S. Koenig, Finite differencing of computation expressions, ACM TOPLAS (1982), 402-454.
39. F. P. Preparata and M. I. Shamos, "Computational Geometry, An Introduction," Springer-Verlag, New York/Berlin, 1985.
40. M. Smid, "Dynamic Data Structures and Multiple Storage Media," Ph.D. dissertation, University of Amsterdam, 1989.
41. J. D. Ullman, "Database and Knowledge Base Systems, Volume I," Computer Sci. Press, New York, 1989.
42. P.M. Vaidya, Space time tradeoffs for orthogonal range queries in "17th ACM STOC 1985," pp. 169-174.
43. D. E. Willard, "Predicate-Oriented Database Search Algorithms," Harvard Ph.D. dissertation, May 1978; in "Outstanding Dissertations in Computer Science," Garland Publishing Co., New York, 1978.
44. D. E. Willard, "Predicate-Oriented Database Search Algorithms," Harvard Ph.D. dissertation, May 1978; in "Outstanding Dissertations in Computer Science," Garland Publishing Co., New York, 1978.
45. D. E. Willard, Predicate retrieval theory, in "21st Allerton Conference on Communications, Control and Computing, 1983," pp. 663-674.
46. D. E. Willard, Efficient Processing of Relational Calculus Expressions Using Range Query Theory, in "Proceedings, ACM SIGMOD Conference, 1984," pp. 160-172.
47. D. E. Willard, New data structures for orthogonal range queries, SIAM J. Comput. 14 (1985), 233-253.
48. D. E. Willard, On the application of sheared retrieval to orthogonal range queries, in "1986 Computational Geometry Conference," pp. 80-90.
49. D. E. Willard, Multidimensional search trees that provide new types of memory reductions, J. Assoc. Comput. Mach. 34 (1987), 846-858.
50. D. E. Willard, Lower bounds for the addition-subtraction operations in orthogonal range queries, Inform. Comput. 82 (1989), 45-64.
51. D. E. Willard, Quasilinear algorithm for processing relational calculus expressions, in "Proceedings, 1990 ACM PODS Conference," pp. 243-257.
52. D. E. Willard, Optimal sampling residues for differentiable data base query problems, J. Assoc. Comput. Mach. 38 (1991), 104-119.
53. D. E. Willard, Applications of the fusion tree method to computational geometry and searching in "Proceedings, SODA-1992," pp. 286-295.
54. D. E. Willard and G. S. Lueker, Adding range restriction capability to dynamic data structures, J. Assoc. Comput. Mach. 32 (1985), 597-617.
55. A. C. Yao, On the complexity of maintaining partial sums, SIAM J. Comput. 14 (1985), 277-288.