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	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]
	2	{Berge 73} Berge, C. Graphs and Hypergraphs. North Holland Publishing Co., 1973.
	3	Catriel Beeri , Ronald Fagin , David Maier , Alberto Mendelzon , Jeffrey Ullman , Mihalis Yannakakis, Properties of acyclic database schemes, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.355-362, May 11-13, 1981, Milwaukee, Wisconsin, United States  [doi>10.1145/800076.802489]
	4	{BG 81} Bernstein, P.A., and N. Goodman. The Power of Natural Semijoins. SIAM J. of Comput. 10(4), Nov., 1981.
	5	{FMU 80} Fagin, R., A.O. Mendelzon, and J.D. Ullman. A Simplified Universal Relation Assumption and its Properties. Technical Report RJ2900, IBM, San Jose, Calif., 1980.
	6	{Gavril 72} Gavril, F. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. SIAM J. Comput. 1(2):180-187, 1972.
	7	{Graham 79} Graham, M.H. On the Universal Relation. Technical Report, Univ. of Toronto, September, 1979.
	8	{GS1 80} Goodman, N., and O. Shmueli. Hierarchies of Database State Reductions. Technical Report TR-18-80, Aiken Computation Lab., Harvard University, November, 1980. ACM Trans. on Database Syst., to appear.
	9	{GS2 81} Goodman, N., and O. Shmueli. Syntactic Characterizations of Database Schemas. Technical Report TR-09-81, Aiken Computation Lab., Harvard University, June, 1981. Submitted for Publication.
	10	{HSW 75} Held, G.D., M. Stonebreaker, and E. Wong. INGRES-A Relational Data Base Management System. In Proc. AFIPS 1975 NCC, pages 417-423. AFIPS Press, Montvale, N.J., 1975.
	11	{Hull 81} Hull, R. Acyclic Join Dependencies and Database Projections. In Proc. XP2., State College, Pa., June, 1981.
	12	{Mu1 80} Maier, D., and J.D. Ullman. Maximal Objects and the Semantics of Universal Relation Databases. Technical Report #80-016, Dept. of Comp. Science, SUNY at Stonybrook, November, 1980.
	13	{MU2 81} Maier, D., and J.D. Ullman. Connections in Acyclic Hypergraphs. Technical Report STAN-CS-81-853, Dept. of Comp. Science, Stanford Univ., Stanford, CA, May, 1981.
	14	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]
	15	Mihalis Yannakakis, Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing, p.253-264, May 01-03, 1978, San Diego, California, United States  [doi>10.1145/800133.804355]
	16	{YO 79} Yu, C.T., and M.Z. Ozsoyoglu. An Algorithm for Tree-Query Membership of a Distributed Query. In Proc. Compsac 79. IEEE Comp. Society, November, 1979.

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski