Range nesting: A fast method to evaluate quantified queries

ACM SIGMOD Record

Volumn 13, Issue 4, 1983, Pages 196-206

  Jarke, Matthias ^a   Koch, Jürgen ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976843406     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/971695.582225     Document Type: Article

References (23)

1. Aho, A.V., Sagiv, Y., Ullman, J.D., “Efficient Optimization of a Class of Relational Expressions”, ACM-TODS 4 (1979), 435-454.
2. Bernstein, P.A., Chiu, D.M. “Using Semi-Joins to Solve Relational Queries”, JACM 28 (1981), 25-40.
3. Bernstein, P.A., Goodman, N. “The Power of inequality Semijoins”, Inform. Systems 6 (1981), 255-265.
4. Bernstein, P.A., Blaustein, B.T. “Fast Methods for Testing Quantified Relational Calculus Assertions”, Proc. ACM-SIGMOD Conf., Orlando, 1982, 39-50.
5. Chandra, A.K., Merlin, P.M. “Optimal implementation of Conjunctive Queries in Relational Data Bases”, Proc. 9th Annual ACM Symp. on Theory of Computation, Boulder, Col., 1977.
6. Clausen, S.E. “Optimizing the Evaluation of Calculus Expressions in a Relational Database System”, Inform. Systems 5 (1980), 41-54.
7. Codd, E.F. “Relational Completeness of Data Base Sublanguages”, in Courant Computer Science Symposia, New York, prentice Hall 1972.
8. Dayal, O., Goodman, N. “Query Optimization for CODESYL Database Systems”, proc. ACM-SIQ40D Conf., Orlando 1982, 138-150.
9. Hall, P.A.V. “Optimization of Single Expressions in a Relational Data Base System”, IBM Res. Develop. 20 (1976), 244-257.
10. Jarke, M., Schmidt, J.W. “Evaluation of First-Order Relational Expressions”, Technical Report 78, Oniyersi taet Hamburg, Fachbereich Informatik, June 1981.
11. Jarke, M., Schmidt, J.W. “Query Processing Strategies in the PASCAL/R Relational Database Management System”, Proc. ACM-SIGMOD Conf., Orlando, 1982, 256-264.
12. Jarke, M., Koch, J., Mall, M., Schmidt, J.W. “Query Optimization Research in the Database Programming Languages (DBPL) Project”, Database Engineering 5, 3 (1982), 11-14.
13. Kim, W. “On Optimizing an SQL-like Nested Query”, ACM-ToDS 7 (1982), 443-469.
14. Klug, A. “Access Paths in the ‘ABE’ Statistical Query Facility”, Proc. ACM-SIGMOD Conf., Orlando, 1982, 161-173.
15. Nilsson, N. “Principles of Artificial Intelligence”, Springer, 1982.
16. Palermo, F.P. “A Data Base Search Problem”, Proc 4th Comp, and Inform. Sc. Symp., Miami Beach, 1972, 67-101.
17. Rosenkrantz, D.J., Hunt, M.B. “Processing Conjunctive Predicates and Queries”, Proc. 6th VLDB, Montreal, 1980, 64-74.
18. Schmidt, J.W. “Some High Level Language Constructs for Data of Type Relation”, ACM-ToDS 2 (1977).
19. Schmidt, J.W., Mall, M., Koch, J., Jarke, M. “Database Programming Languages”, Proc. Database Interface Workshop, Philadelphia, October 1982.
20. Shmueli, O. “Hie Fundamental Role of Tree Schemas in Relational Query Processing”, PhD thesis, Harvard 1981.
21. Smith, J.M., Chang, P.Y.T. “Optimizing the Performance of a Relational Algebra Database Interface”, CACM 18 (1975), 568-579.
22. Valduriez, P. “Semi-Join Algorithms for Multi-Processor Systems”, Proc. ACM-SIGMOD Conf., Orlando 1982, 225-233.
23. Wong, E., Youssefi, K. “Decomposition - A Strategy for Query Processing”, ACM-ToDS 1 (1976), 223-241.