A "complex" query is one that requires a number of query processing algorithms to work together, and a "large" database uses files with sizes from several megabytes to many terabytes, which are typical for database applications at present and in the near future.

Download PDF

References

1. Adam and Wortmann 1989: N. R. Adam and J. C. Wortmann, Security-Control Methods for Statistical Databases:A Comparative Study, ACM Computing Surveys 21, 4 (December 1989), 515.
2. Agrawal and DeWitt 1984: R. Agrawal and D. J. DeWitt, Whither Hundreds of Processors in a Database Machine, Proc. Int’l. Workshop on High-Level Architecture, Los Angeles, CA, 1984.
3. Ahn and Snodgrass 1988: I. Ahn and R. Snodgrass, Partitioned storage for temporal databases, Inf. Sys. 13, 4 (1988), 369.
4. Albert 1991: J. Albert, Algebraic Properties of Bag Data Types, Proc. Int’l. Conf. on Very Large Data Bases, Barcelona, Spain, September 1991, 211.
5. Analyti and Pramanik 1992: A. Analyti and S. Pramanik, Fast Search in Main Memory Databases, Proc. ACM SIGMOD Conf., San Diego, CA, June 1992, 215.
6. Anderson, Tzou, and Graham 1988: D. P. Anderson, S. Y. Tzou, and G. S. Graham, The DASH Virtual Memory System, November 1988.
7. Antoshenkov 1993: G. Antoshenkov, Dynamic Query Optimization in Rdb/VMS, Proc. IEEE Int’l. Conf. on Data Eng., Vienna, Austria, April 1993, 538.
8. Astrahan et al. 1976:Watson,System R: A Relational Approach to Database Management, ACM Trans. on Database Sys. 1, 2 (June 1976), 97. Reprinted in M. Stonebraker, Readings in Database Sys., Morgan-Kaufman, San Mateo, CA, 1988.Astrahan et al. 1976:Watson,System R: A Relational Approach to Database Management, ACM Trans. on Database Sys. 1, 2 (June 1976), 97. Reprinted in M. Stonebraker, Readings in Database Sys., Morgan-Kaufman, San Mateo, CA, 1988.

Back