Y. Edmund Lien
- 1 AHo, A V, B~ERI, C., AND ULLMAN, J.D. The theory of joins in relational databases. A CM Trans. Database Syst. 4, 3 (Sept. 1979), 297-314 Google Scholar
- 2 ARMSTRONG, W.W. Dependency structures of data base relattonslups In lnformatton Processing 74, North-HoUand, Amsterdam, 1974, pp 580~583Google Scholar
- 3 BACHMAN, C.W Data structure diagrams Data Base 1, 2 (1969), 4-10 Google Scholar
- 4 BACm~AN, C W.The programmer as navigator Commun. ACM 16, 11 (Nov 1973), 653-658. Google Scholar
- 5 BEERI, C On the roles of data dependencies in the constructmn of relational database schemes Tech Rep No. 43, Dep. of Computer Science, The Hebrew Umv of Jerusalem, Jerusalem, israel, Jan. 1979Google Scholar
- 6 BEERI, C, BERNSTEIN, P A, AND GOODMAN, N A sophtsticate's mtroducuon to data base normahzatlon theory Proc 4th Int. Conf. on Very Large Data Bases, West Berhn, Germany, Sept 1978, pp 113-124Google Scholar
- 7 BEERI, C., FAGIN, R., AND HOWARD, J H A complete ax~omatlzauon for functional and mult~valued dependencies. Proc ACM-SIGMOD lm Conf. on Management of Data, Toronto, Ontario, Canada, Aug 1977, pp 47-61 Google Scholar
- 8 BORKIN, S A Data model equivalence. Proc. 4th Int Conf. on Very Large Data Bases, West Berlin, Germany, Sept 1978, pp. 526-534Google Scholar
- 9 BORKIN, S.A. Eqmvalence properties of semantic data models for database systems, TR-206, Laboratory of Computer Science, M I T, Cambridge, Mass, Jan 1979Google Scholar
- 10 CHEN, P P-S The ent~ty-relat,onshlp modelmtoward a umfied view of data. ACM Trans. Database Syst. 1, 1 (March 1976), 9-36. Google Scholar
- 11 CODASYL. Report of the CODASYL data definmon language committee. In.l" Sysl. 3, 4 (1978), 247-320.Google Scholar
- 12 CODD, E F A relational model of data for large shared data banks Commun A CM 13, 6 (June 1970), 377-387. Google Scholar
- 13 CODD, E F. Normalized data base structure. A brief tutorial Proc. ACM SIGFIDET Workshop on Data Description, Access and Control, San Diego, Calif'., Nov. 1971, pp 1-18.Google Scholar
- 14 CODD, E F Further normahzauon of the data base relation model In Data Base Systems, Courant Computer Science Symposium 6, R Rustm, Ed, Prentice-Hall, Englewood Cliffs, N J, 1972, pp 3344Google Scholar
- 15 COOD, EF Recent investigations m relational data base systems. In Information Processing 74, North-Holland, Amsterdam, 1974, pp 1017-1021Google Scholar
- 16 DATE, C J An Introducoon to Data Base Systems, 2nd ed Addison-Wesley, Reading, Mass, 1977 Google Scholar
- 17 DELOBEL, C Normalrzatlon and hierarchical dependencies m the relational data model A CM Trans Database Syst 3. 3 (Sept 1978), 201-222 Google Scholar
- 18 FAGIN, R Multlvalued dependencies and a new normal form for relational data bases A CM Trans Database Syst. 2, 3 (Sept 1977), 262-278 Google Scholar
- 19 FAGin, R,The decomposition versus the synthetm approach to relational data base design. Proc. 3rd Int. Conf aa Very Large Data Bases, Tokyo, Japan, Oct 1977, pp. 441-446.Google Scholar
- 20 JOHNSON, H R., LARSON, J A, AND LAWRENCE, J.D A common data base architecture. IEEE Workshop on Data Management and Storage Hierarchies, Lake Arrowhead, Calif., Sept 1978Google Scholar
- 21 KALINICHENKO, L A. Relational-network data structure mapping In Modehng m Data Base Management Systems, G M. NJ.lssen, Ed, North-Holland, Amsterdam, 1976, pp. 303-309Google Scholar
- 22 KERSCSaWRO, L, KLUG, A., AND Tslcnp.rrzIs, D C A taxonomy of data models In Systems for Large Data Bases P C Lockemann and E.J Neuhold, Eds, North-Holland, New York, 1977Google Scholar
- 23 LIEN, Y E Multtvalued dependencies with null values m relational data bases Proc 5th Int. Conf on Very Large Data Bases, Rio de Janelro, Brazd, Oct 1979, pp 61-66Google Scholar
- 24 LIEN, Y.E. Hlerarclucal schemata for relational databases, A CM Trans Database Syst 6, 1 (March 1981), 48-69. Google Scholar
- 25 RISSANEN, J.Theory of relauons for databases--A tutorial study Proc. 7th Symposium on Mathemaacal Foundations of Computer Science, Lecture Notes m Computer Science 64, J. Wmkowski, Ed, Sprmger-Verlag, New York, 1978, pp 537-551Google Scholar
- 26 Sciore, E The umversal instance and database design, PhD. Dissertation, TR-271, Dep, of Electrical Engmeermg and Computer Science, Princeton Umv, Princeton, N J, June 1980 Google Scholar
- 27 SMITH, J M, AND SMITH, D.C P Database abstractions Aggregation and generahzatton A CM Trans. Database Syst. 2, 2 (June 1977), 105-133 Google Scholar
- 28 Tsichritzis, D C LSL A link and selector language Proc ACM-SIGMOD Int Conf. on Managemeat of Data, Washington, D C., June 1976, pp 123-134 Google Scholar
- 29 TSlCtIRITZtS, D.C, AND KLUG, A., F_Ms. The ANSI/X3/SPARC DBMS framework report of the study group on database management systems lnf Syst 3, 3 (1978), 173-192Google Scholar
- 30 ZANIOLO, C Analysis and design of relatmnal schemata for data base systems, Ph.D Dissertation, Tech. Pep UCLA-ENG-7669, Umv. of Cahfornm at Los Angeles, Los Angeles, Cahf, 1976 Google Scholar
- 31 ZANIOLO, C Relatmnal views m a data base system: Support for queries Proc IEEE Computer Society Computer Software and Appheations Conf, Chicago, II1, Nov 1977, pp 267-275Google Scholar
- 32 ZANIOLO, C.Multimodal external schemas for CODASYL data base management systems IFIP TC-2 Working Conference on Data Base Architecture, Venice, Italy, June 1979, pp 171-190Google Scholar
- 33 ZANIOLO, C, AND MELKANOFF, M A On the design of relational database schemas A CM Trans Database Syst 6. 1 (March 1981), 1-47 Google Scholar
Index Terms
- On the Equivalence of Database Models
Recommendations
Discovering quasi-equivalence relationships from database systems
CIKM '99: Proceedings of the eighth international conference on Information and knowledge managementAssociation rule mining has recently attracted strong attention and proven to be a highly successful technique for extracting useful information from very large databases. In this paper, we explore a generalized affinity-based association mining which ...
An Abstract Equivalence Notion for Object Models
Equivalence notions for object models are usually too concrete in the sense that they assume that the compared models are formed by elements with the same names. This is not adequate in several situations: during model refactoring, when using auxiliary ...
Comments