Algebraic query optimisation for database programming languages
β Scribed by Alexandra Poulovassilis; Carol Small
- Publisher
- Springer-Verlag
- Year
- 1996
- Tongue
- English
- Weight
- 189 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1066-8888
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
More and more relational database systems for microcomputers are providing visual interfaces, such as query by example (QBE). At the same time, experimental studies are providing more support for the theory that the end users can perform better with the entity relationship (ER) model than with the r
In 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database languages on instance-level. Their criterion was subsequently called BP-completeness. Since then, it was used frequently in the context of other database models. However, its application in the context of lan