Магия сохраняет силу



[A+85] Anon et al. A Measure of Transaction Processing Power. Datamation, April 1985.

[ABC+76] M. Astrahan et al. System R: Relational approach to database management. ACM TODS, 1(2), June 1976.

[AC89] F. Afrati and S. Cosmadakis. Expressiveness of Restricted Recursive Queries. In STOC 1989.

[Agr87] R. Agrawal. Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries. In Data Engineering 1987.

[BC81] P. Bernstein and D. Chiu. Using Semijoins to Solve Relational Queries. JACM, 28(1):25--40, 1981.

[BMSU86] F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic Sets and other Strange Ways to Implement Logic Programs. In PODS 1986.

[BR86] F. Bancilhon and R. Ramakrishnan. An Amateur's Introduction to Recursive Query Processing Strategies. In SIGMOD 1986.

[BR87] C. Beeri and R. Ramakrishnan. On the Power of Magic. In PODS 1987.

[Day87] U. Dayal. Of Nests and Trees: A Unified Approach to Processing Queries that Contain Nested Subqueries, Aggregates, and Quantifiers. In VLDB 1987.

[DB88] IBM. IBM Database 2 Performance Monitor Report Reference, December 1988. Number: IBM SH20­6858.

[GW87] R. Ganski and H. Wong. Optimization of Nested SQL Queries Revisited. In SIGMOD 1987.

[HFLP89] L. Haas, J. Freytag, G. Lohman, and H. Pirahesh. Extensible Query Processing in Starburst. In SIGMOD 1989.

[HN84] L. Henschen and S. Naqvi. On Compiling Queries in Recursive First­Order Databases. JACM, 31(1):47--85, January 1984.

[HP88] W. Hasan and H. Pirahesh. Query Rewrite Optimization in Starburst. IBM Research report, RJ 6367 (62349), August 1988.

[ISO89] ISO ANSI. ISO­ANSI Working Draft: Database Language SQL2 and SQL3; X3H2; ISO/IEC JTC1/SC21/WG3, 1989.

[Kim82] W. Kim. On Optimizing an SQL­like Nested Query. TODS, 7(3), Sep 1982.

[Loh88] G. Lohman. Grammar­like Functional Rules for Representing Query Optimization Alternatives. In SIGMOD 1988.

[Loo86] C. Loosley. Measuring IBM Database 2 Release 2 ­ The Benchmark Game. InfoDB, 1(2), 1986.

Содержание  Назад  Вперед