Improving list comprehension database queries
- 13 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6, 186-192
- https://doi.org/10.1109/tencon.1989.176921
Abstract
The improvement of queries expressed as list comprehensions in a lazy functional language is described. The database literature identifies four algebraic and two implementation-based improvement strategies. For each strategy the authors show an equivalent improvement for queries expressed as list comprehensions. This means that well-developed database algorithms that improve queries using several of these strategies can be emulated to improve comprehension queries. They are also able to improve queries which require greater power than that provided by the relational algebra. Most of the improvements entail transforming a simple, inefficient query into a more complex, but more efficient form. The authors illustrate each improvement using examples drawn from the database literature.Keywords
This publication has 11 references indexed in Scilit:
- Types and persistence in database programming languagesACM Computing Surveys, 1987
- Lazy memo-functionsLecture Notes in Computer Science, 1985
- The promotion and accumulation strategies in transformational programmingACM Transactions on Programming Languages and Systems, 1984
- On optimizing an SQL-like nested queryACM Transactions on Database Systems, 1982
- An implementation technique for database query languagesACM Transactions on Database Systems, 1982
- Algorithm classification through synthesisThe Computer Journal, 1980
- A synthesis of several sorting algorithmsActa Informatica, 1978
- System RACM Transactions on Database Systems, 1976
- Query-by-examplePublished by Association for Computing Machinery (ACM) ,1975
- INGRESPublished by Association for Computing Machinery (ACM) ,1975