Goetz Graefe
Skip Abstract Section
Abstract
Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On the contrary, modern data models exacerbate the problem: In order to manipulate large sets of complex objects as efficiently as today's database systems manipulate simple records, query-processing algorithms and software will become more complex, and a solid understanding of algorithm and architectural issues is essential for the designer of database management software.
This survey provides a foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation techniques for both relational and postrelational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set-matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.
- ADAM, N. R., AND WORTMA~N, J. C. 1989. Security-control methods for statistical databases: A comparative study. ACM Comput. Surv. 21, 4 {Dec. 1989), 515. Google Scholar
- AHN, I., AND SNODGRASS, R. 1988. Partitioned storage for temporal databases. Inf. Syst. 13, 4, 369. Google Scholar
- ALBERT, J. 1991. Algebraic properties of bag data types. In Proceedings of the International Conference on Very Large Data Bases. VLDB Endowment, 211. Google Scholar
- ANALYTI, A., AND PRAMANm, S. 1992. Fast search in main memory databases. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 215. Google Scholar
- ANDERSON, D. P., Tzou, S. Y., AND GRAHAM, G. S. 1988. The DASH virtual memory system. Tech. Rep. 88/461, Univ. of California--Berkeley, CS Division, Berkeley, Calif. Google Scholar
- ANTOSHENKOV, G. 1993. Dynamic query optimization in Rdb/VMS. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York. Google Scholar
- ASTRAHAN, M. M., BLASGEN, M. W., CHAMBERLIN, D. D., ESWARAN, K. P., GRAY, J. N., GRIFFITHS, P. P., KING, W. F., LORIE, R. A., MCJONES, P. R., MEHL, J. W., PUTZOLU, G. R., TRAIGER, I. L., WADE, B. W., AND WATSON, V. 1976. System R: A relational approach to database management. ACM Trans. Database Syst. 1, 2 (June), 97. Google Scholar
- ASTRAHAN, M. M., SCHKOLNICK, M., AND WHANG, K.Y. 1987. Approximating the number of unique values of an attribute without sorting, Inf. Syst. 12, 1, 11. Google Scholar
- ATKINSON, M. P., AND BUNEMANN, O. P. 1987. Types and persistence in database programmmg languages. ACM Comput. Surv. 19, 2 (June), 105. Google Scholar
- BABB, E. 1982. Joined Normal Form: A storage encoding for relational databases. ACM Trans. Database Syst. 7, 4 (Dec.), 588. Google Scholar
- BASS, E. 1979. Implementing a relational database by means of specialized hardware. ACM Trans. Database Syst. 4, 1 (Mar.), 1. Google Scholar
- BAEZA-YATES, R. A., AND LARSON, P.A. 1989. Performance of B + -trees with partial expansions. IEEE Trans. Knowledge Data Eng. 1, 2 (June), 248. Google Scholar
- BANCmHON, F., AND RAMAKmSHNAN, R. 1986. An amateur's introduction to recursive query processing strategies. In Proceedings of the ACM SIGMOD Conference. ACM, New York, 16. Google Scholar
- BARGHOUTI, N. S., AND KAISER, G.E. 1991. Concurrency control in advanced database applications. ACM Comput. Surv. 23, 3 (Sept.), 269. Google Scholar
- BARU, C. K., AND FRIEDER, O. 1989. Database operations in a cube-connected multicomputer system. IEEE Trans. Comput. 38, 6 (June), 920. Google Scholar
- BATINI, C., LENZERINI, M., AND NAVATHE, S. B. 1986. A comparative analysis of methodologies for database schema integration. ACM Coraput. Surv. 18, 4 (Dec.), 323. Google Scholar
- BATORY, D. S., BARNETT, J. R., GARZA, J. F., SMITH, K. P., TSUKUDA, K., TWICHELL, B. C., AND WISE, T. E. 1988a. GENESIS: An extensible database management system, IEEE Trans. Softw. Eng. 14, 11 (Nov.), 1711. Google Scholar
- BATORY, D. S., LEUNG, T. Y., AND WISE, T.E. 1988b. Implementation concepts for an extensible data model and data language. ACM Trans. Database Syst. 13, 3 (Sept.), 231. Google Scholar
- {ref20}BAUGSTO, B., AND GREmSLAND, J. 1989. Parallel sorting methods for large data volumes on a hypercube database computer. In Proceedings of the 6th International Workshop on Database Machines (Deauville, France, June 19 21). Google Scholar
- BAYER, R., AND MCCREIGHTON, E. 1972. Organisation and maintenance of large ordered indices. Acta Informatica 1, 3, 173.Google Scholar
- BECK, M., BITTON, D., AND WmKINSON, W.K. 1988. Sorting large files on a backend multiprocessor. IEEE Trans. Comput. 37, 7 (July), 769. Google Scholar
- BECKER, B., SIX, H. W., AND WIDMAYER, P. 1991. Spatial priority search: An access technique for scaleless maps. In Proceedings of ACM SIG- MOD Conference. ACM, New York, 128. Google Scholar
- BECKMANN, N., KRIEGEL, H. P., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of ACM SIGMOD Conference. ACM, New York, 322. Google Scholar
- BELL, T., WITTEN, I. H., AND CLEARY, J.G. 1989. Modelling for text compression. ACM Comput. Surv. 21, 4 (Dec.), 557. Google Scholar
- BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (Sept.), 509. Google Scholar
- BERNSTEIN, P. A., AND GOODMAN, N. 1981. Concurrency control in distributed database systems. ACM Comput. Surv. 13, 2 (June), 185. Google Scholar
- BERNSTEIN, P. A., GOODMAN, N., WONG, E. REEVE, C. L., AND ROTHNIE, J.B. 1981. Query processing in a system for distributed databases (SDD-1). ACM Trans. Database Syst. 6, 4 (Dec.), 602. Google Scholar
- BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, Mass. Google Scholar
- BERRA, P. B., CHUNG, S. M., AND SACHEM, N. I. 1987. Computer architecture for a surrogate file to a very large data/knowledge base. IEEE Comput. 20, 3 (Mar), 25. Google Scholar
- BERTINO, E. 1991. An indexing technique for object-oriented databases. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 160. Google Scholar
- BERTINO, E. 1990. Optimization of queries using nested indices. In Lecture Notes in Computer Science, vol. 416. Springer-Verlag, New York. Google Scholar
- BERTINO, E., AND K/M, W. 1989. Indexing techniques for queries on nested objects. IEEE Trans. Knowledge Data En~. 1, 2 (Juno), 196. Google Scholar
- BmDE, A. 1988. An analysis of three transaction processing architectures. In Proceedings of the International Conference on Very Large Data Bases (Los Angeles, Aug.). VLDB Endowment, 339. Google Scholar
- BHIDE, A., AND STONEBRAKER, M. 1988. A performance comparison of two architectures for fast transaction processing. In Proceedtngs of the IEEE Conference on Data Engmeertng. IEEE, New York, 536. Google Scholar
- BITTON, D., AND DEWITT, D. J. 1983. Duplicate record elimination in large data files. ACM Trans. Database Syst. 8, 2 (June), 255. Google Scholar
- BITTON-FRIEDLAND, D. 1982. Design, analysis, and implementation of parallel external sorting algorithms PhD. Thesis, Univ. of Wisconsin-Madison.Google Scholar
- BITTON, D, AND GRAY, J 1988. Disk shadowing. In Proceedings of the International Conference on Very Large Data Bases. (Los Angeles, Aug.). VLDB Endowment, 331 Google Scholar
- BITTON, D., DEWI2T, D J., HSIAO, D. K. AND MENON, J. 1984 A taxonomy of parallel sorting. ACM Comput, Surv. 16, 3 (Sept.), 287. Google Scholar
- BITTON, D., HANRAHAN, M. B., AND TURBYFILL, C. 1987. Performance of complex queries in main memory database systems. In Proceedings of the IEEE Conference on Data Engzneering. IEEE, New York. Google Scholar
- BLAKELEY, J. A., AND MARTIN, N. L. 1990 Join index, materialized view, and hybrid hash-join: A performance analysis In Proceedings of the IEEE Con/~rence o, Data Engineering IEEE, New York. Google Scholar
- BI,AKELEY, J. A, COBURN, N., AND LARSON, P. A. 1989. Updating derived relations: Detecting irrelevant and autonomously computable updates. ACM Trans Database Syst 14, 3 (Sept.), 369 Google Scholar
- BLASGEN, M., AND ESWARAN, K. 1977. Storage and access in relational databases. IBM Syst. J. 1G, 4, 363.Google Scholar
- BLASGEN, M., AND ESWARAN, K. 1976. On the evaluation of queries in a relational database system IBM Res. Rep RJ 1745, IBM, San Jose, Calif.Google Scholar
- BLOOM, B H. 1970 Space/time tradeoffs in hash coding with allowable errors Commun. ACM 13, 7 (July), 422. Google Scholar
- BORAL, H. 1988. Parallelism in Bubba. In Proceedings of the International Symposium on Databases ~n Parallel and Distributed Systems (Austin, Tex., Dec.), 68. Google Scholar
- BORAL, H., AND DEWITT, D. J. 1983. Database machines: An idea whose time has passed? A critique of the future of database machines. In Proceedings of the International Workshop on Database Machines. Reprinted in Parallel Architectures for Database Systems. IEEE Computer Society Press, Washington, D.C., 1989. Google Scholar
- BORAL, I-I., ALEXANDER, W., CLAY, L., COPELAND, G., DANFORTH, S., FRANKLIN, M., HART, B., SMITH, M., AND VALDURIEZ, P. 1990. Prototyping Bubba, A Highly Parallel Database System. IEEE Trans. Knowledge Data Eng. 2, 1 (Mar.), 4. Google Scholar
- BRATBERGSENGEN, K. 1984. Hashing methods and relational algebra operations. In Proceedzngs of the Internaaonal Conference on Very Large Data Bases. VLDB Endowment, 323. Google Scholar
- BROWN, K. P., CAREY, M. J., DEWITT, D. J., MEHTA, M., AND NAUGHTON, J. F. 1992. Scheduling issues for complex database workloads. Computer Science Tech. Rep. 1095, Univ. of Wisconsin--Madison.Google Scholar
- BUCHERAL, P., THEVERIN, J. M., AND VALDURIEZ, P. 1990. Efficient main memory data management using the DBGraph storage model. In Procee&ngs of the International Conference on Very Large Data Bases. VLDB Endowment. 683. Google Scholar
- BUNEMAN, P., AND FRANKEL, R.E. 1979. FQL--A Functional Query Language. In Procee&ngs of ACM SIGMOD Conference. ACM, New York, 52. Google Scholar
- BUNEMAN, P., FRANKEL, R. E., AND NI~m, R. 1982 An implementation technique for database query languages. ACM Trans. Database Syst. 7, 2 (June), 164. Google Scholar
- CACACE, F., CEm, S., AND HOUTSMA, M A.W. 1992. A survey of parallel execution strategies for transitive closures and }og4c programs To appear in Dtstr. Parall. Databases. Google Scholar
- CAREY, M. J., DEWITT, D. J., RICHARDSON, J. E., AND SHEKITA, E.J. 1986. Object and file management in the EXODUS extensible database system. In Proceedings of the International Conference on Very Large Data Bases. VLDB Endowment, 91. Google Scholar
- CARHS, J. V. 1986. HAS: A relational algebra operator, or divided is not enough to conquer. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 254. Google Scholar
- CARTER, J. L., AND WEGMAN, M.N. 1979. Universal classes of hash functions. J. Comput. Syst. Scz. 18, 2, 143.Google Scholar
- CHAMBERLIN, D. D., ASTRAHAN, M M., BLASGEN, M. W., GRAY, J. N., KING, W. F., LINDSAY, B. G., LORIE, R., MEHL, J. W., PRICE, T. G., PUTZOLO, F, SELINGER, P. G., SCHKOLNIK, M., SLUTZ, D. R., TRAIGER, I. L, WADE, B. W., AND YOST, R. A. 1981a. A history and evaluation of System R. Commun ACM 24, 10 (Oct.), 632. Google Scholar
- CHAMBERLIN, D. D., ASTRAHAN, M. M., KING, W r., LomE, R. A., MEHL, J. W., PRICE, T. G., SCHKOLNIK, M., SELINGER, P G., SLUTZ, D. R., WADE, B. W., AND YOST, R. A. 1981b. Support for repetitive transactions and ad hoc queries in System R. ACM Trans. Database Syst. 6, 1 (Mar), 70. Google Scholar
- CHEN, P.P. 1976. The entity relationship model --Toward a umfied view of data. ACM Trans. Database Syst. 1, 1 (Mar.), 9. Google Scholar
- CHEN, H, AND KUCK, S.M. 1984. Combining relational and network retrieval methods. In Proceedings o{ ACM SIGMOD Conference. ACM, New York, 131. Google Scholar
- CHEN, M. S., Lo, M. L., Yu, P. S., AND YOUNG, H C 1992. Using segmented right-deep trees for the execution of pipelined hash joins. In Proceedmgs of the International Conference on Veiny Large Data Bases (Vancouver, BC, Canada). VLDB Endowment, 15. Google Scholar
- CHENG, J., HADERLE, D., HEDGES, R., IYER, B. R., MESSINGER, T., MOHAN, C., AND WANG, Y. 1991. An efficient hybrid join algorithm: A DB2 prototype. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 171. Google Scholar
- CHERITON, D. R., GOOSEN, H. A., AND BOYLE, P. D. 1991 Paradig~n: A highly scalable sharedmemory multicomputer. IEEE Cornput. 24, 2 (Feb.), 33. Google Scholar
- CHIU, D. M., AND HO, Y.C. 1980. A methodology for interpreting tree queries into optimal semijoin expressions. In Proceedings of ACM SIG- MOD Conference. ACM, New York, 169. Google Scholar
- CHOU, H. T. 1985. Buffer management of database systems. Ph.D. thesis, Univ. of Wisconsin--Madison. Google Scholar
- CHOU, H. T., AND DEWITT, D.J. 1985. An evaluation of buffer management strategies for relational database systems. In Proceedings of the International Conference on Very Large Data Bases (Stockholm, Sweden, Aug.). VLDB Endowment, 127. Reprinted in Readings in Database Systems. Morgan-Kaufman, San Mateo, Calif., 1988. Google Scholar
- CHRISTODOULAKIS, S. 1984. Implications of certain assumptions in database performance evaluation. ACM Trans. Database Syst. 9, 2 (June), 163. Google Scholar
- CHUNG, S. M., AND BERRA, P.B. 1988. A comparison of concatenated and superiirtposed code word surrogate files for very large data/knowledge bases. In Lecture Notes in Computer Science, vol. 303. Springer-Verlag, New York, 364. Google Scholar
- CLUET, S., DELOBEL, C., LECLUSE, C., ANn RICHARD, P. 1989. Reloops, an algebra based query language for an object-oriented database system. In Proceedings of the 1st International Conference on Deductive and Object-Ortented Databases (Kyoto, Japan, Dec. 4-6).Google Scholar
- COM~n, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2 (June), 121. Google Scholar
- COPELAND, G., ALEXANDER, W., BOUGHTER, E., AND KELLER, T. 1988. Data placement in Bubba. In Proceedings of ACM SIGMOD Conference. ACM, New York, 99. Google Scholar
- DADAM, P., KUESPERT, K., ANDERSON, F., BLANKEN, H., ERBE, R., GUENAUER, J., LUM, V., PISTOR, P., AND WALCH, G. 1986. A database management prototype to support extended NF2 relations: An integrated view on flat tables and hierarchiog. In Proceedzngs of ACM SIGMOD Conference. ACM, New York, 356. Google Scholar
- DANIELS, D., AND NG, P. 1982. Distributed query compilation and processing in R*. IEEE Database Eng. 5, 3 (Sept.).Google Scholar
- DANIELS, S., GRAEFE, G., KELLER, T., MAIER, D., SCHMIDT, D., AND VANCE, B. 1991. Query optimization in revelation, an overview. IEEE Database Eng. 14, 2 (June). Google Scholar
- DAVIDSON, S. B., GARCIA-MOLINA, H., AND SKEEN, D. 1985. Consistency in partitioned networks. ACM Comput. Surv. 17, 3 (Sept.), 341. Google Scholar
- DAVIS, D. D. 1992. Oracle's parallel punch for OLTP. Datamation (Aug. 1), 67.Google Scholar
- DAVISON, W. 1992. Parallel index building in Informix OnLine 6.0. In Proceedings of ACM SIGMOD Conference. ACM, New York, 103. Google Scholar
- DEPPISCH, U., PAUL, H. B., AND SCHEK, H.J. 1986. A storage system for complex objects. In Proceedings of the International Workshop on Object-Orzented Database Systems (Pacific Grove, Calif., Sept.), 183. Google Scholar
- DESHPANDE, V., AND LARSON, P.A. 1992. The design and implementation of a parallel join algorithm for nested relations on shared-memory multiprocessors. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 68. Google Scholar
- DESHPANDE, V., AND LARSON, P.A. 1991. An algebra for nested relations with support for nulls and aggregates. Computer Science Dept., Univ. of Waterloo, Waterloo, Ontario, Canada.Google Scholar
- DESHPANDE, A., AND VAN GUCHT, D. 1988. An implementation for nested relational databases. In Proceedzngs of the International Conference on Very Large Data Bases (Los Angeles, Calif., Aug.) VLDB Endowment, 76. Google Scholar
- DEWI~?, D.J. 1991. The Wisconsin benchmark: Past, present, and future. In Database and Transaction Processing System Performance Handbook. Morgan-Kaufman, San Mateo, Calif.Google Scholar
- DEWITT, D. J., m'~D G~RBER, R.H. 1985. Multiprocessor hash-based join algorithms. In Proceedings of the International Conference on Very Large Dato Bases (Stockholm, Sweden, Aug.). VLDB Endowment, 151.Google Scholar
- DEWITT, D. J., AND GRAY, J. 1992. Parallel database systems: The future of high-performance database systems. Commun. ACM 35, 6 June), 85. Google Scholar
- DEWITT, D. J., AND HAWTHORN, P. B. 1981. A performance evaluation of database machine architectures. In Proceedings of the International Conference on Very Large Data Bases (Cannes, France, Sept.). VLDB Endowment, 199.Google Scholar
- DEWITT, D. J., GERBER, R. H., GRAEFE, G., HEYTENS, M. L., KUMAR, K. B., AND MURALIKRISHNA, M. 1986. GAMMA--A high performance dataflow database machine. In Proceedings of the International Conference on Very Large Data Bases. YI, Dt~ Endowment;, 228. Reprinted in Readings in Database Systems. Morgan~Kaufman, San Mateo, Calif., 1988. Google Scholar
- DEWITT, D. J., GHANDEHARIZADEH, S., AND SCHNEI- DER, D. 1988. A performance analysis of the GAMMA database machine. In Proceedings of ACM SIGMOD Conference. ACM, New York, 350 Google Scholar
- DEWITT, D. J., GHANDEHARIZADEH, S., SCHNEIDER, D., BRICKER, A., HSIAO, H. I., AND RASMUSSEN, R. 1990. The Gamma database machine project. IEEE Trans. Knowledge Data Eng. 2, 1 (Mar.). 44. Google Scholar
- DEWITT, D. J., KATZ, R., OLKEN, F., SHAPIRO, L., STONEBRAKER, M., AND WOOD, D. 1984. hnplementation techniques for main memory database systems In Proceedings of ACM SIG- MOD Conference. ACM, New York, 1. Google Scholar
- DEWITT, D., NAUGHTON, J., ANn BVRDER, J. 1993. Nested loops revisited. In Proceedings of Parallel and Distributed {nformat~on Systems (San Diego, Calif., Jan.). Google Scholar
- DEWITT, D. J., NAUGHTON, J. E., AND SCHNEIDER, D.A. 1991a. An evaluation of non-equijoin algorithms. In Proceedings of the International Conference on Very Large Data Bases (Barcelona, Spain). VLDB Endowment, 443 Google Scholar
- DEWITT, D., NAUGHTON, J., AND SCHNEIDER, D. 1991b Parallel sorting on a shared-nothing architecture using probabilistic splitting. In Proceedings of the International Conference on Parallel and Distributed Information Systems (Miami Beach, Fla, Dec.) Google Scholar
- DOZmR, J.1992. Access to data in NASA's Earth observing systems. In Proceedings of ACM SIGMOD Conference. ACM, New York, 1. Google Scholar
- EFEELSBERG, W., AND HAERDER, T. 1984. Principles of database buffer management. ACM Trans. Database Syst. 9, 4 (Dec), 560. Google Scholar
- ENBODY, R. J., AND DU, H. C. 1988. Dynamic hashing schemes ACM Cornput. Surv. 20, 2 (June), 85. Google Scholar
- ENGLERT, S., GRAY, J., KOCHER, R., AND SHAH, P. 1989. A benchmark of nonstop SQL release 2 demonstrating near-linear speedup and scaleup on large databases. Tandem Computers Tech. Rep. 89.4, Tandem Corp., Cupertino, Calif.Google Scholar
- EPSTEIN, R. 1979. Techniques for processing of aggregates in relational database systems UCB/ERL Memo. M79/8, Univ. of California, Berkeley, Calif.Google Scholar
- EPSTEIN, R., AND STONEBRAKER, M. 1980. Analysis of distributed data base processing strategies. In Proceedings o/the International Conference on Very Large Data Bases iMontreal, Canada, Oct.). VLDB Endowment, 92.Google Scholar
- EPSTEIN, R , STONEBRAKER, M., AND WONG, E. 1978 Distributed query processing in a relational database system. In Proceedings of ACM SIGMOD Conference. ACM, New York. Google Scholar
- FAGIN, R., NIEVERGELT, J., PIPPENGER, N., AND STRONG, H. R. 1979. Extendible hashing: A fast access method for dynamic files. ACM Trans. Database Syst. 4, 3 (Sept.), 315. Google Scholar
- FALOUTSOS, C 1985. Access methods for text. ACM Comput. Surv. 17, 1 (Mar.), 49. Google Scholar
- FALOUTSOS, C., NG, R., AND SELLIS, T. 1991. Predictive load control for flexible buffer allocation. In Proceedings of the Internattonal Conference on Very Large Data Bases (Barcelona, Spain). VLDB Endowment, 265. Google Scholar
- FANG, M. T., LEE, R. C. T., AND CHANG, C.C. 1986. The idea of declustering and its applications. In Proceedings of the Internatwnal Conference on Very Large Data Bases (Kyoto, Japan, Aug.). VLDB Endowment, 181. Google Scholar
- FINKEL, R. A., AND BENTLEY, J. L. 1974. Quad trees: A data structure for retrieval on composite keys. Acta Informatzca 4, 1, 1.Google Scholar
- FREYTAG, J. C., AND GOODMAN, N. 1989 On the translation of relational queries into iteratlve programs. ACM Trans. Database Syst. 14, 1 (Mar.), 1. Google Scholar
- FUSHIMI, S., KITSUREGAWA, M., AND TANAKA, H. 1986. An overview of the system software of a parallel relational database machine GRACE. In Proceedings of the International Conference on Very Large Data Bases (Kyoto, Japan, Aug.). ACM, New York, 209. Google Scholar
- GALLAIRE, H., MINKER, J., AND NICOLAS, J M. 1984. Logic and databases A deductive approach. ACM Comput. Surv. 16, 2 (June), 153 Google Scholar
- GERSER, R. H. 1986. Datafiow query processing using multiprocessor hash-partitioned algorithms. Ph.D. thesis, Univ. of Wisconsin Madison. Google Scholar
- GHANDEHARIZADEH, S., AND DEWITT, D. J. 1990. Hybrid-range partitioning strategy: A new declusterlng strategy for multiprocessor database machines. In Proceedmgs of the International Conference on Very Large Data Bases (Brisbane, Australia). VLDB Endowment, 481. Google Scholar
- GOODMAN, J. R., AND WORST, P. J 1988. The Wisconsin Multicube: A new large-scale cachecoherent multiprocessor. Computer Science Tech Rep. 766, Umv. of Wisconsin MadisonGoogle Scholar
- GOUDA, M. G_ AND DAYAL, U. 1981. Optimal semijoin schedules for query processing in local distributed database systems. In Proceedtngs of ACM SIGMOD Conference. ACM, New York, 164. Google Scholar
- GRAEFE, G. 1993a. Volcano, An extensible and parallel datafiow query processing system. IEEE Trans. Knowledge Data Eng. To be published.Google Scholar
- GRAEFE, G. 1993b. Performance enhancements for hybrid hash join Available as Computer Science Tech. Rep. 606, Univ. of Colorado, Boulder.Google Scholar
- GRAEFE, G. 1993c Sort-merge-join: An idea whose time has passed? Revised in Portland State Univ. Computer Science Tech. Rep. 93-4.Google Scholar
- GRAEFF~, G. 1991. Heap-filter merge join' A new algorithm for joining medium-size inputs. IEEE Trans. So/hr. Eng. 17, 9 (Sept.), 979. Google Scholar
- GRAEFE, G. 1990a. Parallel external sorting in Volcano. Computer Science Tech. Rep. 459, Umv. of Colorado, Boulder.Google Scholar
- GRAEFE, G. 1990b. Encapsulation of parallelism in the Volcano query processing system. In Proceedings of ACM SIGMOD Conference. ACM, New York, 102. Google Scholar
- GRAE~E, G. 1989. Relational division: Four algorithms and their performance. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 94. Google Scholar
- GRAEFE, G., AND COLE, R. L. 1993. Fast algorithms for universal quantification in large databases. Portland State Univ. and Univ. of Colorado at Boulder.Google Scholar
- GRAEFE, G., AND DAVISON, D.L. 1993. Encapsulation of parallelism and architecture-independence in extensible database query processing, IEEE Trans. Softw. Eng. 19, 7 (July). Google Scholar
- GRAErE, G., AND DEWITT, D. J. 1987. The EXODUS optimizer generator. In Proceedings of ACM SIGMOD Conference. ACM, New York, 160. Google Scholar
- GRAEFE, G., AND MAIER, D. 1988. Query optimization in object-oriented database systems: A prospectus. In Advances in Object-Oriented Database Systems, vol. 334. Springer-Verlag, New York, 358. Google Scholar
- GRAEFE, G., AND McKENNA, W.J. 1993. The Volcano optimizer generator: Extensibility and efficient search. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York. Google Scholar
- GRAEFE, G., AND SHAPIRO, L.D. 1991. Data compression and database performance. In Proceedings of the ACM/IEEE-Computer Science Symposium on Applied Computing. ACM/IEEE, New York.Google Scholar
- GRAEFE, G., AND WARD, K. 1989. Dynamic query evaluation plans. In Proceedings of ACM SIGMOD Conference. ACM, New York, 358. Google Scholar
- GRAErE, G., AND WOLNmWICZ, R.H. 1992. Algebraic optimization and parallel execution of computations over scientific databases. In Proceedings of the Workshop on Metadata Management in Sc~ent~ftc Databases (Salt Lake City, Utah, Nov. 3-5).Google Scholar
- GRAEFE, G., COLE, R. L., DAVISON, D. L., McKENNA, W. J., AND WOLNmW~CZ, R.H. 1992. Extensible query optimization and parallel execution in Volcano. In Query Processing for Advanced Database Applications. Morgan-Kaufman, San Mateo, Calif.Google Scholar
- GRASFE, G., LINWLLE, A., AND SHAPIRO, L.D. 1993. Sort versus hash revisited. IEEE Trans. Knowledge Data Eng. To be published.Google Scholar
- GRAY, J. 1990. A census of Tandem system availability between 1985 and 1990. Tandem Computers Tech. Rep. 90.1, Tandem Corp., Cupertino, Calif.Google Scholar
- GRAY, J., AND PUTZOLO, F. 1987. The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time. In Proceedings of ACM SIGMOD Conference. ACM, New York, 395. Google Scholar
- GRAY, J., AND REUTER, A. 1991. Transaction Processing: Concepts and Technzques. Morgan- Kaufman, San Mateo, Calif. Google Scholar
- GRAY, J., MCJONES, P., BLASGEN, M., LINDSAY, B., LORIE, R., PRICE, T., PUTZOLO, F., AND TRAIGER, I. 1981. The recovery manager of the System R database manager. ACM Comput. Surv. 13, 2 (June), 223. Google Scholar
- GRUENWALD, L., AND EICH, M. H. 1991. MMDB reload algorithms. In Proceedings of ACM SIGMOD Conference. ACM, New York, 397. Google Scholar
- GUENTHER, O., AND BILMES, J. 1991. Tree-based access methods for spatial databases: Implementation and performance evaluation. IEEE Trans. Knowledge Data Eng. 3, 3 (Sept.), 342. Google Scholar
- GUIBAS, L., AND SEDGEWICK, R. 1978. A dichromatic framework for balanced trees. In Proceedings of the 19th Symposium on the Foundations of Computer Science.Google Scholar
- GUNADm, H., AND SEGEV, A. 1991. Query processing algorithms for temporal intersection joins. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 336. Google Scholar
- GUNADHI, H., AND SEGEV, A. 1990. A framework for query optimization in temporal databases. In Proceedings of the 5th Internatzonal Conference on Statistical and Sc~el~tific Database Management. Google Scholar
- GUNTHER, O. 1989. The design of the cell tree: An object-oriented index structure for geometric databases. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 598. Google Scholar
- GUNTHER, O., AND WANG, E. 1987 A dual space representation for geometric data. In Proceedngs of the International Conference on Very Large Data Bases (Brighton, England, Aug.). VLDB Endowment, 501. Google Scholar
- Guo, M., Su, S. Y. W., AND LAM, H. 1991. An association algebra for processing objectoriented databases. In Proceedings of the IEEE Co,ference on Data Engineering. IEEE, New York, 23. Google Scholar
- GUTTMAN, A. 1984. R-Trees: A dynamic index structure for spatial searching. In Proceedings of ACM SIGMOD Conference. ACM, New York, 47. Reprinted in Readings in Database Systems. Morgan-Kaufman, ~an Mateo, Calif., 1988. Google Scholar
- HAAS, L., C~ANG, W., LEHMAN, G., McPHERSON, J., WILMS, P. F., LAPIS, G., LINDSAY, B., PIRAHESH, H., CAREY, M. J., AND SHEKITA, E. 1990. Starburst mid-flight: As the dust clears. IEEE Trans. Knowledge Data Eng. 2, i (Mar.), 143. Google Scholar
- HAAS, L., FREYTAG, J. C, LEHMAN, G., AND PIr~qHESH, H. 1989. Extensible query processing in Starburst. In Proceedings of ACM SIGMOD Conference. ACM, New York, 377. Google Scholar
- HAAs, L. M., SELINGER, P. G., BERTINO, E., DANIELS, D., LINDSAY, B., LEHMAN, G., MASUNAGA, Y., MOHAN, C., NG, P., WmMs, P., AND YOST, R. 1982. R*: A research project on distributed relational database management. IBM Res. Division, San Jose, Calif.Google Scholar
- HAERDER, T., AND REUTER, A. 1983. Principles of transaction-oriented database recovery. ACM Comput. Surv. 15, 4 (Dec.). Google Scholar
- HAFEZ, A., AND OZSOYOGLU, G. 1988. Storage structures for nested relations. IEEE Database Eng. 11, 3 (Sept.), 31. Google Scholar
- HAGMANN, R. B. 1986. An observation on database buffering performance metrics. In Proceedings of the International Conference on Very Large Data Bases (Kyoto, Japan, Aug.). VLDB Endowment, 289. Google Scholar
- HAMMING, R. W. 1977. Digital Filters. Prentice- Hall, Englewood Cliffs, N.J.Google Scholar
- HANSON, E.N. 1987. A performance analysis of view materialization strategies. In Proceedings of ACM SIGMOD Conference. ACM, New York, 440. Google Scholar
- HENmCH, A., S~x, H. W., AND WmMA~, P. 1989. The LSD tree: Spatial access to multidimensional point and nonpoint objects. In Proceedings of the International Conference on Very Large Data Bases (Amsterdam, The Netherlands). VLDB Endowment, 45. Google Scholar
- HOEL, E. G., AND SAMET, H. 1992. A qualitative comparison study of data structures for large linear segment databases. In Proceedings of ACM SIGMOD Conference. ACM. New York, 205. Google Scholar
- HcNG, W., AND STONEBRAKER, M. 1993. Optimization of parallel query execution plans in XPRS. Distrib. Parall. Databases 1, 1 (Jan.), 9. Google Scholar
- HONG, W., ANn STONEBRA~<ER, M. 1991. Optimization of parallel query execution plans in XPRS. In Proceedings of the International Conference on Parallel and Distrlbuted Information Systems (Miami Beach, Fla., Dec.). Google Scholar
- Hou, W. C., AND OZSOYOGLU, G. 1993. Processing time-constrained aggregation queries in CASE- DB. ACM Trans. Database Syst. To be published. Google Scholar
- Hou, W. C., AND OZSOYOGLU, G. 1991. Statistical estimators for aggregate relational algebra queries. ACM Trans. Database Syst. 16, 4 (Dec.), 600. Google Scholar
- HGU, W. C., OZSOYOGLU, G., AND DOGDU, E. 1991. Error-constrained COUNT query evaluation in relational databases. In Proceedings of ACM SIGMOD Conference. ACM, New York, 278. Google Scholar
- HSIAO, H. I., AND DEWITT, D. J. 1990. Chained declustering: A new availability strategy for multiprocessor database machines. In Proceed- ~ngs of the IEEE Conference on Data Engineerin~'. IEEE, New York, 456. Google Scholar
- HUA, K. A., AND LEE, C. 1991. Handling data skew in multicomputer database computers using partition tuning. In Proceedings of the International Conference on Very Large Data Bases (Barcelona, Spain). VLDB Endowment, 525. Google Scholar
- HUA, K. A., AND LEE, C. 1990. An adaptive data placement scheme for parallel database computer systems. In Proceedings of the International Conference on Very Large Data Bases (Brisbane, Australia). VLDB Endowment, 493. Google Scholar
- HUDSON, S. E., AND FANG, R. 1989. Cactis: A selfadaptive, concurrent implementation of an object-oriented database management system. ACM Trans. Database Syst. 14, 3 (Sept.), 291. Google Scholar
- HULL, R., AND KING, R. 1987. Semantic database modeling: Survey, applications, and research issues. ACM Comput. Surv. 19, 3 (Sept.), 201. Google Scholar
- HUTFLESZ, A., S~x, H. W., AND WIDMAYER, P. 1990. The R-File: An efficient access structure for proximity queries. In Proceedings of the IEEE Conference on Data Engineenng. IEEE, New York, 372. Google Scholar
- HUTFLESZ, A., Six, H. W., AND WIDMAYER, P. 1988a. Twin grid files: Space optimizing access schemes. In Proceedings of ACM S}GMOD Conference. ACM, New York, 183. Google Scholar
- HUTFLESZ, A., SIX, H. W., AND WIDMA~R, P. 1988b. The twin grid file: A nearly space optimal index structure. In Lecture Notes tn Computer Science, vol. 303. Springer-Verlag, New York, 352. Google Scholar
- IOANNIDIS, Y. E., AND CHRISTODOULAKIS, S. 1991. On the propagation of errors in the size of join results. In Proceedings of ACM S{GMOD Conference. ACM, New York, 268. Google Scholar
- IYER, B. R., AND DIAS, D.M. 1990. System issues in parallel sorting for database systems. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 246. Google Scholar
- JAG^DISH, H.V. 1991. A retrieval technique for similar shapes. In Proceedings of ACM SIGMOD Conference. ACM, New York, 208. Google Scholar
- JARKE, M., AND KOCH, J. 1984. Query optimization in database systems, ACM Comput. Surv. 16, 2 (June), 111. Google Scholar
- JARKE, M., AND VASSILIOU, Y. 1985. A framework for choosing a database query language. ACM Comput. Surv. 17, 3 (Sept.), 313. Google Scholar
- KATZ, R.H. 1990. Towards a unified framework for version modeling in engineering databases. ACM Comput. Surv. 22, 3 (Dec.), 375. Google Scholar
- KATZ, R. H., AND WONG, E. 1983. Resolving conflicts in global storage design through replication. ACM Trans'. Database Syst. 8, 1 (Mar.), 110. Google Scholar
- KELLER, T., GRAEFE, G., AND MAIER, D. 1991. Efficient assembly of complex objects. In Proceedings of ACM SIGMOD Conference. ACM, New York, 148. Google Scholar
- KEMPER, A., AND MOERKOTTE G. 1990a. Access support in object bases. In Froceeclings of ACM SIGMOD Conference. ACM, New York, 364. Google Scholar
- KEMPER, A., AND MOERKOTTE, G. 1990b. Advanced query processing in object bases using access support relations. In Proceedings of the International Conference on Very Large Data Bases (Brisbane, Australia). VLDB Endowment, 290. Google Scholar
- KEMPER, A., AND WaLL~TH, M. 1987. An analysis of geometric modeling in database systems. ACM Comput. Surv. 19, 1 (Mar.), 47. Google Scholar
- KEMPER, A., KILGER, C., AND MOERKOTTE, G. 1991. Function materialization in object bases. In Proceedings of ACM SIGMOD Conference. ACM, New York, 258. Google Scholar
- KERNIGHAN, B. W., AND RITCHIE, D.M. 1978. The C Programming Language. Prentice-Hall, Englewood Cliffs, N.J. Google Scholar
- KIM, W. 1984. Highly available systems for database applications. ACM Comput. Surv. 16, 1 (Mar.), 71. Google Scholar
- KIM, W. 1980. A new way to compute the product and join of relations. In Proceedings of ACM SIGMOD Conference. ACM, New York, 179. Google Scholar
- KITSUREGAWA, M., AND OGAWA, Y. 1990. Bucket spreading parallel hash: A new, robust, parallel hash join method for skew in the super database computer (SDC). In Proceedings of the International Conference on Very Large Data Bases (Brisbane, Australia). VLDB Endowment, 210. Google Scholar
- KiTSUREGAWA, M., NAKAYAMA, M., AND TAKAGI, M. 1989a. The effect of bucket size tuning in the dynamic hybrid GRACE hash join method. In Proceedings of the International Conference on Very Large Data Bases (Amsterdam, The Netherlands). VLDB Endowment, 257. Google Scholar
- KiTSUREGAWA, M., TANAKA, H., AND MOTOOKA, T. 1983. Application of hash to data base machine and its architecture. New Gener. Camput. 1, 1, 63.Google Scholar
- KITSUREGAWA,M., YANG, W.,AND FUSHIMI,S. 1989b. Evaluation of 18-stage pipeline hardware sorter. In Proceedings of the 6th International Workshop on Database Machines (Deauville, France, June 19-21). Google Scholar
- KLUG, A. 1982. Equivalence of relational algebra and relational calculus query languages having aggregate functions. J. ACM 29, 3 (July), 699. Google Scholar
- KNAPP, E. 1987. Deadlock detection in distributed databases. ACM Comput. Surv. 19, 4 (Dec.), 303. Google Scholar
- KNUTH, n. 1973. The Art of Computer Programm~ng. Vol. III, Sorttng and Searching. Addison-Wesley, Reading, Mass. Google Scholar
- KOLOVSON, C. P., AND STONEBRAKER M. 1991. Segment indexes: Dynamic indexing techniques for multi-dimensional interval data. In Proceedings of ACM SIGMOD Conference. ACM, New York, 138. Google Scholar
- KooL R.P. 1980. The optimization of queries in relational databases. Ph.D. thesis, Case Western Reserve Univ., Cleveland, Ohio. Google Scholar
- KooI, R. P., AND FRANI~'ORTH, D. 1982. Query optimization in Ingres. IEEE Database Eng. 5, 3 (Sept.), 2.Google Scholar
- KRmGEL, H. P., ANn SEEGER, B. 1988. PLOP- Hashing: A grid file without directory. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 369. Google Scholar
- KRIEGEL, H. P., AND SEEGER, B. 1987. Multidimensional dynamic hashing is very efficient for nonuniform record distributions. In Proceedings of the IEEE Conference on Data Engtneering. IEEE, New York, 10. Google Scholar
- KRISHNAMURTHY, R., BORAL, H., AND ZANIOLO, C. 1986. Optimization of nonrecursive queries. In Proceedings of the International Conference on Very Large Data Bases (Kyoto, Japan, Aug.). VLDB Endowment, 128. Google Scholar
- KUESPERT, K., SAAKE, G., AND WEGNER, L. 1989. Duplicate detection and deletion in the extended NF2 data model. In Proceedings' of the 3rd International Conference on the Foundations of Data Organization and Algorithms (Paris, France, June). Google Scholar
- KUMAR, V., AND BURGER, A. 1991. Performance measurement of some main memory database recovery algorithms. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 436. Google Scholar
- LAKSHMI, M. S., AND YU, P.S. 1990. Effectiveness of parallel joins. IEEE Trans. K, owledge Data Eng. 2, 4 (Dec.), 410. Google Scholar
- LAKSHMI, M. S., AND Yu, P. S. 1988. Effect of skew on join performance in parallel architectures. In Proceedings of the International Symposntm on Databases in Parallel and Distributed Systems (Austin, Tex., Dec.), 107. Google Scholar
- LANKA, S., AND MAYS, E. 1991. Fully persistent B + -trees. In Proceedings of ACM SIGMOD Conference. ACM, New York, 426. Google Scholar
- LARSON, P.A. 1981. Analysis of index-sequential files with overflow chaining. ACM Trans. Database Syst. 6, 4 (Dec.), 671. Google Scholar
- LARSON, P., AND YANG, H. 1985. Computing queries from derived relations. In Proceedings of the International Conference on Very Large Data Bases (Stockholm, Sweden, Aug.). VLDB Endowment, 259.Google Scholar
- LEHMAN, T. J., AND CAREY, M. J. 1986. Query processing in main memory database systems. In Proceedings of ACM SIGMOD Conference. ACM, New York, 239. Google Scholar
- LELEWER, D. A., AND HIRSCHBERG, D. S. 1987. Data compression. ACM Comput. Surv. 19, 3 (Sept.), 261. Google Scholar
- LEUNG, T. Y. C., AND MUNTZ, R.R. 1992. Temporal query processing and optimization in multiprocessor database machines. In Proceedzngs of the International Conference on Very Large Data Bases (Vancouver, }~C, Canada). VLDB Endowment, 383. Google Scholar
- LEUNC, T. Y. C., AND MUNTZ, R.R. 1990. Query processing in temporal databases. In Proceedings of the IEEE Conference on Data Engzneerrag. IEEE, New York, 200. Google Scholar
- L~, K., ANn NAUGHTON, J. 1988. Multiprocessor main memory transaction processing. In Proceedmgs of the Internatlonal Symposium on Databases ~n Parallel and Dzstmbuted Systems (Austin, Tex., Dec.), 177. Google Scholar
- LITWIN, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of the International Conference on VeW Large Data Bases (Montreal, Canada, Oct.). VLDB Endowment, 212. Reprinted in Readings in Database Systems. M organ-Kaufm an, San Mateo, Calif Google Scholar
- LITWIN, W., MARK. L., AND ROUSSOPOULOS, N. 1990. Interoperability of multiple autonomous databases. ACM Comput. Surv. 22, 3 (Sept.), 267. Google Scholar
- LOHMAN, G., MOHAN, C., HAAS, L., DANIELS, D., LINDSAY, B., SELINGER, P., AND WILMS, P. 1985. Query processing in R~. In Query Processing m Database Systems. Springer, Berlin, 31.Google Scholar
- LOMET, D. 1992. A review of recent work on multi-attribute access methods. ACM SIGMOD Rec. 21, 3 (Sept.), 56. Google Scholar
- LOMET, D., ANt) SALZBERG, B 1990a The performance of a multiversion access method. In Proceedings of ACM SIGMOD Conference ACM, New York, 353 Google Scholar
- LOMF~T, D. B, ANn SALZBURG, B. 1990b. The hB- tree A multlattnbute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15, 4 (Dec.), 625. Google Scholar
- Lorenz, R. A., AND NmSSON, J.F. 1979. An access specification language for a relational database management system IBM J. Res. Devel. 23, 3 (May), 286Google Scholar
- LOmE, R. A., AND YOUNG, H.C. 1989. A low communication sort algorithm for a parallel database machine. In Proceedings of the Internatmnal Conference on Very Large Data Bases (Am.qtordam. Tho Notherl~nd~). VLDB Endowment, 125. Google Scholar
- LYNCH, C A., AND BROWNRIGG, E.B. 1981. Application of data compression to a large bibliographic data base In Proceedings of the Internatmnal Conference on Very Large Data Bases (Cannes, France, Sept.). VLDB Endowment, 435Google Scholar
- LYYTINEN, K. 1987. Different perspectives on in formatmn systems: Problems and solutions. ACM Comput. Surv. 19, 1 (Mar.), 5. Google Scholar
- MACF&ZRT, L. F., AND LOHMAN, G.M. 1989 Index scans using a finite LRU buffer: A validated I/O model. ACM Trans Database Syst. 14, 3 (Sept.), 401. Google Scholar
- MAIER, D. 1983. The Theory of Relatzonal Databases. CS Press, Rockville, Md. Google Scholar
- MAmR, D., AND STEIN, J. 1986 Indexing m an object-oriented database management. In Proceedings of the Internatmnal Workshop on Object-Orzented Database Systems (Pacific Grove, Calif, Sept ), 171 Google Scholar
- MAIER, D., GRAEFE, G., SHAPIRO, L., DANIELS, S., KELLER, T., AND VANCE~ B. 1992 Issues in distributed complex object assembly In Proceedings of the Workshop on Distributed Object Management (Edmonton, BC, Canada, Aug.).Google Scholar
- MANNINO, M. V., C~u, P., ANn SAGER, T. 1988. Statistical profile estimation in database systems. ACM Comput. Surv. 20, 3 (Sept.). Google Scholar
- McKENzm, L. E., AND SNODGRASS, R. T. 1991. Evaluatmn of relational algebras incorporating the time dimension in databases. ACM Cornput. Surv. 23, 4 (Dec.). Google Scholar
- MEDEIROS, C., AND TOMPA, F. 1985. Understandmg the implications of view update pohcms. In Proceedings of the International Conference on Very Large Data Bases (Stockholm, Sweden, Aug.). VLDB Endowment, 316.Google Scholar
- MENOr4, J. 1986. A study of sort algorithms for multiprocessor database machines. In Proceedrags of the International Conference on Vel3~ Large Data bases (Kyoto, Japan, Aug ) VLDB Endowment, 197 Google Scholar
- MmHRA, P., AND EICH, M.H. 1992. Join processing in relational databases. ACM Comput. Surv. 24, i (Mar. L 63 Google Scholar
- MiTSCHANC~, B. 1989. Extending the relational algebra to capture complex objects. In Proceedrags of the Iaternatmnal Conference on Very Large Data Bases (Amsterdam, The Netherlandsl. VLDB Endowment, 297. Google Scholar
- MOHAN, C., HADERLE, D., WANG, Y., AND CHENG, J. 1990. Single table access using multiple indexes: Optimization, execution and concurrency control techniques. In Lecture Notes m Computer Science, vol. 416. Springer-Verlag, New York, 29. Google Scholar
- MOTRO, A. 1989. An access authorization model for relational databases based on algebraic manipulation of view definitions In Proceedings of the IEEE Conference on Data Engmeerz,~ IEEE, New York, 339 Google Scholar
- MULLIN, J K. 1990. Optimal semijoins for dmtributed database systems. IEEE Trans. Softw. Eng. 16, 5 (May), 558. Google Scholar
- NAKAYAMA, M., KITSUREGAWA, M., AND TAKAGI, M. 1988. Hash-partitioned join method using dynamic destaging ~trategy. In Proceechn~s of the Ir, ternat~onal Conference on Very Large Data Bases (Los Angeles, Aug.). VLDB Endowment, 468. Google Scholar
- NECHES, P M. 1988. The Ynet: An interconnect structure for a highly concurrent data base computer system. In Proceedings o/ the 2rid Symposium on the Frontiers of Massively Parallel Computatmn (Fairfax, Virginia, Oct.).Google Scholar
- NECHES, P M. 1984. Hardware support for advanced data management systems. IEEE Cornput. 17, 11 (Nov.), 29. Google Scholar
- NEUGEBAUER, L. 1991 Optimization and evaluation of database queries including embedded interpolation procedures. In Proceedings o/ ACM SIGMOD Conference. ACM, New York, 118. Google Scholar
- N~, R., FALOUTSOS, C., AND S~LLIS, T. 1991. Flexible buffer allocation based on marginal gains. In Proceedings of ACM SIGMOD Conference. ACM, New York, 387. Google Scholar
- NIEVERGELT, J., HINTERBERGER, H., AND SEVCIK, K.C. 1984. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9, I (Mar.), 38. Google Scholar
- NYBERG, C., BERCLAY, T., CVETANOVIC, Z., GRAY. J., AND LOMET, D. 1993. AlphaSort: A RISC machine sort. Teeh. Rep. 93.2. DEC San Francisco Systems Center. Digital Equipment Corp., San Francisco.Google Scholar
- OMIECINSKI, E. 1991. Performance analysis of a load balancing relational hash-join algorithm for a shared-memory multiprocessor. In Proceedings of the Internatwnal Conference on Very Large Data Bases (Barcelona, Spain). VLDB Endowment, 375. Google Scholar
- OMIECINSKI, E. 1985. Incremental file reorganization schemes. In Proceedings of the International Conference on Very Large Data Bases (Stockholm, Sweden, Aug.). VLDB Endowment, 346.Google Scholar
- OMIEClNSKL E., AND LIN, E. 1989. Hash-based and index-based join algorithms for cube and ring connected multicomputers. IEEE Trans. Knowledge Data Eng. 1, 3 (Sept.), 329. Google Scholar
- ONO, K., AND LOHMAN, G. M. 1990. Measuring the complexity of join enumeration in query optimization. In Proceedings of the International Conference on Very Large Data Bases (Brisbane, Australia). VLDB Endowment, 314. Google Scholar
- OUSTERHOUT, J. 1990. Why aren't operating systems getting faster as fast as hardware. In USENIX Summer Conference (Anaheim, Calif., June). USENIX.Google Scholar
- OZSOYOGLU, Z. M., AND WANG, J. 1992. A keying method for a nested relational database management system. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 438. Google Scholar
- OZSOYOGLU, G. OZSOYOGLU, Z. M., AND MATOS, V. 1987. Extending relational algebra and relational calculus with set-valued attributes and aggregate functions. ACM Trans. Database Syst. 12, 4 (Dec.), 566. Google Scholar
- Ozsu, M. T., AND VALDURIEZ, P. 1991a. Distributed database systems: Where are we now. IEEE Comput. 24, 8 (Aug.), 68. Google Scholar
- Ozsu, M. T., AND VALDURIEZ, P. 1991b. Principles of Distributed Database Systems. Prentice-Hall, Englewood Cliffs, N.J. Google Scholar
- PALMER, M., AND ZDONIK, S. B. 1991. FIDO: A cache that learns to fetch. In Proceedings of the International Conference on Very Large Data Bases (Barcelona, Spain). VLDB Endowment, 255. Google Scholar
- PECKHAM, J., AND MARYANSKI, F. 1988. Semantic data models. ACM Comput. Surv. 20, 3 (Sept.), 153. Google Scholar
- PIRAHESH, H., MOHA~, C., CHENG, J., LIU, T. S., AND SELINGER, P. 1990. Parallelism in relational data base systems: Architectural issues and design approaches. In Proceedings of the International Symposium on Databases ~n Parallel and Distributed Systems (Dublin, Ireland, July). Google Scholar
- QADAH, G.Z. 1988. Filter-based join algorithms on uniprocessor and distributed-memory multiprocessor database machines. In Lecture Notes ~n Computer Science, vol. 303. Springer-Verlag, New York, 388. Google Scholar
- REW, R. K., AND DAWS, G.P. 1990. The Unidata NetCDF: Software for scientific data access. In the 6th Internahonal Con/~rence on Interactive Information and Processing Systems for Meterology, Oceanography, and Hydrology (Anaheim, Calif.).Google Scholar
- RICHARDSON, J. E., AND CAnEY, M.J. 1987. Programming constructs for database system iraplementation m EXODUS. In Proceedings of ACM SIGMOD Conference. ACM, New York, 208. Google Scholar
- RICHARDSON, J. P., LU, H., AND MIKKiLINENI, K. 1987. Design and evaluation of parallel pipelined join algorithms. In Proceedings of ACM SIGMOD Conference. ACM, New York, 399. Google Scholar
- ROBINSON, J.T. 1981. The K-D-B-Tree: A search structure for large multidimensional dynamic indices. In Proceedtngs of ACM SIGMOD Conference. ACM, New York, 10. Google Scholar
- ROSENTHAL, A., AND REINER, D.S. 1985. Querying relational views of networks. In Query Processing in Database Systems. Springer, Berlin, 109.Google Scholar
- ROSENTHAL, h., RICH, C., AND SCHOLL, M. 1991. Reducing duplicate work in relational join(s): A modular approach using nested relations. ETH Tech. Rep., Zurich, Switzerland.Google Scholar
- ROTEM, D., AND SEGEV, A. 1987. Physical organization of temporal data. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 547. Google Scholar
- ROTH, M. A., KORTH, H. F., AND SILBERSCHATZ, A. 1988. Extended algebra and calculus for nested relational databases. ACM Trans. Database Syst. 13, 4 (Dec.), 389. Google Scholar
- ROTHNIE, J. B., BERNSTEIN, P. A., FOX, S., GOODMAN, N, HAMMER, M, LANDERS, T. A., REEVE, C., SHIPMAN, D. W., AND WONG, E. 1980. Introduction to a system for distributed databases (SDD-1). ACM Trans. Database Syst. 5, 1 (Mar.), 1. Google Scholar
- ROUSSOPOULOS, N. 1991. An incremental access method for ViewCache: Concept, algorithms, and cost analysis. ACM Trans. Database Syst. 16, 3 (Sept.), 535. Google Scholar
- ROUSSOPOULOS, N., AND KANG, H. 1991. A pipeline N-way join algorithm based on the 2-way semijoin program. IEEE Trans Knowledge Data Eng. 3, 4 (Dec.), 486. Google Scholar
- RUTH, S. S , AND KEUTZER, P J 1972. Data compression for business files. Datamatlon 18 (Sept.), 62.Google Scholar
- SAAKE, G., LINNEMANN, V., PISTOR, P, AND WEGNER, L. 1989. Sorting, grouping and duplicate elimination in the advanced information management prototype. In Proceedings of the International Conference on Very Large Data Bases VLDB Endowment, 307 Extended version in IBM Sci. Ctr. Heidelberg Tech. Rep 89 03.008, March 1989. Google Scholar
- SACCO, G 1987 Index access with a finite buffer. In Proceedings of'the International Con/erence on Very Large Data Bases (Brighton, England, Aug.) VLDB Endowment, 301. Google Scholar
- SACCO, G. M., AND SCHKOLNIK, M. 1986. Buffer management m relational database systems. ACM Trans. Database Syst. 11, 4 (Dec.), 473. Google Scholar
- SAcco, G M, AND SCHKOLNIK, M 1982. A mechanism for managing the buffer pool in a relational database system using the hot set model. In Proceedings o/the Internatmnal Con/erence on Very Large Data Bases (Mexmo City, Mexico, Sept.). VLDB Endowment, 257. Google Scholar
- SACKS-DAVIS, R., AND RAMAIVIOHANARAO, K. 1983. two-level superimposed coding scheme for partial match retrieval. In{. Syst. 8, 4, 273.Google Scholar
- SACKS-DAVIS, R., KENT, h., ANi) RAMAMOHANARAO, K 1987. Multikey access methods based on superimposed coding techniques. ACM Trans Database Svst. 12, 4 (Dec.), 655 Google Scholar
- SALZBERG, B. 1990 Merging sorted runs using large main memory Acta Informatica 27, 195 Google Scholar
- SALZBERG, B. 1988. File Structures: An Analytic Approach. Prentme-Hall, Englewood Cliffs, N.J. Google Scholar
- SALZBERG, B, TSUKERMAN~ A., GRAY, J., STEWART, M., UREN, S., AND VAVGNAN, B. 1990 Fast- Sort: A distributed single-input single-output external sort In Proceedings of ACM SIGMOD Conference ACM, New York, 94. Google Scholar
- SAMET, H. 1984. The quadtree and related hierarchical data structures. ACM Comput. Surv. 16, 2 (June), 187. Google Scholar
- SCHEK, H. J., AND SCROLL, M.H. 1986. The relational model with relation-valued attributes. I,f. Syst. 11, 2, 137. Google Scholar
- SCHNEIDER, D.A. 1991. Bit filtering and multiway join query processing. Hewlett-Packard Labs, Pale Alto, Calif. Unpublished MsGoogle Scholar
- SCHNEIDER, D.A. 1990. Complex query processing in muir(processor database machines. Ph.D. thesis, Univ. of Wisconsin Madison Google Scholar
- SCHNEIDER, D. A., AND DEWITT, D. J. 1990. Tradeoffs in processing complex join queries via hashing in muir(processor database machines. In Proceedings of the International Conference on Very Large Data Bases (Brisbane, Australia). VLDB Endowment, 469 Google Scholar
- SCHNEIDER, D., AND DEWITT, D. 1989. A perfornmnce evaluation of four parallel join algorithms in a shared-nothing multlprocessor environment. In Proceedings of ACM SIGMOD Conference ACM, New York, 110 Google Scholar
- SCHOLL, M.H. 1988. The nested relational model Efficient support for a relational database interface. Ph.D. thesis, Technical Univ. Darmstadt. In German.Google Scholar
- SCHOLL, M., PAUL, H. B., AND SCHEK, H. J 1987 Supporting fiat relations by a nested relational kernel. In Proceedings of the Internatmnal Conference on Very Large Data Bases (Brighton, England, Aug ) VLDB Endowment, 137. Google Scholar
- SEEGER, B., AND LARSON, P A 1991. Multi-disk B-trees. In Proceedings af A(!M SIGMOD Conference ACM, New York, 436. Google Scholar
- SEGEV, A, AND GUN^DHI, H. 1989. Event-join optimization in temporal relational databases. In Proceedings of the Internatwnal Conference on Very Large Data Bases (Amsterdam, The Netherlands). VLDB Endowment, 205. Google Scholar
- SEHNGE~, P. G., ASTr~AHAN, M. M, CHAMBERHN, D. D., LORIE, R. A., AND PRICE, T. G. 1979 Access path selection in a relational database management system In Proceedings of ACM SIGMOD Conference. ACM, New York, 23. Reprinted in Readings zn Database Systems Morgan-Kaufman, San Marco, Cali~, 1988. Google Scholar
- SEu~IS, T.K. 1987 Efficiently supporting procedures in relational database systems In Proceedmgs of ACM SIGMOD Conference. ACM, New York, 278. Google Scholar
- SEPPI, K., BARNES, J., AND MORRIS, C. 1989. A Bayesian approach to query optimization m large scale data bases The Univ. of Texas at Austin ORP 89-19, Austin.Google Scholar
- SERLIN, O. 1991. The TPC benchmarks. In Database and Transactmn Processing System Performance Handbook. Morgan-Kaufman, San Mateo, CallfGoogle Scholar
- SESHADRI, S, AND NAUGHTON, J F. 1992 Sampiing issues in parallel database systems In Proceedings of the International Conference on Extending Database Technology (Vienna, Austria, Mar.). Google Scholar
- SEVEPaNCF~, D.G. 1983. A practitioner's guide to data base compression. Inf. Syst. 8, 1, 51.Google Scholar
- SEVERANCE, D., AND LEHMAN, C~ 1976. Differential files: Their application to the maintenance of large databases ACM Trans. Database Syst. 1, 3 (Sept.). Google Scholar
- SEVERANCE, C., PRAMANIK, S., AND WOLBERG, P. 1990. Distributed linear hashing and parallel projection in main memory databases. In Proceedlngs of the Internatmnal Conference on Very Large Data Bases (Brisbane, Australia) VLDB Endowment, 674. Google Scholar
- SHAPIRO, L.D. 1986. Join processing in database systems with large main memories. ACM Trans. Database Syst. 11, 3 (Sept.), 239. Google Scholar
- SHAW, G. M., AND ZDONIK, S. B. 1990. A query algebra for object-oriented databases. In Proceedings of the IEEE Conference on Data Engineering. IEEE, New York, 154. Google Scholar
- SHAW, G., AND ZDOMK, S. 1989a. An objectoriented query algebra. IEEE Database Eng. 12, 3 (Sept.), 29. Google Scholar
- SHAW, G. M., AND ZDONIK, S. B. 1989b. An object-oriented query algebra. In Proceedings of the 2nd International Workshop on Database Programming Languages. Morgan-Kaufmann, San Mateo, Calif., 103. Google Scholar
- SHEKITA, E. J., AND CAREY, M.J. 1990. A perfbrmance evaluation of pointer-based joins. In Proceedings of ACM SIGMOD Conference. ACM, New York, 300. Google Scholar
- SHERMAN, S. W., AND BRICE. R. S. 1976. Performance of a database manager in a virtual memory system. ACM Trans. Database Syst. 1, 4 (Dec.), 317. Google Scholar
- SHETH, A. P., AND LARSON, J.A. 1990. Federated database systems for managing distributed, heterogeneous, and autonomous databases. ACM Comput. Surv. 22, 3 (Sept.), 183. Google Scholar
- SHmMAN, D, W. 1981. The functional data model and the data language DAPLEX. ACM Trans. Database Syst. 6, I (Mar.), 140. Google Scholar
- S~LER, A. 1988. VAR-PAGE-LRU: A buffer replacement algorithm supporting different page sizes. In Lecture Notes in Computer Science, vol. 303. Springer-Verlag, New York, 336. Google Scholar
- SILBERSCHATZ, A., STONERRAKER, M, AND ULLMAN, Z. 1991. Database systems: Achievements and opportunities. Commun. ACM 34, 10 (Oct.), 110. Google Scholar
- SIx, H. W., AND WIDMASYER, P. 1988. Spatial searching in geometric databases. In Proceedings of the IEEE Conference on Data Engtneering. IEEE, New York, 496. Google Scholar
- SMITH, J. M., AND CHANG, P. Y.T. 1975. Optimizing the performance of a relational algebra database interface. Commun. ACM 18, 10 (Oct.), 568. Google Scholar
- SNODGRASS, R. 1990. Temporal databases: Status and research directions. ACM SIGMOD Rec. 19, 4 (Dec.), 83. Google Scholar
- SOCKUT, G. H., AND GOLDBERG, R. P. 1979. Database reorganization Principles and practice. ACM Comput. Surv. 11, 4 (Dec.), 371. Google Scholar
- SRIN~VASAN, V., AND CARRY, M.J. 1992. Performance of on-line index construction algorithms. In Procee&ngs of the International Conference on Extending Database Technology (Vienna, Austria, Mar.). Google Scholar
- SRINIVASAN, Y., AND CAREY, M. J. 1991. Performance of B-tree concurrency control algorithms. In Procee&ngs of' ACM SIGMOD Conference. ACM, New York, 416. Google Scholar
- STAMOS, J. W., AND YOUNG, H. C. 1989. A symmetric fragment and replicate algorithm for distributed joins. Tech. Rep. RJ7188, IBM Research Labs, San Jose, Calif.Google Scholar
- STONEBRAKER, M. 1991. Managing persistent objects in a multi-level store. In Proceedings of ACM SIGMOD Conference. ACM, New York, 2. Google Scholar
- STONEBRAKER, M. 1987. The design of the POST- GRES storage system. In Proceedings of the International Conference on Very Large Data Bases (Brighton, England, Aug.). VLDB Endowment, 289. Reprinted in Readings in Database Systems. Morgan-Kaufman, San Matee, Calif., 1988. Google Scholar
- STONEBRAKER, M. 1986a. The case for sharednothing. IEEE Database Eng. 9, 1 (Mar.).Google Scholar
- STONEBRAKER, M. 1986b. The design and implementation of distributed INGRES. In The INGRES Papers. Addison-Wesley, Reading, Mass., 187. Google Scholar
- STONEBRAKER, M. 1981. Operating system support for database management. Commun. ACM Google Scholar
- STONEBRA~R, M. 1975. Implementation of integrity constraints and views by query modification. In Proceedings of ACM SIGMOD Conference ACM, New York. Google Scholar
- STONEBRAKER, M., AOKI, P., AND SELTZER, M. 1988a. Parallelism in XPRS. UCB/ERL Memorandum M89/16, Univ. of California, Berkeley.Google Scholar
- STONEBRAKER, M., JHINGRAN, A., GOH, J., AND POTAMIANOS, S. 1990a. On rules, procedures, caching and views in data base systems In Proceedings of ACM SIGMOD Conference. ACM, New York, 281 Google Scholar
- STONEBRAKER, M., KATZ. R., PATTERSON, D., AND OUSTERHOUT, J. 1988b. The design of XPRS. In Procee&ngs of tbe Internattonal Conference on Very Large Data Bases (Los Angeles, Aug.). VLDB Endowment, 318. Google Scholar
- STONRBRAKER, M., ROWE, L. A., AND HIROHAMA, M. 1990b. The implementation ofPostgres. IEEE Trans. Knowledge Data Eng. 2, 1 (Mar.), 125. Google Scholar
- STRAUBE, D. D., AND OZSU, M. T. 1989. Query transformation rules for an object algebra. ept. of Computing Sciences Tech. Rep. 89-23, Univ. of Alberta, Albertm Canada.Google Scholar
- Su, S~ Y.W. 1988. Database Computers: Principles, Archttectures and Techniques. McGraw- Hill, New York~ Google Scholar
- TANSP, L, A. U., AND GARNETT, L. 1992. On Roth, Korth, and Silberschatz's extended algebra and calculus for nested relational databases. ACM Trans. Database Syst. 17, 2 (June), 374. Google Scholar
- TEORO~, T. J., Y~G, D., ANn FRY, J.P. 1986. A logical design methodology for relational databases using the extended entity-relationship model. ACM Comput. Surv. 18, 2 (June). 197. Google Scholar
- TERADATA. 1983. DBC/1012 Data Base Computer, Concepts and Facilities. Teradata Corporation, Los Angeles.Google Scholar
- THOMAS, G., THO~rSON, G. R., CHUNG, C. W., BARKMEYER, E., CARTER, F., TEMPLETON, M., Fox, S., AND HARTMAN, B. 1990. Heterogeneous distributed database systems for production use. ACM Comput. Surv. 22, 3 (Sept.), 237. Google Scholar
- TOMPA, F. W., AND BLAKELEY, J A. 1988. Maintaining materialized views without accessing base data. Inf Syst. 13, 4, 393. Google Scholar
- TRAIC~ER, I. L. 1982. Virtual memory management for data base systems ACM Oper. Syst. Rev. 16, 4 (Oct.), 26. Google Scholar
- TRIAGER, I. L., GRAY, J., GALTIERI, C A., AND LiNDSAY, B. G. 1982. Transactions and consistency in distributed database systems. ACM Trans. Database Syst. 7, 3 (Sept.), 323. Google Scholar
- Ts{m, S., AND ZANIOLO, C. 1984 An implementation of GEM Supporting a semantic data model on relational back-end. In Proceedings of ACM SIGMOD Conference. ACM, New York, 286. Google Scholar
- TUKEY, J. W. 1977. Exploratory Data Analyas. Addison-Wesley, Reading, Mass.Google Scholar
- UNIDATA 1991. NetCDF User's Guide, An Interface fbr Data Access, Versmn I.H. NCAR Tech Note TS-334 + 1A, Boulder, ColoGoogle Scholar
- VALDURmZ, P. 1987. Join indices. ACM Trans. Database Syst. 12, 2 (June), 218. Google Scholar
- VANDENBERC, S. L., AND DEWITT, D.J. 1991. Algebraic support for complex objects with arrays, identity, and inheritance. In Proceedzngs of ACM SIGMOD Conference. ACM, New York, 158. Google Scholar
- WALTON, C B. 1989 Investigating skew and scalablhty in parallel joins. Computer Science Tech. Rap. 89-39, Univ. of Texas, Austin. Google Scholar
- WALTON, C. B., DALE, A. G., AND JENEVEIN, R. M. 1991. A taxonomy and performance model of data skew effects in parallel joins. In Proceedrags of the Internatwnal Conference on Very Large Data Bases (Barcelona, Spain). VLDB Endowment, 537. Google Scholar
- WHANG, K. Y., AND KRISHNAMURTHY, R. 1990. Query optimization in a memory-resident domain relational calculus database system. ACM Trans. Database Syst. 15, 1 (Mar.), 67. Google Scholar
- WHANG, K. Y., WIEDERHOLD G., AND SAGALOWICZ, D. 1985 The property of separahlity and its application to physical database demgn. In Query Processmg m Database Systems. Springer, Berhn, 297.Google Scholar
- WHANG, K. Y., WIEDERHOLD, G., AND SAGLOWICZ, D. 1984. Separability An approach to physical database design. IEEE Trans. Comput. 33, 3 (Mar.), 209.Google Scholar
- WILLIAMS, P., DANIELS, D., HAAS, L., LAPIS, G., LINDSAY, g., NG, P., OBERMARCK, R., SELINGER, r., WALIiER, h., WILMS, P., AND YOST, R. 1982 R*: An overview of the architecture. In Improwng Database Usabdztv and Responsiveness. Academic Press, New York. Reprinted in Readings zn Database Systems. Morgan-Kaufman, San Mateo, Calif., 1988 Google Scholar
- WILSCHUT, A. N. 1993. Parallel query executmn in a mare memory database system. Ph.D. the sis, Univ. of Tweuk, The Netherlands.Google Scholar
- WILSCHUT, A. N., AND APERS, P. M. G. 1993. Dataflow query execution in a parallel mainmemory enwronment. Distmb. Parall. Databases 1, 1 (Jan.), 103. Google Scholar
- WOLF, J.L,DIAs, D.M,ANDYu, P.S. 1990. An effective algorithm for parallelizing sort merge in the presence of data skew In Proceedings of the International Symposium on Databases in Parallel and D,strzbated Systems (Dubhn, Ireland, July) Google Scholar
- WOLF, J. L., DIAS, D M., YU, P. S, AND TUREK, J. 1991. An effective algorithm for parallelizmg hash joins in the presence of data skew. In Proceedings of the IEEE Conj~erence on Data Engineering. IEEE, New York. 200 Google Scholar
- WOLNmWICZ, R. H., AND GRAEFE, G. 1993 A1- gebrmc optlmmatlon of computatmns over scientific databases. In Proceedzngs of the International Conference on Very Large Data Bases. VLDB Endowment. Google Scholar
- WONG, E., AND KATZ, R.H. 1983. Dmtributmg a database for parallelism, in Proceedings of ACM SIGMOD Conference. ACM, New York, 23. Google Scholar
- WONt, E., ANDYouSSEFI, K. 1976 Decomposition A strategy for query processing. ACM Trans Database Syst 1, 3 (Sept.), 223. Google Scholar
- YANG, H., AND LARSON, P.A. 1987. Query transformatmn ibr PSI-queries. In Proceedings of the Internatzonal Conference on Very Large Data Bases (Brighton, England, Aug.) VLDB Endowment, 245. Google Scholar
- YOUSSEFL K, ANn WONG, E 1979. Query processing in a relational database management system. In Proceedmg,s of the Internatmnal Conference on Very Large Data Bases (Rio de Janeiro, Oct ). VLDB Endowment, 409.Google Scholar
- Yu, C. T., AND CHANG, C. C. 1984. Distributed query processing. ACM Comput. Surv. 16, 4 (Dec.), 399. Google Scholar
- Yu, L., ANu OSBORN, S. L. 1991. An evaluatmn framework for algebrme object-oriented query models, in Proceedings of the IEEE Conference on Data Engineering. VLDB Endowment, 670. Google Scholar
- ZANIOLO, C. 1983 The database language Gem. In Proceedings of ACM SIGMOD Conference. AGM, New York, 207. Reprinted m Rec~dengo zn Database Systems. Morgan-Kaufman, San Mateo, Calif., 1988. Google Scholar
- ZANIOLO, C. 1979 Design of relational views over network schemas. In Proceedings of ACM SIGMOD Conference ACM, New York, 179 Google Scholar
- ZELLER, H. 1990. Parallel query execution in NonStop SQL. In Dzgest of Papers, 35th Comp- Con Conference. San Francisco.Google Scholar
- ZELLER H., ANn GRAY, J. 1990 An adaptive hash join algorithm for multiuser environments. In Proceedings of the Internatmnal Con/krence on Very Large Data Bases (Brisbane, Australia). VLDB Endowment, 186. Google Scholar
Index Terms
- Query evaluation techniques for large databases
Recommendations
Sort vs. Hash Revisited
Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, ...
Parallelizing User-Defined Functions in Distributed Object-Relational DBMS
IDEAS '99: Proceedings of the 1999 International Symposium on Database Engineering & ApplicationsFull support of parallelism in object-relational database systems (ORDBMSs) is desired. The parallelization techniques developed for relational database systems are not adequate for ORDBMS because of the introduction of complex abstract data types and ...
Reviews
Margaret H. Dunham
Graefe has written the first comprehensive study of database query processing techniques. It is an extremely well written overview of various query processing problems and solutions. As stated in the introduction, its target is to survey algorithms for complex queries. Included are discussions of sorting and hashing issues as related to query processing; methods to reduce I/O costs; techniques for performing aggregation; techniques to perform queries based on universal quantification (division is usually used for relational databases); scheduling and execution of complex queries, particularly in multiprocessor systems; issues related to parallelism; and techniques for processing queries against nontraditional database systems (nested relations, object-oriented databases, and temporal data). Included throughout the paper are performance results based on actual experiments or analytic formulas, and tables classifying and summarizing the various options or aspects involved in each of the areas covered. The discussion of query execution engines is interesting and provides a unique treatment of the subject. Overall, the paper is complete and the breadth of coverage is impressive. Previous survey papers have examined many related issues, so this paper overlaps other recently published papers. My recent ACM Computing Surveys paper with Priti Mishra examined join processing [1]. Section 5 of Graefe's paper examines joins in detail. The emphasis of this paper, however, is on more complex joins and their performance, while our paper is more of a survey and categorization of different types of joins, with an emphasis on natural joins and equijoins. The introduction cites many other surveys that have covered other topics related to database query processing, including concurrency control, recovery, views, query languages, and compression. While the overlaps have been kept minimal, the fact that some of this survey material is missing means that the target audience is readers very familiar with database concepts. The introduction indicates that the paper assumes “the reader possesses basic textbook knowledge of database query languages.” I find this to be an understatement, however. Experience with database programming and design would be of great benefit in understanding all issues covered in this paper. A major problem is that the author provides no coverage of optimization. Throughout the paper, references are made to I/O cost, but no discussion of optimization is included. The introduction does indicate that this is the case, but due to the other topics covered, this omission is a problem. Another major problem with this paper is its length. The breadth of the paper is astonishing. The size seems to be more appropriate for a book than for a paper published in a journal. I find it difficult to believe that anyone would sit down and read through the entire paper. As a reference tool, it is excellent, however. This excellent paper covers many questions related to the efficient implementation of complex database queries. The length of the paper makes it most appropriate as a reference.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments