Query Optimization in Database Systems

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. V. Aho , C. Beeri , J. D. Ullman, The theory of joins in relational databases, ACM Transactions on Database Systems (TODS), v.4 n.3, p.297-314, Sept. 1979 [doi>10.1145/320083.320091]
	2	A. V. Aho , Y. Sagiv , J. D. Ullman, Efficient optimization of a class of relational expressions, ACM Transactions on Database Systems (TODS), v.4 n.4, p.435-454, Dec. 1979 [doi>10.1145/320107.320112]
	3	AHO, A. V., SAC, lV, Y., AND ULLMAN, J. D. 1979c. Equivalences among relational expressions. SIAM J. Comput. 8, 2, 218-246.
	4	Sten Andler , I. Ding , Kapali P. Eswaran , C. Hauser , Won Kim , James W. Mehl , R. Williams, System D: A Distributed System for Availability, Proceedings of the 8th International Conference on Very Large Data Bases, p.33-44, September 08-10, 1982
	5	APERS, P. M. G., HEVNER, A. R., AND YAO, S. B. 1983. Optimization algorithms for distributed queries. {EEE Trans. So{tw. Eng. SE-9, 1, 57-68.
	6	M. M. Astrahan , D. D. Chamberlin, Implementation of a structured English query language, Communications of the ACM, v.18 n.10, p.580-588, Oct. 1975 [doi>10.1145/361020.361215]
	7	M. M. Astrahan , S. P. Ghosh, A search path selection algorithm for the Data Independent Accessing Model (DIAM), Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, p.367-388, May 01-03, 1974, Ann Arbor, Michigan [doi>10.1145/800296.811521]
	8	ASTRAHAN, ML M., SCHKOLNWK, M., AND K{M, W. 1980. Performance of the System R access path selection algorithm. In Information Processing 80. Elsevier North-Holland, New York, pp. 487-491.
	9	François Bancilhon , Philippe Richard , Michel Scholl, On Line Processing of Compacted Relations, Proceedings of the 8th International Conference on Very Large Data Bases, p.263-269, September 08-10, 1982
	10	BANERJEE, J., AND HSIAO, D. K. 1979. DBC--A database computer for very large databases. IEEE Trans. Comput. C-28, 6, 414-429.
	11	BATORY, D. S. 1982. Index selection. In Principles of Database Design, S. B. Yao, Ed. Springer, New York.
	12	BAYER, R., AND MCCREIGHT, E. 1972. Organization and maintenance of large ordered indexes. Acta Inf. t, 173-189.
	13	BAYER, R., ELHAROT, K., KIESSLING, W., AND KIL- tAR, D. 1984. Verteilte Datenbanksysteme. Inf. Spektrum 7, 1, 1-19.
	14	Jon Louis Bentley , Jerome H. Friedman, Data Structures for Range Searching, ACM Computing Surveys (CSUR), v.11 n.4, p.397-409, Dec. 1979 [doi>10.1145/356789.356797]
	15	BrRNAOAT, P. 1983. Decomposition et ~valuation de questions dans une machine base de donn$es relationnelles. Th~se IlIme cycle, D~partment d'Informatique, Universit~ de Paris VI, Paris, France.
	16	Philip A. Bernstein , Dah-Ming W. Chiu, Using Semi-Joins to Solve Relational Queries, Journal of the ACM (JACM), v.28 n.1, p.25-40, Jan. 1981 [doi>10.1145/322234.322238]
	17	BERNSTEIN, P. A., AND GOODMAN, N. 1981a. The power of natural semijoins. SIAM J. Comput. 10, 4, 751-771.
	18	BERNSTE{N, P. A., AND GOODMAN, N. 1981b. The power of inequality semijoins. Inf. Syst. 6, 4, 255- 265.
	19	Philip A. Bernstein , Nathan Goodman, Concurrency Control in Distributed Database Systems, ACM Computing Surveys (CSUR), v.13 n.2, p.185-221, June 1981 [doi>10.1145/356842.356846]
	20	BERNSTEIN, P. A., BLAUSTEIN, B. T., AND CLARKE, E. M. 1980. Fast maintenance of semantic integrity assertions using redundant aggregate data. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 126-136.
	21	Philip A. Bernstein , Nathan Goodman , Eugene Wong , Christopher L. Reeve , James B. Rothnie, Jr., Query processing in a system for distributed databases (SDD-1), ACM Transactions on Database Systems (TODS), v.6 n.4, p.602-625, Dec. 1981 [doi>10.1145/319628.319650]
	22	BEaaA, B., AND OLIVER, E. 1979. The role of associative array processors in database machine architectures. IEEE Comput. 12, 3, 53-61.
	23	Dina Bitton , Haran Boral , David J. DeWitt , W. Kevin Wilkinson, Parallel algorithms for the execution of relational database operations, ACM Transactions on Database Systems (TODS), v.8 n.3, p.324-353, Sept. 1983 [doi>10.1145/319989.319991]
	24	BLASC, EN, M. W., AND ESWARAN, K. P. 1976. On the evaluation of queries in a relational data base system. IBM Res. Rep. RJ 1745, IBM Research Laboratories, San Jose, Calif.
	25	BLASGEN, M. W., AND ESWARAN, K. P. 1977. Storage and access in relational databases. IBM Syst. J. 16, 363-377.
	26	BOLOUR, A. 1981. Optimal retrieval for small range queries. SIAM J. Comput. 10, 4, 721-741.
	27	BREITBART, Y., AND REITER, A. 1975. Algorithms for fast evaluation of Boolean expressions. Acta Inf. 4, 107-116.
	28	BRODIE, M., MYLOPOULOS, J., AND SCHMIDT, J. W., Eds. 1984. On Conceptual Modelling. Perspectides from Artificial Intelligence, Databases, and Programming Languages. Springer, New York.
	29	BUNEMAN, P. 1979. The problem of multiple paths in a database schema. In Proceedings of the 5th International Conference on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 368-372.
	30	Alfonso F. Cárdenas, Analysis and performance of inverted data base structures, Communications of the ACM, v.18 n.5, p.253-263, May 1975 [doi>10.1145/360762.360766]
	31	CARLIS, J. V., MARCH, S. T., AND DICKSON, G. W. 1981. Physical database design: A DSS approach. In Proceedings of the 2nd International Conference on Information Systems (Boston, Mass.). ACM, New York, pp. 153-172.
	32	C. Robert Carlson , Robert S. Kaplan, A generalized access path model and its application to a relational data base system, Proceedings of the 1976 ACM SIGMOD international conference on Management of data, June 02-04, 1976, Washington, D.C.
	33	CER}, S., AND PELAGATTI, G. 1982. Allocation of operations in distributed database access. IEEE Trans. Comput. C-31, 2, 119-128.
	34	D. D. Chamberlin , M. M. Astrahan , W. F. King , R. A. Lorie , J. W. Mehl , T. G. Price , M. Schkolnick , P. Griffiths Selinger , D. R. Slutz , B. W. Wade , R. A. Yost, Support for repetitive transactions and ad hoc queries in System R, ACM Transactions on Database Systems (TODS), v.6 n.1, p.70-94, March 1981 [doi>10.1145/319540.319550]
	35	CHAN, A., AND NIAMIR, B. 1982. On estimating cost of accessing records in blocked database organizations. Comput. J. 25, 3, 368-374.
	36	Arvola Chan , Umeshwar Dayal , Stephen Fox , Nathan Goodman , Daniel R. Ries , Dale Skeen, Overview of an Ada compatible distributed database manager, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	37	CHANDRA, A. K., AND HAREL, D. 1982a. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 99-128.
	38	Ashok K. Chandra , David Harel, Horn clauses and the fixpoint query hierarchy, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, March 29-31, 1982, Los Angeles, California [doi>10.1145/588111.588137]
	39	Ashok K. Chandra , Philip M. Merlin, Optimal implementation of conjunctive queries in relational data bases, Proceedings of the ninth annual ACM symposium on Theory of computing, p.77-90, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803397]
	40	CHANC,, C. L. 1978. DEDUCE 2: Further investigations of deduction in relational databases. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum, New York, pp. 210-236.
	41	CHAt~G, C. L. 1979. On evaluation of queries containing derived relations in a relational data base. IBM Res. Rep. RJ2667, IBM Research Laboratories, San Jose, Calif.
	42	Jo-Mei Chang, A Heuristic Approach to Distributed Query Processing, Proceedings of the 8th International Conference on Very Large Data Bases, p.54-61, September 08-10, 1982
	43	CnEN, P. P. S., AND AKOKA, J. 1980. Optimal design of distributed information systems. IEEE Trans. Comput. C-29, 12, 1068-1080.
	44	A. Chesnais , E. Gelenbe , I. Mitrani, On the modeling of parallel access to shared data, Communications of the ACM, v.26 n.3, p.196-202, March 1983 [doi>10.1145/358061.358073]
	45	To-Yat Cheung, A method for equijoin queries in distributed relational databases, IEEE Transactions on Computers, v.31 n.8, p.746-751, Aug. 1982 [doi>10.1109/TC.1982.1676081]
	46	To-Yat Cheung, Estimating block accesses and number of records in file management, Communications of the ACM, v.25 n.7, p.484-487, July 1982 [doi>10.1145/358557.358581]
	47	D. M. Chiu , Y. C. Ho, A methodology for interpreting tree queries into optimal semi-join expressions, Proceedings of the 1980 ACM SIGMOD international conference on Management of data, May 14-16, 1980, Santa Monica, California [doi>10.1145/582250.582277]
	48	Cmu, D. M., BERNSTEIN, P. A., AND HO, Y. C. 1981. Optimizing chain queries in a distributed database system. Tech. Rep. TR-01-81, Computer Science Dept., Harvard University, Cambridge, Mass.
	49	CHRISTODOULAKIS, S. 1981. Estimating selectivities in data bases. Tech. Rep. CSRG-136, Computer Science Dept., University of Toronto, Toronto, Canada.
	50	Stavros Christodoulakis, Estimating block transfers and join sizes, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	51	CHU, W. W., AND HURLEY, P. 1982. Optimal query processing for distributed database systems. IEEE Trans. Comput. C-3I, 9, 835-850.
	52	CLAUSRN, S. E. 1980. Optimizing the evaluation of calculus expressions in a relational database system. Inf. Syst. 5, 1, 41-54.
	53	Cooo, E. F. 1971. A database sublanguage founded on the relational calculus. In Proceedings of the A CM-SIGFIDET Workshop, Data Description, Access, and Control (San Diego, Calif., Nov. 11- 12). ACM, New York, pp. 35-68.
	54	Cooo, E. F. 1972. Relational completeness of data base sublanguages. In Courant Computer Science Symposia No. 6: Data Base Systems. Prentice- Hall, New York, pp. 67-101.
	55	DA~;I~.LS, D. 1982. Query compilation in a distributed database system. IBM Res. Rep. RJ3423, IBM Research Laboratories, San Jose, Calif.
	56	DANIELB, D., SELINGER, S., HAAS, L., LINDSAY, B., MOHAN, J., WALKER, A., AND WILM$, P. 1982. An introduction to distributed query compilation in R*. In Proceedings of the 2nd Symposium on Distributed Databases (Berlin, FRG). Elsevier North-Holland, New York.
	57	DAvis, H. W., AND WINSLOW, L. E. 1982. Computational power in query languages. SIAM j. Comput. 11, 3, 547-554.
	58	Larry S. Davis , T L. Kunii, Pattern databases, Physical structures and application on Database design techniques II, p.357-399, December 1982, Tokyo, Japan
	59	Umeshwar Dayal, Processing queries with quantifiers a horticultural approach, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588075]
	60	Umeshwar Dayal, Processing Queries Over Generalization Hierarchies in a Multidatabase System, Proceedings of the 9th International Conference on Very Large Data Bases, p.342-353, October 31-November 02, 1983
	61	Umeshwar Dayal , Nathan Goodman, Query optimization for CODASYL database systems, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582380]
	62	DAYAL, U., GOODMAN, N., LANDERS, T. A., OLSON, K., SMiTh, J. M., aND YEDWAS, L. 1981. Local query optimization in Multibase--A system for heterogeneous distributed databases. Tech. Rep. CCA-81-11, Computer Corporation of America, Cambridge, Mass.
	63	DEMOLOMBE, R. 1980. Estimation of the number of tuples satisfying a query expressed in predicate calculus language. In Proceedings o/the 6th Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 55-63.
	64	David J. DeWitt, Query execution in DIRECT, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582098]
	65	Peter J. Downey , Ravi Sethi , Robert Endre Tarjan, Variations on the Common Subexpression Problem, Journal of the ACM (JACM), v.27 n.4, p.758-771, Oct. 1980 [doi>10.1145/322217.322228]
	66	EG~ERS, S. J., AND SHOSUANI, A. 1980. Efficient access of compressed data. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 205-211.
	67	EPSTEIN, R., AND STONEBRAKER, M. 1980. Analysis of distributed data base processing strategies. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 92-101.
	68	Robert Epstein , Michael Stonebraker , Eugene Wong, Distributed query processing in a relational data base system, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas [doi>10.1145/509252.509292]
	69	Christian Esculier , A. M. Glorieux, The SIRIUS-DELTA Distributed DBMS, Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design, p.543-552, January 1980
	70	K. P. Eswaran , J. N. Gray , R. A. Lorie , I. L. Traiger, The notions of consistency and predicate locks in a database system, Communications of the ACM, v.19 n.11, p.624-633, Nov. 1976 [doi>10.1145/360363.360369]
	71	Sheldon Finkelstein, Common expression analysis in database applications, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582400]
	72	FORKER, H. J. 1982. Algebraical and operational methods for the optimization of query processing in distributed relational database management systems. In Proceedings of the 2nd International Symposium on Distributed Databases (Berlin, FRG). Elsevier North-Holland, New York, pp. 39-59.
	73	Georges Gardarin , Patrick Valduriez , Yann Viémont, Predicate Trees: An Approach to Optimize Relational Query Operations, Proceedings of the First International Conference on Data Engineering, p.439-444, April 24-27, 1984
	74	GAWSH, B., AND SEC, EV, A. 1982. Query optimization in distributed computer systems. In Management of Distributed Data Processing, J. Akoka, Ed. Elsevier North.Holland, New York, pp. 233-252.
	75	GAriSH, B., AND SEGEV, A. 1983. Set query optimization in horizontally partitioned distributed databases. Working Paper QM8304, Graduate School of Management, University of Rochester, Rochester, N.Y.
	76	Erol Gelenbe , Danièle Gardy, The Size of Projections of Relations Satisfying a Functional Dependency, Proceedings of the 8th International Conference on Very Large Data Bases, p.325-333, September 08-10, 1982
	77	GILLES, J. H., AND SCHUSTER, S. A. 1975. Query execution and index selection for relational data bases. Tech. Rep. CSRG~53, Computer Science Dept., University of Toronto, Toronto, Ontario.
	78	GOODMAN, N., AND SHMUELI, O. 1980. Nonreducible database states for cyclic queries. Tech. Rep. TR-15-SO, Computer Science Dept., Harvard University, Cambridge, Mass.
	79	Nathan Goodman , Oded Shmueli, Tree queries: a simple class of relational queries, ACM Transactions on Database Systems (TODS), v.7 n.4, p.653-677, Dec. 1982 [doi>10.1145/319758.319775]
	80	Leo R. Gotlieb, Computing joins of relations, Proceedings of the 1975 ACM SIGMOD international conference on Management of data, May 14-16, 1975, San Jose, California [doi>10.1145/500080.500089]
	81	Mohamed G. Gouda , Umeshwar Dayal, Optimal semijoin schedules for query processing in local distributed database systems, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan [doi>10.1145/582318.582344]
	82	GRANT, J., AND MINKER, J. 1981. Optimization in deductive and conventional relational database systems. In Advances in Database Theory, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds. Plenum, New York, pp. 195-234.
	83	GRAY, P. M. D. 1981. Use of automatic programming and simulation to facilitate operations on CO- DASYL databases. In Database, M. P~ Atkinson, Ed. Pergamon Infotech, London, pp. 315-369.
	84	GaAY, P. M. D. 1984. Implementing the join operation on CODASYL DBMS. In Databases: Role and Structure, P. M. Stocker, Ed. Cambridge University Press, Cambridge, England.
	85	David Gries, Compiler Construction for Digital Computers, John Wiley & Sons, Inc., New York, NY, 1971
	86	N. D. Griffeth, Nonprocedural query processing for databases with access paths, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas [doi>10.1145/509252.509291]
	87	Patricia P. Griffiths , Bradford W. Wade, An authorization mechanism for a relational database system, ACM Transactions on Database Systems (TODS), v.1 n.3, p.242-255, Sept. 1976 [doi>10.1145/320473.320482]
	88	GR)SnMAN, R. 1978. The simplification of retrieval requests generated by question-answering systems. In Proceedings of the 4th International Conference on Very Large Data Bases (West Berlin, FRG, Sept. 13-15). IEEE, New York, pp. 400- 406.
	89	GUDES, E., AND REITER, A. 1973. On evaluating Boolean expressions. Softw. Pract. Exper. 3, 345- 350.
	90	HALL, P. A. V. 1974. Common subexpression identification in general algebraic systems. Tech. Rep. UKSC 0060, IBM UK Scientific Center, Peterlee, England.
	91	HALL, P. A. V. 1976. Optimization of single expressions in a relational data base system. IBM J. Res. Devel. 20, 3, 244-257.
	92	Michael Hammer , Bahram Niamir, A heuristic approach to attribute partitioning, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582110]
	93	HAMMER, M., A~O ZOONm, S. B., JR. 1980. Knowledge-based query processing. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 137-147.
	94	Michael Z. Hanani, An optimal evaluation of Boolean expressions in an online query system, Communications of the ACM, v.20 n.5, p.344-347, May 1977 [doi>10.1145/359581.359600]
	95	Paula B. Hawthorn, Microprocessor Assisted Tuple Access, Decompression and Assembly for Statistical Database Systems, Proceedings of the 8th International Conference on Very Large Data Bases, p.223-233, September 08-10, 1982
	96	Lawrence J. Henschen , Shamim A. Naqvi, On compiling queries in recursive first-order databases, Journal of the ACM (JACM), v.31 n.1, p.47-85, Jan. 1984 [doi>10.1145/2422.2423]
	97	Alan Raymond Hevner, The optimization of query processing on distributed database systems, 1979
	98	HEVNER, A. R., A~o YAO, S. B. 1979. Query processing on a distributed database. IEEE Trans. So{tw. Eng. SE-5, 3, 177-187.
	99	HEVNER, A. R., AND ~AO, S. B. 1981. Transaction optimization on a distributed database system. Tech. Rep. HR-81-257, Honeywell Corporate Computer Center, Bloomington, Minn.
	100	HSlAO, D. K. 1979. Database machines are coming, database machines are coming. IEEE Comput. 12, 3, 7-9.
	101	IBM COFtrORATIO~ 1966. Introduction to IBM direct-access storage devices and organization methods. Programming manual GC 20-1649-06,
	102	IEEE 1982. Special issue on query optimization. IEEE Databa~se Eng. 5, 3 (Sept.).
	103	JARKE, M. 1984, Common subexpression isolation in multiple query optimization. In Query Processing in Database Systems, W. Kim, D. Reiner, and D. Batory, Eds. Springer, New York.
	104	Matthias Jarke , Jürgen Koch, Range nesting: a fast method to evaluate quantified queries, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	105	JARKE, M., ANO SCHMmT, J. W. 1981. Evaluation of first-order relational expressions. Tech. Rep. 78, Fachbereich Informatik, Universitaet Hamburg, Hamburg, FRG.
	106	Matthias Jarke , Joachim W. Schmidt, Query processing strategies in the PASCAL/R relational database management system, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582402]
	107	JAaKE, M., AHD VASSmIOU, Y. 1984. Coupling expert systems with database management systems. In Artificial Intelligence Applications for Business, W. Reitman, Ed. Ablex, Norwood, N.J., pp. 65- 85.
	108	Matthias Jarke , Jim Clifford , Yannis Vassiliou, An optimizing prolog front-end to a relational query system, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
	109	D. S. Johnson , A. Klug, Testing containment of conjunctive queries under functional and inclusion dependencies, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, March 29-31, 1982, Los Angeles, California [doi>10.1145/588111.588138]
	110	JOHNSON, D. S., AND KLUG, A. 1983. Optimizing conjunctive queries that contain untyped variables. SIAM J. Comput. 12, 4, 616-640.
	111	JOHNSTON, H. R., SCHWrgTZER, J. E., AND WARKE~- TINE, E. R. 1983. A DBMS facility for handling structured engineering entities. In Proceedings of the Database Week Engineering Design Applications Conference (San Jose, Calif.). ACM, New York, pp. 3-12.
	112	Yahiko Kambayashi , Masatoshi Yoshikawa, Query processing utilizing dependencies and horizontal decomposition, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	113	Yahiko Kambayashi , Masatoshi Yoshikawa , Shuzo Yajima, Query processing for distributed databases using generalized semi-joins, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582381]
	114	R. H. Katz , E. Wong, Decompiling CODASYL DML into retional queries, ACM Transactions on Database Systems (TODS), v.7 n.1, p.1-23, March 1982 [doi>10.1145/319682.319688]
	115	KELLOGC,, C. 1982. A practical amalgam of knowledge and data base technology. In Proceedings of the National Conference on Artificial Intelligence (Pittsburgh, Pa.). AAAI, Menlo Park, Calif.
	116	Larry Kerschberg , Peter D. Ting , S. Bing Yao, Query optimization in star computer networks, ACM Transactions on Database Systems (TODS), v.7 n.4, p.678-711, Dec. 1982 [doi>10.1145/319758.319778]
	117	Won Kim, A new way to compute the product and join of relations, Proceedings of the 1980 ACM SIGMOD international conference on Management of data, May 14-16, 1980, Santa Monica, California [doi>10.1145/582250.582278]
	118	KIM, W. 1981. Query optimization for relational database systems. IBM Res. Rep. RJ3081, IBM Research Laboratories, San Jose, Calif.
	119	Won Kim, On optimizing an SQL-like nested query, ACM Transactions on Database Systems (TODS), v.7 n.3, p.443-469, Sept. 1982 [doi>10.1145/319732.319745]
	120	KIM, W. 1984. Global optimization of relational queries: A first step. In Query Processing in Database Systems, W. Kim, D. Reiner, and D. Batory, Eds. Springer, New York.
	121	KIM, W., KUCK, D. J., AND GARSKI, D. 1981. A bitserial/tuple-parallel relational query processor. IBM Res. Rep. RJ3194, IBM Research Laboratories, San Jose, Calif.
	122	Jonathan J. King, Exploring the use of domain knowledge for query processing efficiency, Stanford University, Stanford, CA, 1979
	123	KiHc., J. J. 1981. QUIST: A system for semantic query optimization in relational databases. In Proceedings of the 7th International Conference on Very Large Dam Bases (Cannes, Sept. 9-11). IEEE, New York, pp. 510-517.
	124	A. Klug, Calculating constraints on relational expression, ACM Transactions on Database Systems (TODS), v.5 n.3, p.260-290, Sept. 1980 [doi>10.1145/320613.320615]
	125	Anthony Klug, Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions, Journal of the ACM (JACM), v.29 n.3, p.699-717, July 1982 [doi>10.1145/322326.322332]
	126	Anthony Klug, Access paths in the "Abe" statistical query facility, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582382]
	127	Anthony Klug, Locking Expressions for Increased Database Concurrency, Journal of the ACM (JACM), v.30 n.1, p.36-54, Jan. 1983 [doi>10.1145/322358.322362]
	128	KOCH, J., SCHMIDT, J. W., AND WUNDERLICH, V. 1981. Type derivation for first-order relational expressions. Teeh. Rep. no. 79, Fachbereich Informatik, Universitfit Hamburg, Hamburg, FRG.
	129	KOWALSKL R. 1981. Logic as a database language. Unpublished manuscript, Computer Science Dept., Imperial College, London.
	130	KIJNWUJI, S., AND YOKOTA, H. 1982. Prolog and relational databases for Fifth Generation Computer Systems. In Proceedings o/the Workshop on Logical Bases for Data Bases (Toulouse, France). ONERA-CERT, Toulouse, France.
	131	Winfried Lamersdorf, Recursive Data Models for Non-Conventional Database Applications, Proceedings of the First International Conference on Data Engineering, p.143-150, April 24-27, 1984
	132	Tomás Lang , Christopher Wood , Eduardo B. Fernández, Database buffer paging in virtual storage systems, ACM Transactions on Database Systems (TODS), v.2 n.4, p.339-351, Dec. 1977 [doi>10.1145/320576.320585]
	133	LANGDON, G. G. 1979. Database machines: an introduction. IEEE Trans. Comput. C-28, 6, 381-383.
	134	LEILtCH, H.-O., STIEGE, G., A~D ZEIDLER, H. C. 1978. A search processor for data base management systems. In Proceedings of the 4th Internstional Conference on Very Large Data Bases (West Berlin, FRG, Sept. 13-15). 1EEE, New York, pp. 280-287.
	135	Chyuan Shiun Lin , Diane C. P. Smith , John Miles Smith, The design of a rotating associative memory for relational database applications, ACM Transactions on Database Systems (TODS), v.1 n.1, p.53-65, March 1976 [doi>10.1145/320434.320447]
	136	Jane W. S. Liu, Algorithms for parsing search queries in systems with inverted file organization, ACM Transactions on Database Systems (TODS), v.1 n.4, p.299-316, Dec. 1976 [doi>10.1145/320493.320490]
	137	W. S. Luk, On estimating block accesses in database organizations, Communications of the ACM, v.26 n.11, p.945-947, Nov. 1983 [doi>10.1145/182.358456]
	138	Mamoru Maekawa, Parallel join and sorting algorithms, Physical structures and application on Database design techniques II, p.266-296, December 1982, Tokyo, Japan
	139	MAUMOUO, S. A., RIORDON, J. S., ANO TOT}{, K. C. 1979. Database partitioning and query processing. In Proceedings of the IFIP Working Conference on Database Architecture. Elsevier North- Holland, New York, pp. 3-21.
	140	David Maier, Theory of Relational Databases, Computer Science Pr, 1983
	141	David Maier , Jeffrey D. Ullman, Fragments of relations, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	142	David Maier , David S. Warren, Incorporating computed relations in relational databases, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan [doi>10.1145/582318.582345]
	143	MAKtNOVCHI, A., TEZUKA, M., KITAKAMI, H., AND ADACH{, S. 1981. The optimization strategy for query evaluation in RDB/V1. In Proceedings of the 7th InteraatLonal Conference on Very Large Data Bases (Cannes, Sept. 9-11). IEEE, New York, pp. 518-529.
	144	MALL, M., REIM!~R, M., ^ND SCHMIDT, J. W. 1984. Data selection, sharing and access control in a relational scenario. In On Conceptual Modeling. Perspectives from Artificial Intelligence, Databases, and Programming Languages, M. Brodie, J. Mylopoulos, and J. W. Schmidt, Eds. Springer, New York, pp. 411-436.
	145	Heinz Marburger , Bernhard Nebel, Natürlichsprachlicher Datenbankzugang mit HAM-ANS: Syntaktische Korrepsondenz, natürlichsprachliche Qualifizierung und semantisches Modell des Diskursbereichs, Sprachen für Datenbanken, Fachgespräch auf der 13. GI-Jahrestagung, p.26-41, October 03-07, 1983
	146	MARCH, S. T. 1983. A mathematical programming approach to the selection of access paths for large multiuser data bases. Decision Sci. 14, 4, 564-587.
	147	Fred J. Maryanski, Backend Database Systems, ACM Computing Surveys (CSUR), v.12 n.1, p.3-25, March 1980 [doi>10.1145/356802.356804]
	148	MENON, M. J., ANO HSIAO, D. K. 1981. Design and analysis of a relational join operation for VLSI. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, Sept. 9-11). IEEE, New York, pp. 44-55.
	149	T. H. Merrett, Database cost analysis: a top-down approach, Proceedings of the 1977 ACM SIGMOD international conference on Management of data, August 03-05, 1977, Toronto, Ontario, Canada [doi>10.1145/509404.509426]
	150	T. H. Merrett, Why sort-merge gives the best implementation of the natural join, ACM SIGMOD Record, v.13 n.2, p.39-51, January 1983 [doi>10.1145/984523.984526]
	151	MERR~.TT, T. H., KAMBAYASHt, Y., AND YASUURA, H. 1981. Scheduling of page-fetches in join operations. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, Sept. 9-11). IEEE, New York, pp. 488-498.
	152	Jack Minker, Performing inferences over relation data bases, Proceedings of the 1975 ACM SIGMOD international conference on Management of data, May 14-16, 1975, San Jose, California [doi>10.1145/500080.500092]
	153	Jack Minker, Search strategy and selection function for an inferential relational system, ACM Transactions on Database Systems (TODS), v.3 n.1, p.1-31, March 1978 [doi>10.1145/320241.320242]
	154	MINKER, J., AND NICOLAS, J.-M. 1983. On recursive axioms in deductive databases. Inf. Syst. 8, 1, 1- 13.
	155	M. Missikoff , M. Scholl, Relational queries in a domain based DBMS, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	156	MONTGOMERY, A. I., o'SOUZA, D. J., AND LEE, S. B. 1983. The cost of relational algebraic operations in skewed data: Estimates and experiments. In Information Processing 83. Elsevier North-Holland, New York, pp. 235-241.
	157	Mu~z, R. R. 1979. Gross architecture of the distributed database system. VDN. In Proceedings of the IFIP Working Conference on Database Architecture. Elsevier North-Holland, New York, pp. 23- 34.
	158	Mv~z, R. R., SCn~EII)ER, H.-J., A~o STa~~R, F. 1979. Application of sub-predicate tests in database systems. In Proceedings of the 5th International Con/erence on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 426-435.
	159	MUTHUSWAMY, B., AND KERSCHBERG, r. 1983. Distributed query optimization using detailed database statistics. Unpublished manuscript, Computer Science Dept., University of South Carolina.
	160	NAU, D. 1983. Expert computer systems. IEEE Cornput. 16, 2 (Feb.), 63-85.
	161	NEUHOLD, E. J., AND BILLER, It. 1977. POREL: A distributed data base on an inhomogeneous computer network. In Proceedings of the 3rd International Conference on Very Large Data Bases (Tokyo, Oct. 6-8). IEEE, New York, pp. 380-395. No,, P. 1982. Distributed compilation and recompilation of distributed queries. IBM ties. Rep. RJ3375, IBM Research Laboratories, San Jose, Calif.
	162	NIEBUHR, K. E., AND SMITH, S. E. 1976. N-aryjoins for processing Query by Example. IBM Tech. Disclosure Bull. 19, 6, 2377-2381.
	163	NIEsunI~, K. E., SCUOLZ, K. W., ANn SMITe, S. E. 1976. Algorithm for processing Query by Example. IBM Tech. Disclosure Bull. 19, 2,736-741.
	164	J. Nievergelt , Hans Hinterberger , Kenneth C. Sevcik, The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM Transactions on Database Systems (TODS), v.9 n.1, p.38-71, March 1984 [doi>10.1145/348.318586]
	165	N. J. Nilsson, Principles of artificial intelligence, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1980
	166	OTT, N., AND HORLAENDER, K. 1982. Removing redundant join operations in queries involving views, iBM Tech. Rep. TR-82.03.003, IBM Scientific Center, Heidelberg, FRG.
	167	OZgA~tAHAN, E. A. 1982. Database machine/computer based distributed databases. In Proceedings of the 2nd International Symposium on DistribuWd Databases (Berlin, FRG). Elsevier North- Holland, New York, pp. 61-80.
	168	Z. Meral Özsoyoglu , Gultekin Özsoyoglu, An extension of relational algebra for summary tables, Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management, p.202-211, September 27-29, 1983, Los Altos, California
	169	OZSOYOaLU, M., ANO Yu, C. T. 1980. On identifying a class of database queries that can be processed efficiently. In Proceedings o/the IEEE COMP- SAC Conference. IEEE, New York, pp. 453-461.
	170	PalcE, R. 1982. Applications of finite differencing to database integrity control and query/transaction optimization. In Proceedings of the Workshop on Logical Bases for Data Bases (Toulouse, France). ONERA-CERT, Toulouse, France.
	171	PALERMO, F. P. 1972. A data base search problem. In Proceedings of the 4th Symposium on Computer and Information Science (Miami Beach, Fla.). AFIPS Press, Reston, Va., pp. 67-101.
	172	Kamran Parsaye, Database Management, Knowledge Base Management, and Expert System Development in PROLOG, Databases for Business and Office Applications, Database Week, p.159-178, May 23-26, 1983 [doi>10.1145/647004.711875]
	173	PECHER~.~t, R. M. 1975. Efficient evaluation of expressions in a relational algebra. In Proceedings of the ACM Pacific 75 Conference (San Francisco, Calif., May 14-16). ACM, New York, pp. 44-49.
	174	PECUERER, R. M. 1976. Efficient exploration of product spaces. In Proceedings of the ACM-SIG- MOD international Conference on Management of Data (Washington, D.C., June 2-4). ACM, New York, pp. i69-177.
	175	Pmoa-rE, A. 1979. Findamental and secondary issues in the design of non-procedural relational languages. In Proceedings of the 5th International Conference on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 239-250.
	176	PUTKONr~N, A. 1979. On the selection of the access path in inverted database organizations, In/. Syst. 4, 4, 219-225.
	177	Manuel Reimer, Solving the Phantom Problem by Predicative Optimistic Concurrency Control, Proceedings of the 9th International Conference on Very Large Data Bases, p.81-88, October 31-November 02, 1983
	178	R~.ITEa, R. 1978. Deductive question-answering on relational data bases. In Logic and Databases, H. Gallaire and J. Minker, Eds: Plenum, New York, pp. 149-178.
	179	Philippe Richard, Evaluation of the size of a query expressed in relational algebra, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan [doi>10.1145/582318.582343]
	180	ROSENKRANTZ, D. J., AND HUNT, H. B. III. 1980. Processing conjunctive predicates and queries. In Proceedings of the 6th international Conference on Very Large Data Bases (Montreal, Oct. 1-3). IEEE, New York, pp. 64-72.
	181	Arnon Rosenthal , David Reiner, An architecture for query optimization, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582401]
	182	ROSENTHaL, A., ANO REINER, D. 1984. Querying relational views of networks. In Query Processing in Database Systems, W. Kim, D. Reiner, and D. Batory, Eds. Springer, New York.
	183	James B. Rothnie, Jr., An approach to implementing a relational data management system, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, p.277-294, May 01-03, 1974, Ann Arbor, Michigan [doi>10.1145/800296.811517]
	184	ROTHNtE, J. B., JR. 1975. Evaluating inter-entry retrieval expressions in a relational data base management system. In Proceedings of the National Computer Conference (Anaheim, Calif., May 19-22), vol. 44. AFIPS Press, Reston, Va., pp. 417-423.
	185	ROTHNI~., J. B., ANO GOOOMaN, N. 1977. A survey of research and development in distributed database management. In Proceedings of the 3rd International Conference on Very Large Data Bases (Tokyo, Oct. 6-8). IEEE, New York, pp. 48-62.
	186	Nicholas Roussopoulos, View indexing in relational databases, ACM Transactions on Database Systems (TODS), v.7 n.2, p.258-290, June 1982 [doi>10.1145/319702.319729]
	187	ROUSSOPOULOS, N. 1982b. The logical access path schema of a database. IEEE Tran~. Softw. Eng. SE-8, 6, 563-573.
	188	Giovanni Maria Sacco , Mario Schkolnick, A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model, Proceedings of the 8th International Conference on Very Large Data Bases, p.257-262, September 08-10, 1982
	189	SACCO, G. M., AND YAO, S. B. 1982. Query optimization in distributed database systems. In Advances in Computers, vol. 21. Academic Press, New York, pp. 225-273.
	190	SAGALOWmZ, D. 1977. iDA: An intelligent data access program. In Proceedings of the 3rd International Conference on Very Large Data Bases (Tokyo, Oct. 6-8). IEEE, New York, pp. 293-302.
	191	SaGlv, Y. 1981. Optimization of Queries in Relational Databases. UMI Research Press, Ann Arbor, Michigan.
	192	SAG~V, Y. 1983. Quadratic algorithms for minimizing joins in restricted relational expressions. SlAM J. Comput. 12, 2, 316-328.
	193	Yehoshua Sagiv , Mihalis Yannakakis, Equivalences Among Relational Expressions with the Union and Difference Operators, Journal of the ACM (JACM), v.27 n.4, p.633-655, Oct. 1980 [doi>10.1145/322217.322221]
	194	G. Salton , A. Wong, Generation and search of clustered files, ACM Transactions on Database Systems (TODS), v.3 n.4, p.321-346, Dec. 1978 [doi>10.1145/320289.320291]
	195	Hans-Jörg Schek , Peter Pistor, Data Structures for an Integrated Data Base Management and Information Retrieval System, Proceedings of the 8th International Conference on Very Large Data Bases, p.197-207, September 08-10, 1982
	196	Kathryn L. Schenk , James R. Pinkert, An algorithm for servicing multi-relational queries, Proceedings of the 1977 ACM SIGMOD international conference on Management of data, August 03-05, 1977, Toronto, Ontario, Canada [doi>10.1145/509404.509408]
	197	SCaKOLNICg, M. 1975. The optimal selection of indexes for files. Inf. Syst. 1, 4, 141-146.
	198	Mario Schkolnick, Physical database design techniques, Physical structures and application on Database design techniques II, p.229-252, December 1982, Tokyo, Japan
	199	Joachim W. Schmidt, Some high level language constructs for data of type relation, ACM Transactions on Database Systems (TODS), v.2 n.3, p.247-261, Sept. 1977 [doi>10.1145/320557.320568]
	200	SCHMIOT, J. W. 1979. Parallel processing of relations: A single-assignment appxoach. In Proceedings of the 5th International Conference on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 398-408.
	201	Joachim W. Schmidt, Database Programming: Language Constructs and Execution Models, Programmiersprachen und Programmentwicklung, 8. Fachtagung, veranstaltet vom Fachausschuß 2.1 der GI und der Schweizer Informatiker Gesellschaft, p.1-25, March 08-09, 1984
	202	SELINOER, P. G., AND AOmA, M. 1980. Access path selection in distributed database systems. IBM Res. Rep. RJ2283, IBM Research Laboratories, San Jose, Calif.
	203	P. Griffiths Selinger , M. M. Astrahan , D. D. Chamberlin , R. A. Lorie , T. G. Price, Access path selection in a relational database management system, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582099]
	204	D. G. Severance , J. V. Carlis, A Practical Approach to Selecting Record Access Paths, ACM Computing Surveys (CSUR), v.9 n.4, p.259-272, Dec. 1977 [doi>10.1145/356707.356709]
	205	SaMUF. LI, O. 1981. The fundamental role of tree schemas in relational query processing. Ph.D. thesis, Computer Science Dept., Harvard Univ., Cambridge, Mass.
	206	SHNEIDERMAN, B. 1977. Reduced combined indexes for efficient multiple attribute retrieval Inf. Syst. 2, 4, 149-154.
	207	Ben Shneiderman, Batched searching of sequential and tree structured files, ACM Transactions on Database Systems (TODS), v.1 n.3, p.268-275, Sept. 1976 [doi>10.1145/320473.320487]
	208	Arie Shoshani, Statistical Databases: Characteristics, Problems, and some Solutions, Proceedings of the 8th International Conference on Very Large Data Bases, p.208-222, September 08-10, 1982
	209	Roger K. Shultz , Roy J. Zingg, Response Time Analysis of Multiprocessor Computers for Database Support, ACM Transactions on Database Systems (TODS), v.9 n.1, p.100-132, March 1984 [doi>10.1145/348.318589]
	210	John Miles Smith , Philip Yen-Tang Chang, Optimizing the performance of a relational algebra database interface, Communications of the ACM, v.18 n.10, p.568-579, Oct. 1975 [doi>10.1145/361020.361025]
	211	SMITH, J. M., BERNSTEIN, P. A., DAYAL, U., GOOD- MAN, N., LANDERS, T., LIN, K. W. T., AND WONG, E. 1981. MULTIBASE--Integrating heterogeneous distributed database systems. In Proceedings of the AFIPS National Computer Conference (Chicago, May 4-7), vol. 50. AFIPS Press, Reston, Vs., pp. 487-499.
	212	Gary H. Sockut , Robert P. Goldberg, Database Reorganization—Principles and Practice, ACM Computing Surveys (CSUR), v.11 n.4, p.371-395, Dec. 1979 [doi>10.1145/356789.356796]
	213	Michael Stonebraker, Implementation of integrity constraints and views by query modification, Proceedings of the 1975 ACM SIGMOD international conference on Management of data, May 14-16, 1975, San Jose, California [doi>10.1145/500080.500091]
	214	STONEBRAKER, M., AND NEUHOLD, E. 1977. A distributed database version of INGRES. In Proceedings of the 2nd Berkeley Workshop on Distributed Data Management and Computer Networks (Berkeley, Calif.). University of California, Berkeley.
	215	Michael Stonebraker , Gerald Held , Eugene Wong , Peter Kreps, The design and implementation of INGRES, ACM Transactions on Database Systems (TODS), v.1 n.3, p.189-222, Sept. 1976 [doi>10.1145/320473.320476]
	216	STROET, J. W. M., AND ENGMANN, R. 1979. Manipulation of expressions in a relational algebra. Inf. Syst. 4, 4, 195-203.
	217	Su, S. Y. W. 1979. Cellular-logic devices: Concepts and applications. IEEE Comput. 12, 3, 11-25.
	218	Su, S. Y. W., AND LIPKOVSKI, G. 1975. CASSM: A cellular system for very large databases. In Proceedings o{ the 1st International Conference on Very Large Data Bases (Framingham, Mass., Sept. 22-24). ACM, New York, pp. 456-472.
	219	Stanley Y. W. Su , Krishna P. Mikkilineni, Parallel Algorithms and Their Implementation in MICRONET, Proceedings of the 8th International Conference on Very Large Data Bases, p.310-324, September 08-10, 1982
	220	Andrew S. Tanenbaum, Computer Networks, Prentice Hall PTR, Upper Saddle River, NJ, 1985
	221	Toby J. Teorey , James P. Fry, Design of Database Structures, Prentice Hall Professional Technical Reference, 1982
	222	TOAD, S. 1974. Implementing the join operator in relational data bases. IBM Scientific Center Tech. Note 15, IBM UK Scientific Center, Peterlee, England.
	223	D. Tsichritzis, LSL: a Link and Selector Language, Proceedings of the 1976 ACM SIGMOD international conference on Management of data, June 02-04, 1976, Washington, D.C.
	224	Jeffrey D. Ullman, Principles of Database Systems, W. H. Freeman & Co., New York, NY, 1983
	225	Patrick Valduriez, Semi-join algorithms for multiprocessor systems, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida [doi>10.1145/582353.582396]
	226	Patrick Valduriez , Georges Gardarin, Join and Semijoin Algorithms for a Multiprocessor Database Machine, ACM Transactions on Database Systems (TODS), v.9 n.1, p.133-161, March 1984 [doi>10.1145/348.318590]
	227	Reind P. Van de Riet , Martin L. Kersten , Wiebren de Jonge , Anthony I. Wasserman, High-level programming features for improving the efficiency of a relational database system, ACM Transactions on Database Systems (TODS), v.6 n.3, p.464-485, Sept. 1981 [doi>10.1145/319587.319604]
	228	VASSIL{OU, Y., AND JARKE, M. 1984. Query languages--A taxonomy. In Human Factors and Interactive Computer Systems, Y. Vassiliou, Ed. Ablex, Norwood, N.J.
	229	VASSILIOU, Y., AND LOC~OVSKY, F. 1980. DBMS transaction translation. In Proceedings of the IEEE COMPSAC Conference. IEEE, New York, pp. 89-96.
	230	VASSILIOU, Y., CLIFFORD, J., AND JARKE, M. 1984. Access to specific declarative knowledge in expert systems: The impact of logic programming. Decision Support Syst. 1, 1.
	231	Joost S. M. Verhofstad, Recovery Techniques for Database Systems, ACM Computing Surveys (CSUR), v.10 n.2, p.167-195, June 1978 [doi>10.1145/356725.356730]
	232	WALKER, A. 1980. On retrieval from a small version of a large data base. In Proceedings of the 6th International Conference on Very Large Data Basses (Montreal, Oct. 1-3). IEEE, New York, pp. 47-54.
	233	W^RREN, D. H. D. 1981. Efficient processing of interactive relational database queries expressed in logic. In Proceedings of the 7th International Conference on Very Large Data Bases (Cannes, Sept. 9-11). IEEE, New York, pp. 272-281.
	234	James W. Welch , J. Wesley Graham, Retrieval using ordered lists in inverted and multilist files, Proceedings of the 1976 ACM SIGMOD international conference on Management of data, June 02-04, 1976, Washington, D.C.
	235	Kyu-Young Whang , Gio Wiederhold , Daniel Sagalowicz, Estimating block accesses in database organizations: a closed noniterative formula, Communications of the ACM, v.26 n.11, p.940-944, Nov. 1983 [doi>10.1145/182.358452]
	236	WILHAMS, R., DANIELS, D., HAAS, L., LAPI8, G., LINDSAY, B., NG, P., OBERMARCK, R., SEL{NGER, P., WALKER, A., WILMS, P., AND Y OaT, R. 1982. R*: An overview of the architecture. In Proceedings of the International Conference on Database Systems (Jerusalem, Israel).
	237	WANG, E. 1977. Retrieving dispersed data from SDD-I: A system for distributed databases. In Proceedings of the Second Berkeley Workshop on Distributed Data Management and Computer Networks (Berkeley, Calif.), pp. 217-235.
	238	WONa, E. 1983. Dynamic rematerialization: Processing distributed queries using redundant data. IEEE Trans. So{tw. Eng. SE-9, 3, 228~232.
	239	E. Wong , R. H. Katz, Distributing a database for parallelism, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	240	Eugene Wong , Karel Youssefi, Decomposition—a strategy for query processing, ACM Transactions on Database Systems (TODS), v.1 n.3, p.223-241, Sept. 1976 [doi>10.1145/320473.320479]
	241	Xu, G. D. 1983. Search control in semantic query optimization. Tech. Rep.//83-09, Computer and Information Science Dept., University of Massachusetts, Amherst, Mass.
	242	YAN(~, C.-S. 1977. Avoiding redundant accesses in unsorted multilist file organizations. Inf. Syst. 2, 4, 155-158.
	243	S. B. Yao, Approximating block accesses in database organizations, Communications of the ACM, v.20 n.4, p.260-261, April 1977 [doi>10.1145/359461.359475]
	244	S. B. Yao, An attribute based model for database access cost analysis, ACM Transactions on Database Systems (TODS), v.2 n.1, p.45-67, March 1977 [doi>10.1145/320521.320535]
	245	S. Bing Yao, Optimization of query evaluation algorithms, ACM Transactions on Database Systems (TODS), v.4 n.2, p.133-155, June 1979 [doi>10.1145/320071.320072]
	246	S. Bing Yao , David DeJong, Evaluation of database access paths, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas [doi>10.1145/509252.509273]
	247	YOUSSEFI, K., AND WANG, E. 1979. Query processing in a relational database management system. In Proceedings of the 5th International Conference on Very Large Data Bases (Rio de Janeiro, Oct. 3-5). IEEE, New York, pp. 409-417.
	248	C. T. Yu , C. C. Chang, On the design of a query processing strategy in a distributed database environment, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	249	Yu, C. T., ANO OZSOYOGLU, M. 1979. An algorithm for tree query membership of a distributed query. In Proceedings of the IEEE COMPSAC Conference. IEEE, New York, pp. 306-312.
	250	C. T. Yu , W. S. Luk , M. K. Siu, On the estimation of the number of desired records with respect to a given query, ACM Transactions on Database Systems (TODS), v.3 n.1, p.41-56, March 1978 [doi>10.1145/320241.320245]
	251	Carlo Zaniolo, Design of relational views over network schemas, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582126]