An algorithm for handling many relational calculus queries efficiently

Journal of Computer and System Sciences

Volumn 65, Issue 2, 2002, Pages 295-331

  Willard, Dan E ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYNCHRONOUS MACHINERY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; MATHEMATICAL MODELS; QUERY LANGUAGES;

COMBINATORICS ON WORDS; COMMUNICATION OF LANGUAGES; CONTEXT-FREE LANGUAGES; MORPHISMS; REVERSAL-BOUNDED COUNTERS;

DIFFERENTIATION (CALCULUS);

EID: 23844539328     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1848     Document Type: Article

References (79)

1. C. Beeri, R. Fagin, D. Maier, A. Mendelzon, J. Ullman, and M. Yannakakis, Properties of acyclic database schemes, in "STOC-1981," Milwaukee, WI, pp. 355-362, 1981.
2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes, JACM 30 (1983), 479-513.
3. J. Bentley, Multidimensional binary search trees used for associative searching, CACM 18 (1975), 509-517.
4. J. Bentley, Multidimensional divide-and-conquer, CACM 23 (1980), 214-229.
5. J. Bentley and H. Mauer, Efficient worst-case data structures for range searching, Acta. Inform. 13 (1980), 155-168.
6. J. Bentley and J. Saxe, Decomposable searching problems: Static to dynamic transformations, J. Algorithms 1 (1980), 301-358.
7. P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcia-Molina, J. Gray, J. Held, J. Heiterstein, H. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ullman, The Asilomar Report on Database Research, AMC Sigmod Rec. 27, 4 (1998), 74-80.
8. P. Bernstein and D. Chiu, Using semijoins to solve relational queries, JACM 21 (1981), 25-40.
9. P. Bernstein and N. Goodman, The power of natural semijoins, SIAM J. Comput. 10 (1981), 751-771.
10. K. Beyer and R. Ramakrishnan, Bottom-up computation of sparse iceberg cubes and maintenance of data cubes and summary data in a warehouse, in "SIGMOD-1999," Philadelphia, PA, pp. 359-370, 1999.
11. J. Cai and R. Paige, Binding performance of language design, in "POPL-1987," Montreal, Quebec, pp. 85-97.
12. B. Chazelle, Filter search: A new approach to query processing, SIAM J. Comput. 15 (1986), 703-724.
13. B. Chazelle, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput. 17 (1988), 427-462.
14. B. Chazelle, Lower bounds for orthogonal range searching, JACM 37 (1990), 200-212;
15. and also JACM 37 (1990), 439-463.
16. B. Chazelle and L. Guibas, Fractional cascading: A data structuring technique, Algorithmica \(1986), 133-162 and 163-191 (a 2-part article).
17. P. Deshpande and J. Naghton, Aggregate aware caching for multi-dimensional queries, in "EBDIT-2000," Lecture Notes in Computer Science, Vol. 1777, pp. 168-182, Springer-Verlag, Berlin, 2000.
18. P. Deshpande, K. Ramasamy, A. Shukla, and J. Naghton, Caching multidimensional queries using chunks, "SIGMOD-1998," Seattle, WA, pp. 259-270, 1998.
19. H. Edelsbrunner, A note on dynamic range searching, Bull. EATCS 15 (1981), 34-40.
20. H. Edelsbrunner and M. Overmars, Batch solutions to decomposable search problems, J. Algebra 5 (1985), 515-542.
21. R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes, JACM 30 (1983), 514-550.
22. M. Fredman, Lower bounds on some optimal data structures, SIAM J. Comput. 10 (198), 1-10.
23. M. Fredman, A lower bound on the complexity of range queries, JACM 28 (1981), 696-706.
24. M. Fredman and D. Willard, Surpassing the information theoretic barrier with fusion trees, J. Comput. System Sci. 47 (1993), 424-436.
25. S. Geffner, D. Agrawal, and A. Abbadi, The dynamic data cube, in "EBDIT-2000," Konstanz, Germany, pp. 237-253, 2000.
26. N. Goodman and O. Shmueli, Tree queries: A simple class of relational queries, ACM TODS 7 (1982), 653-677.
27. N. Goodman and O. Shmueli, Syntactic characterization of tree schemes, JACM 30 (1983), 767-786.
28. D. Goyal and R. Paige, The formal speedup of the linear time fragment of Willard's relational calculus subset, in "Algorithmic Languages and Calculi" (Bird and Meertens, Eds.), pp. 382-414, Chapman & Hall, 1997.
29. S. Grumbach, M. Rafnelli, and L. Tinini, Querying aggregate data, in "PODS-1999," Philadelphia, PA, pp. 174-184, 1999.
30. A. Gupta, V. Harinarayan, and D. Quass, Aggregate query processing in data warehousing applications, in "VLDB-1995," Zurich, Switzerland, pp. 358-369, 1995.
31. V. Harinarayan, A. Rajaraman, and J. Ullman, Implementing data cube efficiently, in "SIGMOD 1996," Montreal, Quebec, pp. 205-216, 1996.
32. J. Hellerstein, P. Haas, and H. Wang, On-line aggregation, in "SIGMOD-1997," Tucson, AZ, pp. 171-182, 1997.
33. C. Ho. R. Agrawal, N. Migiddo, and R. Srikant, Range queries in OLAP data cubes, in "SIGMOD1997," Tucson, AZ, pp. 73-88, 1997.
34. S. Koenig and R. Paige, A transformational framework for the automatic control of derived data, in "VLDB-1981," Cannes, France, pp. 306-318, 1981.
35. D. Lee and F. Preparata, Computational geometry: A survey, IEEE Trans. Comput. 33 (1984), 1072-1101.
36. D. Lee and C. 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.
37. Y. Lien, On the equivalence of database models, JACM 29 (1982), 333-362.
38. G. Lucker and D. Willard, A data structure for dynamic range queries, Inform. Process. Lett. 15 (1982), 209-213.
39. K. Mehlhorn, "Data Structures and Algorithms," Vol. 3, Multidimensional Searching and Computational Geometry, Springer-Verlag, Berlin, 1984.
40. K. Mehlhorn and S. Naher, Dynamic fractional cascading, Algorithmica 5 (1990), 215-241.
41. I. Mumick, D. Quass, and B. Mumick, Maintenance of data cubes and summary data in a warehouse, in "SIGMOD-1997," Tucson, AZ, pp. 100-111, 1997.
42. W. Nutt, Y. Sagiv, and S. Shuring, Deciding equivalence among aggregate queries, in "PODS-1998," Seattle, WA, pp. 214-223, 1998.
43. M. Overman, "The Design of Dynamic Data Structure," Lecture Notes in Computer Science, Vol. 156, Springer-Verlag, Berlin, 1983.
44. M. Overmars, Range searching on a grid, J. Algebra 9 (1988), 254-275.
45. M. Overmars and J. v. Leeuwen, Two general methods for dynamizing decomposable searching problems, Computing 26 (1981), 155-166.
46. G. Ozsoyoglu, Z. Ozsoyoglu, and V. Matos, Extending relational algebra and calculus with set-valued and aggregate functions, ACM TODS 25(4) (1996), 8-13.
47. R. Paige, "Formal Differentiation - A Program Synthesis Technique," UMI Research Press, 1981 (277pp);
48. revised Ph.D. thesis, NYU, June 1979, which appeared in Courant CS Rep 15, pp. 269-658, September 1979 .
49. R. Paige, Applications of finite differencing to database integrity control and query/transaction optimization, in "Advances in Database Theory," (H. Gallaire, J. Minker, and J. M. Nicolas, Eds.), Vol. 2, pp. 171-210, Plenum Press, New York, 1984.
50. R. Paige and F. Henglein, Mechanical translation of set theoretic problem specifications into efficient RAM code - A case study, J. Symbolic Comput. 4(2) (1987), 207-232.
51. C. Papadimitriou and M. Yannakakis, On the complexity of database queries, J. Comput. System Sci. 58 (1999), 407-427.
52. S. Rao, A. Badia, and D. Van Gucht, Providing better support for a class of decision support queries, in "SIGMOD-1996," Montreal, Quebec, pp. 217-227, 1996.
53. N. Rousspoulos, Y. Kotidis, and P. Rousspoulos, Cubetree: Organization of an bulk incremental updates on the data cube, In "SIGMOD-1997," Tucson, AZ, pp. 89-99, 1997.
54. Y. Sagiv and O. Shmeuli, Solving queries by tree projections, ACM TODS 18 (1993), 487-511.
55. S. Tsur, J. Ullman, S. Abiteboul, C. Clifton, R. Motwani, S. Nestorov, and A. Rosenthal, Query flocks, a generalization of association-rule mining, in "SIGMOD-1998," Seattle, WA, pp. 1-12, 1998.
56. S. Tsur and C. Zaniolo, LDL: A logic based data language, in "VLDB-1986," Kyoto, Japan, pp. 75-90, 1986.
57. J. Ullman, "Database and Knowledge Base Systems," Vols. I and II, Computer Science Press, Rockville, MD, 1989.
58. P. Vaidya, Space time tradeoffs for orthogonal range queries, in "STOC-1985," Providence, RI, pp. 169-174, 1985.
59. M. Vardi, The complexity of relational query languages, in "STOC-1982," San Francisco, CA, pp. 137-146, 1982.
60. M. Vardi, On the complexity of bounded-variable queries, in "STOC-1995," Las Vegas, NV, pp. 266-276, 1995.
61. D. Willard, "Predicate-Oriented Database Search Algorithms," Harvard Ph.D. dissertation, May 1978, published in the Garland Series of Outstanding Dissertations in Computer Science.
62. D. Willard, Efficient processing of relational calculus expressions using range query theory, in "SIGMOD-1984," Boston, MA, pp. 160-172.
63. D. Willard, New data structures for orthogonal queries, SIAM J. Comput. 14 (1985), 233-253.
64. D. Willard, On the application of sheared retrieval to orthogonal range queries, in "1986 Computational Geometry Conference," pp. 80-90, 1986.
65. D. Willard, Multidimensional search trees that provide new types of memory reductions, JACM 34 (1987), 846-858.
66. D. Willard, Lower bounds for the addition-subtraction operations in orthogonal range queries, Inform. Comput. 82 (1989), 45-64.
67. D. Willard, Quasi-linear algorithm for processing relational calculus expressions, in "PODS-1990," Nashville, TN, pp. 243-257, 1990.
68. D. Willard, Optimal sampling residues for differentiable database problems, JACM 38 (1991), 104-119.
69. D. Willard, Applications of range query theory to relational database selection and join operations, J. Comput. System Sci. 52 (1996), 157-169.
70. D. Willard, Examining computational geometry, Van Emde Boas trees and hashing from the perspective of the fusion tree, SIAM J. Comput. 29 (2000), 1030-1049.
71. D. Willard and G. Lueker, Adding range restriction capability to dynamic data structures, JACM 32 (1985), 597-617.
72. M. Yannakakis, Algorithms for acyclic database schemes, in "VLDB-1981," Cannes, France, pp. 82-94, 1981.
73. A. Yao, On the complexity of maintaining partial sums, SIAM J. Comput. 14 (1985), 277-288.
74. C. Yu, M. Ozsoyoglu, and K. Lam, Optimization of distributed tree distributed queries, J. Comput. System Sci. 29 (1984), 409-445;
75. in "IEEE-Compsac-1979," pp. 306-312, 1979.
76. M. Zaharioudakis, R. Cochrane, G. Lapis, H. Pirajesh, and M. Urata, Answering complex SQL queries using automatic summary tables, in "SIGMOD-2000," Dallas, TX, pp. 105-116, 2000.
77. C. Zaniolo, "Analysis and Design of Relational Schemata for Database Schemes," Ph.D. dissertation, 1976. Available as Tech Report UCLA-Eng-7669.
78. C. Zaniolo, Design and implementation of a logic based language for data intensive applications, in "Proceedings of the 5th Symposium on Logic Programming," Chicago, IL, pp. 1666-1687, 1988.
79. Y. Zhao, P. Deshpande and J. Naughton, An array-based algorithm for simultaneous multi-dimensional aggregates, in "SIGMOD-1997," Tucson, AZ, pp. 159-170, 1997.