Parallelizing a database programming language
Brian Hart, Scott H. Danforth, Patrick Valduriez · International Symposium on Databases for Parallel and Distributed Systems · 1988
We extend distributed database query optimization techniques to support a database programming language, a language much richer than relational query languages. With the richness comes difficulties, e.g., how to recognize joins and how to handle aliases. In this paper we describe our techniques: dataflow analysis, abstract evaluation, partial evaluation, and rewriting. Also, we overview the algorithm that uses these techniques.
Cited by 16 works. doi:10.5555/62597.62607
Authors
References
- A relational model of data for large shared data banks
- Compilers: Principles, Techniques, and Tools
- Communicating Sequential Processes
- Communicating sequential processes
- Scale and performance in a distributed file system
- Access path selection in a relational database management system
- Abstract interpretation
- Can programming be liberated from the von Neumann style?
- Actors: A Model of Concurrent Computation in Distributed Systems
- Viewing control structures as patterns of passing messages