How to comprehend queries functionally

Journal of Intelligent Information Systems

Volumn 12, Issue 2, 1999, Pages 191-218

  Grust, Torsten ^a   Scholl, Marc H ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; DATA STRUCTURES; FUNCTIONS; OPTIMIZATION; PROGRAM COMPILERS; RECURSIVE FUNCTIONS;

FUNCTIONAL PROGRAMMING DOMAIN; RELATIONAL ALGEBRA; USER LEVEL QUERIES;

QUERY LANGUAGES;

EID: 0032652173     PISSN: 09259902     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008705026446     Document Type: Article

References (48)

1. Bird, R.S. (1987). An Introduction to the Theory of Lists. In M. Broy (Ed.), Logic of Programming and Calculi of Design. NATO ASI Series. Springer Verlag, vol. 36, pp. 5-42.
2. Breazu-Tannen, V., Buneman, P., and Wong, L. (1992). Naturally embedded query languages. Proc. of the Int'l Conference on Database Theory (ICDT) (pp. 140-154). Berlin, Germany.
3. Breazu-Tannen, V. and Subrahmanyam, R. (1991). Logical and computational aspects of programming with sets/bags/lists. Proc. of the 18th Int'l Colloquium on Automata, Languages and Programming (pp. 60-75). Madrid, Spain.
4. Buneman, P., Libkin, L., Suciu, D., Tannen, V., and Wong, L. (1994). Comprehension Syntax. ACM SIGMOD Record, 23, 87-96.
5. Buneman, P., Naqvi, S., Tannen, V., and Wong, L. (1995). Principles of Programming with Complex Objects and Collection Types. Theoretical Computer Science, 149(1), 3-48.
6. Burstall, R.M. and Darlington, J. (1977). A Transformation System for Developing Recursive Programs. Journal of the ACM, 24(1), 44-67.
7. Cattell, R.G. and Barry, D.K. (Eds.) (1997). The Object Database Standard: ODMG 2.0, San Francisco, CA: Morgan Kaufmann. Release 2.0.
8. Claussen, J., Kemper, A., Moerkotte, G., and Peithner, K. (1997). Optimizing queries with universal quantification in object-oriented databases. Proc. of the 23rd Int'l Conference on Very Large Databases (VLDB). Athens, Greece.
9. Cluet, S. and Moerkotte, G. (1993). Nested queries in object bases. Proc. of the 4th Int'l Workshop on Database Programming Languages (DBPL).
10. Fegaras, L. (1993). Efficient optimization of iterative queries. Proc. of the 4th Int'l Workshop on Database Programming Languages (DBPL) (pp. 200-225).
11. Fegaras, L. (1994). A Uniform Calculus for Collection Types. Technical Report 94-030, Oregon Graduate Institute of Science & Technology.
12. Fegaras, L. and Maier, D. (1995). Towards an effective calculus for object query languages. Proc. of the ACM SIGMOD Int'l Conference on Management of Data.
13. Freytag, J. C. and Goodman, N. (1986a). Rule-based translation of relational queries into iterative programs. Proc. of the ACM SIGMOD Int'l Conference on Management of Data (pp. 206-214). Washington, DC, USA.
14. Freytag, J.C. and Goodman, N. (1986b). Translating aggregate queries into iterative programs. Proc. of the 12th Int'l Conference on Very Large Data Bases (VLDB) (pp. 138-146). Kyoto, Japan.
15. Freytag, J.C. and Goodman, N. (1989). On the Translation of Relational Queries into Iterative Programs. ACM Transactions on Database Systems, 14(1), 1-27.
16. Gill, A.J. (1996). Cheap Deforestation for Non-Strict Functional Languages. Ph.D. dissertation, Department of Computing Science, University of Glasgow.
17. Gill, A.J., Launchbury, J., and Peyton-Jones, S.L. (1993). A Short Cut to Deforestation. Functional Programming & Computer Architecture (pp. 223-232).
18. Gluche, D., Grust, T., Mainberger, C., and Scholl, M.H. (1997). Incremental updates for materialized OQL views. Proc. of the 5th Int 'I Conference on Deductive and Object-Oriented Databases (DOOD '97) (pp. 52-66). Montreux, Switzerland.
19. Goguen, J.A., Thatcher, J.W., and Wagner, E.G. (1978). An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types. In R.T. Yeh (Ed.), Current Trends in Programming Methodology. Prentice Hall, vol. 4, chap. 5, pp. 81-149.
20. Graefe, G. (1990). Encapsulation of parallelisms in the volcano query processing system. Proc. of the ACM SIGMOD Int'l Conference on Management of Data (pp. 102-111). Atlantic City, NJ, USA.
21. Graefe, G. (1993). Query Evaluation Techniques for Large Databases. ACM Computing Surveys, 25(2), 73-170.
22. Grant, M. (1989). Homomorphisms and promotability. Proc. of the Int'l Conference on Mathematics of Program Construction (pp. 335-347). Groningen, The Netherlands.
23. Grust, T., Kröger, J., Gluche, D., Heuer, A., and Scholl, M.H. (1997). Query evaluation in CROQUE-Calculus and algebra coincide. Proc. of the 15th British National Conference on Databases (BNCOD) (pp. 84-100). London: Birkbeck College.
24. Grust, T. and Scholl, M.H. (1996). Translating OQL into Monoid Comprehensions - Stuck with Nested Loops? Technical Report 3/1996, Faculty of Mathematics and Computer Science, Database Research Group, University of Konstanz.
25. Grust, T. and Scholl, M.H. (1998). Query Deforestation. Technical Report 68/1998, Faculty of Mathematics and Computer Science, Database Research Group, University of Konstanz.
26. Hudak, P., Peyton Jones, S.L., Wadler, P. et al. (1992). Report on the Programming Language Haskell. ACM SIGPLAN Notices, 27(5).
27. Kemp, G.J.L., Iriarte, J.J., and Gray, P.M.D. (1994). Efficient access to FDM objects stored in a relational database. Proc. of the 12th British National Conference on Databases (BNCOD) (pp. 170-186). Guildford, UK.
28. Kim, W. (1982). On Optimizing an SQL-like Nested Query. ACM Transactions on Database Systems, 7(3), 443-469.
29. Launchbury, J. and Sheard, T. (1995). Warm fusion: Deriving build-catas from recursive definitions. Proc. of the ACM Conference on Functional Programming and Computer Architecture (FPCA). La Jolla, CA.
30. Lieuwen, D.F. and DeWitt, D.J. (1992). A transformation based approach to optimizing loops in database programming languages. Proc. of the ACM SIGMOD Int'l Conference of Management of Data (pp. 91-100). San Diego, CA.
31. Meijer, E., Fokkinga, M., and Paterson, R. (1991). Functional programming with bananas, lenses, envelopes, and barbed wire. Proc. of the ACM Conference on Functional Programming and Computer Architecture (FPCA). Number 523 in Lecture Notes in Computer Science (LNCS) (pp. 124-144). Cambridge, USA: Springer Verlag.
32. Nakano, R. (1990). Translation with Optimization from Relational Calculus to Relational Algebra Having Aggregate Functions. ACM Transactions on Database Systems, 15(4), 518-557.
33. Ohori, A. (1990). Representing Object Identity in a Pure Functional Language. In P.C. Kanellakis and S. Abiteboul (Eds.), Proc. of the 3rd Int'l Conference on Database Theory (ICDT). Number 470 in Lecture Notes in Computer Science (LNCS) (pp. 41-55). Paris, France: Springer Verlag.
34. Paton, N.W. and Gray, P.M.D. (1990). Optimising and Executing DAPLEX Queries Using Prolog. The Computer Journal, 33(6), 547-555.
35. Poulovassilis, A. and King, P. (1990). Extending the functional data model to computational completeness. Proc. of the 2nd Int'l Conference on Extending Database Technology (EDBT), number 416 in Lecture Notes in Computer Science (LNCS) (pp. 75-91). Venice, Italy: Springer Verlag.
36. Poulovassilis, A. and Small, C. (1996). Algebraic Query Optimisation for Database Programming Languages. The VLDB Journal, 5(2), 119-132.
37. Poulovassilis, A. and Small, C. (1997). Formal foundations for optimising aggregation functions in database programming languages. Proc. of the 6th Int'l Workshop on Database Programming Languages (DBPL). Estes Park, Colorado, USA.
38. Rich, C., Rosenthal, A., and Scholl, M.H. (1993). Reducing duplicate work in relational join(s): A unified approach. Proc. of the Int'l Conference on Information Systems and Management of Data (CISMOD) (pp. 87-102). Delhi, India.
39. Schek, H.-J. and Scholl, M.H. (1986). The relational model with relation-valued attributes. Information Systems, 11(2), 137-147.
40. Steenhagen, H.J. (1995). Optimization of Object Query Languages. Ph.D. dissertation, Department of Computer Science, University of Twente.
41. Steenhagen, H.J., Apers, P.M., Blanken, H.M., and de By, R.A. (1994). From nested-loop to join queries in OODB. Proc. of the 20th Int'l Conference on Very Large Databases (VLDB) (pp. 618-629). Santiago, Chile.
42. Steinbrunn, M., Peithner, K., Moerkotte, G., and Kemper, A. (1995). Bypassing joins in disjunctive queries. Proc. of the 21st Int'l Conference on Very Large Databases (VLDB) (pp. 228-238).
43. Suciu, D. and Wong, L. (1995). On two forms of strutural recursion. Proc. of the 5th Int'l Conference on Database Theory (ICDT) (pp. 111-124). Prague, Czech Republic.
44. Trinder, P. (1991). Comprehensions, a query notation for DBPLs. Proc. of the 3rd Int'l Workshop on Database Programming Languages (DBPL) (pp. 55-68). Nafplion, Greece.
45. Vance, B. (1992). Towards an Object-Oriented Query Algebra. Technical Report 91-008, Oregon Graduate Institute of Science & Technology.
46. Wadler, P. (1990a). Comprehending monads. Conference on Lisp and Functional Programming (pp. 61-78).
47. Wadler, P. (1990b). Deforestation: Transforming Programs to Eliminate Trees. Theoretical Computer Science, 73, 231-248.
48. Wong, L. (1994). Querying Nested Collections. Ph.D. dissertation, University of Pennsylvania, Philadelphia.