References

[AAB80] P. Atzeni, G. Ausiello, C. Batini, and M. Moscarini, Conceptual relations among relational database schemata. Technical report TR-80-32, lnstituto di Automatica, University of Rome, Rome, 1980.

[AAB82] P. Atzeni, G. Ausiello, C. Batini, and M. Moscarini, Inclusion and equiv­alence between relational database schemata. TCS, 19, 1982, 267-285.

[AAB95] M. Albrecht, M. Altus, E. Buchholz, A. Diisterhoft, and B. Thalheim, The rapid application and database development (RADD) workbench- A com­fortable database design tool. In [CAiSE'95], 327-340.

[AAB96] M. Albrecht, M. Altus, E. Buchholz, H. Cyriaks, A. Diisterhoft, J. Lew­erenz, H. Mehlan, M. Steeg, and K.-D. Schewe, Die Entwicklung einer Daten­bankentwurfsumgebung der dritten Generation: RADD - Rapid Application and Database Development. Proc. 4. Leipziger lnformatik-Tage- LIT'96 (eds. K.-P. Jantke, G. Grieser), Leipzig, 1996, 103-106.

[AAS83] G. Ausiello, A. D. Atri, and D. Sacca, Graph algorithms for functional dependency manipulation. JACM, 30, 1983, 752-766.

[AAS97] M. Albrecht, M. Altus, and M. Steeg, Application-oriented design of be­havior: A transformational approach using RADD. In [ER'97], 323-332.

[AbB84] S. Abiteboul and N. Bidoit, Non-first normal form relations to represent hierarchical organized data. Proc. 3rd ACM SIGACT-SIGMOD Symp. on Prin­ciples of Database Systems- PODS'84, Waterloo, Ontario, Canada, 1984, ACM Press, New York, 1985, 119-132.

[AbB88] S. Abiteboul and C. Beeri, On the power of languages for the manipulation of complex objects. Technical report 846, INRIA, Le Chesney, 1988.

[ABD89] M. P. Atkinson, F. Bancilhon, D. J. DeWitt, K. R. Dittrich, D. Maier, and S. B. Zdonik, The object-oriented database system manifesto. Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases- DOOD'89 (eds. W. Kim, J.-M. Nicolas, S. Nishio), Kyoto, 1989, Elsevier Science, Amsterdam, 1990, 40-57.

[ABD90] M. P. Atkinson, F. Bancilhon, D. J. DeWitt, K. R. Dittrich, D. Maier, and S. B. Zdonik, The object-oriented database system manifesto. Provided at SIGMOD, 1990, Elsevier Science/North-Holland, Amsterdam, 1990.

0 Throughout the bibliography we shall use common abbreviations such as: ACM TODS: ACM Transactions on Database Systems, ACM TOIS: ACM Transactions on Information Systems, CACM: Communications of the ACM, DKE: Data & Knowledge Engineering, IPL: Information Processing Letters, JACM: Journal of the ACM, LNCS: Lecture Notes in Computer Science, TCS: Theoretical Computer Science.

560 References

[ABD95] M. Albrecht, E. Buchholz, A. Diisterhoft, and B. Thalheim, Ein Werkzeug zur Gewinnung semantischer lnformationen aus natiirlichsprachigen Eingaben und Beispieldaten. Proc. 6. GI-Fachtagung, Datenbanksysteme in Biiro, Technik und Wissenschaft- BTW'95 (ed. G. Lausen), Dresden, 1995, lnformatik Aktuell, Springer, Berlin, 1995, 441-460.

[ABD98] M. Albrecht, E. Buchholz, A. Diisterhoft, and B. Thalheim, An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. Proc. Workshop Semantics in Databases ( eds. L. Libkin, B. Thalheim), Rez, LNCS 1358, Springer, Berlin, 1998, 1-28.

[ABG93] A. Albano, R. Bergamini, G. Ghelli, and R. Orsini, An object data model with roles. Proc. 19th Int. Conf. on Very Large Databases- VLDB'93 (eds. R. Agrawal, S. Baker, D. A. Bell), Dublin, Morgan Kaufmann, Los Altos, 1993, 39-51.

[AbH84] S. Abiteboul and R. Hull, IFO: A formal semantic database model. Proc. 3rd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems -PODS'84, Waterloo, Ontario, Canada, ACM Press, New York, 1984, 119-132.

[AbK89] S. Abiteboul and P. C. Kanellakis, Object Identity as a Query Language Primitive. Proc. 1989 ACM SIGMOD Int. Conf. on the Management of Data - SIGMOD'89 (eds. J. Clifford, B. G. Lindsay, D. Maier), Portland, Oregon, SIGMOD Record, 18(2), 1989, 159-173.

[AbK91] S. Abiteboul and P. C. Kanellakis, The two facets of object-oriented data models. IEEE Data Engineering Bulletin, 14(2), 1991, 3-7.

[ABL81] P. Atzeni, C. Batini, M. Lenzerini, and F. Villanelli, INCOD: A system for conceptual design of data and transactions in the entity-relationship model. In [ER'81], 375-410.

[ABM80] G. Ausiello, C. Batini, and M. Moscarini, On the equivalence among data base schemata. Proc. 1st Int. Conf. on Data Bases ( eds. S. M. Deen, P. Hammersley), Aberdeen, 1980, Heyden & Son, 1980, 34-46.

[ABU79] A. V. Aho, C. Beeri, and J.D. Ullman, The theory of joins in relational databases. ACM TODS, 4(3), 1979, 297-314. Corrigendum: ACM TODS, 8(2), 1983, 287.

[AbV85] S. Abiteboul and V. Vianu, Transactions and integrity constraints. Proc. 4th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems -PODS'85, Portland, Oregon, ACM Press, New York, 1985, 193-204.

[AbV87] S. Abiteboul and V. Vianu, A transaction language complete for database update and specification. Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems - PODS'87, San Diego, California, ACM Press, New York, 1987, 260-268.

[AbV88a] S. Abiteboul and V. Vianu, Procedural and declarative database update languages. Proc. 7th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems- PODS'88, Austin, Texas, ACM Press, New York, 1988, 240-250.

[AbV88b] S. Abiteboul and V. Vianu, The connection of static constraints with determinism and boundedness of dynamic specifications. Proc. 3rd Int. Conf. on Data and Knowledge Bases: Improving Usability and Responsiveness -JCDKB'88 (eds. C. Beeri, J. W. Schmidt, U. Dayal), Jerusalem, Morgan Kauf­mann, San Mateo, 1988, 324-334.

[AbV95] S. Abiteboul and J. Vander Bussche, Deep equality revisited. Proc. 4th Int. Conf. on Deductive and Object-Oriented Databases - DOOD'95 (eds. T. W. Ling, A. 0. Mendelzon, L. Vielle), Singapore, LNCS 1013, Springer, Berlin, 1995, 213-228.

[ABW88] K. R. Apt, H. A. Blair, and A. Walker, Towards a theory of declarative knowledge. In [Min88], 89-148.

References 561

[AC085] A. Albano, L. Cardelli, and R. Orsini, Galileo: A strong-typed, interactive conceptual language. ACM TODS, 10(2), 1985, 230-260.

[ADD85] A. Albano, V. De Antonellis, and A. Di Leva, Computer-aided database design: The DATAID project. Computer-Aided Database Design, 1985, North­Holland, Amsterdam, 1-13.

[Adi81] M. Adiba, Derived relations: A unified mechanism for views, snapshots, and distributed data. Proc. 7th Int. Conf. on Very Large Databases- VLDB'81 (eds. C. Zaniolo, C. Delobel), Cannes, IEEE Computer Society Press, 1981, 293-305.

[ADJ89] R. Agrawal, S. Dar, and H. V. Jagadish, Composition of database rela­tions. Proc. 5th Int. Conf. on Data Engineering - ICDE'89, Los Angeles, Cali­fornia, IEEE Computer Society Press, 1989, 102-108.

[ADL76] M. Adiba, C. Delobel, and M. Leonard, A unified approach for modelling data in logical data base design. Proc. Workshop Modelling in Data Base Man­agement Systems (ed. N.-H. Nijssen), 1976, 311-338.

[AdN86] M. E. Adiba and G. T. Nguyen, Handling constraints and meta-data on a generalized data management system. Proc. 1st Int. Workshop on Ex­pert Database Systems (ed. L. Kerschberg), Univ. South Carolina, 1984, Ben­jamin/Cummings, Redwood City, 1986, 487-504.

[AFS81] S. S. Al-Fedaghi and P. Scheuermann, Mapping considerations in the de­sign of schemas for the relational model. IEEE TSE, 7(1), 1981, 99-111.

[AFT90] S. S. Al-Fedaghi and B. Thalheim, Preserving two-tuple dependencies under projection. Acta Cybemetica, 9(4), 1990, 441-458.

[AFT92] S. S. Al-Fedaghi and B. Thalheim, The key concept in database models. Unpublished manuscript, 1992.

[Ago86] M. Agosti, Database design: A classified and annotated bibliography. Cam­bridge University Press, 1986.

[AG084] A. Albano, F. Giannotti, R. Orsini, and D. Pedreschi, Data types and objects in conceptual modeling. 2nd Workshop on Expert Database Systems, Univ. South Carolina, 1984.

[AGS97J R. Agrawal, A. Gupta, and S. Sarawagi, Modeling multidimensional databases. Proc. 13th Int. Conf. on Data Engineering- ICDE'97 (eds. A. Gray, P.-A. Larson), Birmingham, 1997, IEEE Computer Society Press, 1997, 232-243.

[AHL96] E. Andonoff, G. Hubert, A. Le Pare, and G. Zurfluh, Integrating versions in the OMT models. In [ER'96J, 472-487.

[AhU79] A. V. Aho and J.D. Ullman, The universality of data retrieval languages. Proc. 6th Annual ACM Symp. on Principles of Programming Languages -POPL'79, San Antonio, Texas, 1979, 110-120.

[AHU93] A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data structures and algo­rithms. Addison-Wesley, Reading, MA, 1993.

[AHV95] S. Abiteboul, R. Hull, and V. Vianu, Foundations of databases. Addison­Wesley, Reading, MA, 1995.

[Ait91] H. Ai't-Kaci, A glimpse of paradise. Proc. 1st Int. East/West Data Base Workshop- EWDW'90, Next Generation Information Systems Technology ( eds. J. W. Schmidt, A. A. Stognij), Kiev, LNCS 504, Springer, Berlin, 1991, 17-25.

[Alb91] J. Albert, Algebraic properties of bag data types. Proc. 17th Conf. on Very Large Databases - VLDB'91 (eds. G. M. Lohman, A. Semadas, R. Camps), Barcelona, Morgan Kaufmann, San Mateo, 1991, 211-219.

[Alb92] M. Albrecht, Erfassung von Integritiitsbedingungen in Datenbanken. Diploma Thesis, Universitiit Rostock, Fachbereich Informatik, 1992.

[Alb94] M. Albrecht, Semantics acquisition. Project report Th 495/2-1, Rostock University, Computer Science Dept., 1994.

562 References

[Alt96a] S. Alter, Information systems: A management perspective. 2. ed., Ben­jamin/Cummings, Menlo Park, 1996.

[Alt96b] M. Altus, A modular design strategy for a flexible graphical database design environment: An experimental study. In [ER'96], 146-162.

[Alt96c] M. Altus, User modeling for conceptual database design based on an ex­tended entity relationship model: A preliminary study. Proc. 3rd Int. Workshop on Advances in Database and Information Systems- ADBIS'96, Moscow, 1996, Moscow Engineering Physical Institute (Technical University), 46-51.

[AlT92] M. Altus and B. Thalheim, Design by units and its graphical implementa­tion. Proc. 4th GI-Workshop on FUndamentals of Databases (eds. U. W. Lipeck, R. Manthey), Report ECRC-92-13, ECRC, Miinchen, 1992, 31-49.

[AMM98] P. Atzeni, G. Mecca, and P. Merialdo, Design and maintenance of data­intensive web sites. Proc. 6th Int. Conf. on Advances in Database Technology - EDBT'98 (eds. H.-J. Schek, F. Saltor, I. Ramos, G. Alonso), Valencia, LNCS 1377, Springer, Berlin, 1998, 436-450.

[And94] M. Andersson, Extracting an entity relationship schema from a relational database through reverse engineering. In [ER'94], 403-419.

[Ang96] J. Angele, Conceptual modeling in KARL and G-KARL. Proc. Workshop ER Case Tools, Research Track (eds. B. Thalheim, S. Yigitbasi), BTU Cottbus, 1996, 15-28.

[ANS75] ANSI/X3/SPARC, Study group on data base management systems. In­terim Report, EDT, ACM SIGMOD Records, 7(2), 1975.

[App83] H.-J. Appelrath, Von Datenbanken zu Expertensystemen. PhD Th., Univ. Dortmund, 1983.

[App84] D. S. Appleton, Business rules: the missing link. Datamation, 15(30), 1984, 145-150.

[ApP87] K. R. Apt and J.-M. Pugin, Maintenance of stratified databases viewed as a belief revision system. Technical Report, TR-87-41, Univ. of Texas, 1987.

[Apt90] K. R. Apt, Logic programming. In: Handbook of Theoretical Computer Science (ed. J. Van Leeuwen), Vol. B, Formal Models and Semantics, Elsevier Science, Amsterdam, 1990, 493-574.

[ArD80] W. W. Armstrong and C. Delobel, Decompositions and functional depen­dencies in relations. ACM TODS, 5(4), 1980, 404-430.

[Arm74] W. W. Armstrong, Dependency structures of data base relationships. Proc. IFIP'74 (ed. J. L. Rosenfeld), Stockholm, 1974, Elsevier Science, North­Holland, Amsterdam, 1974, 580-583.

[Arm66] D. B. Armstrong, On finding a nearly minimal set of fault detection tests for combinatorial logic nets. IEEE TEC 1966, EC-15, 66-73.

[ArS81] S. K. Arora and K. C. Smith, A graphical interpretation of dependency structures in relational data bases. Int. J. Comp. and Inf. Sci., 1981, 10(3), 187-213.

[AsJ96] P. Assenova and P. Johannesson, Improving quality in conceptual modeling by the use of schema transformations. In [ER'96], 277-291.

[AtC81] P. Atzeni and P. P. Chen, Completeness of query languages for the entity­relationship model. In [ER'81], 109-121.

[AtC87] P. Atzeni and E. P. F. Chan, Independent database schemes under functional and inclusion dependencies. Proc. 13th Int. Conf. on Very Large Databases- VLDB'87 (eds. P.M. Stocker, W. Kent, P. Hammersley), Brighton, 1987, Morgan Kaufmann, San Mateo, 1987, 159-166.

[AtC91] P. Atzeni and E. P. F. Chan, Independent database schemes under func­tional and inclusion dependencies. Acta Informatica, 28(8), 1991, 777-779.

[AtD93] P. Atzeni and V. De Antonellis, Relational database theory. Addison­Wesley, Redwood City, 1993.

References 563

[AtM84a] P. Atzeni and N. M. Morfuni, Functional dependencies in relations with null values. IPL, 18( 4), 1984, 233-238.

[AtM84b] P. Atzeni and N. M. Morfuni, Functional dependencies and disjunctive existence constraints in database relations with null values. Proc. Automata, Languages and Programming, 11th Colloquium- ICALP'84 (ed. J. Paredaens), Antwerp, LNCS 172, Springer, Berlin, 1984, 69-81.

[AtP86] P. Atzeni and D. S. Parker, Set containment inference. In [ICDT'86], 73-90. [ATK94] A. Ait-Braham, B. Theodoulidis, and G. Karvelis, Conceptual modelling

and manipulation of temporal databases. In [ER'94], 296-313. [Azm90] M. Azmoodeh, BRMQ: A database interface facility based on graph

traversals and extended relationships on groups of entities. The Computer Jour­nal, 33(1), 1990, 31-39.

[AzP86] N. Azar and E. Pichat, Translation of an extended entity-relationship model into the universal relation with inclusion formalism. In [ER'86], 253-268.

[Bab82] E. Babb, Joined normal form: A storage encoding for relational databases. ACM TODS, 7(4), 1982, 588-614.

[Bac66] C. W. Bachman, On a generalized language for organization and manipu­lation. CACM, 9(3), 1966, 225-226.

[Bac68] C. W. Bachman, Data structure diagrams. Proc. lAG Conf. 'File 68' Helsin­gor, 1968, publ. No.3; File design methods, 181-192.

[BaC81] J. Barwise and R. Cooper, Generalized quantifiers and natural language. Linguistics and Philosophy, 4, 1981, 159-219.

[BaC85] C. Batini and S. Ceri, Databases design: Methodologies, tools, and en­vironments (Panel). Proc. 1985 ACM SIGMOD Int. Conf. on Management of Data (ed. S. B. Navathe), Austin, Texas, SIGMOD Record, 14(4), 1985, 148-150.

[Bac88] C. W. Bachman, A CASE for reverse engineering. Datamation, 34, 1988, 13.

[Bac96] C. W. Bachman, Impact of object oriented thinking on ER modeling. In [ER'96], 1-4.

[Bad78] D. Z. Badal, On semantic integrity in centralized and distributed database systems. Proc. Hawaii Int. Conf. on System Sciences- HICSS 11, 1978, 63-74.

[Bad84] D. Z. Badal, On semantic integrity enforcement in centralized DBMS and distributed DBMS based on slow (geographically distributed) and fast (local area) networks. Information Systems, 9(2), 1984, 121-139.

[BaD92] D. Batra and J. G. Davis, Conceptual data modeling in database design: Similarities and differences between expert and novice designers. Int. Journal of Man-Machine Studies, 37(1), 1992, 83-101.

[BaL82] C. Batini and M. Lenzerini, A methodology for data schema integration in the entity relationship model. Technical Report, R. 82-09, Univ. di Roma, lnst. Automatica, 1982.

[Bal96] H. Balzert, Lehrbuch der Software-Technik. Spektrum Akademischer Ver­lag, Berlin, 1996.

[BaR84] F. Bancilhon and P. Richard, A sound and complete axiomatization of embedded cross dependencies. TCS, 34, 1984, 343-350.

[BaR86] F. Bancilhon and R. Ramakrishnan, An amateur's introduction to re­cursive query processing strategies. Proc. 1986 ACM SIGMOD Int. Conf. on Management of Data (ed. C. Zaniolo), Washington, D.C., SIGMOD Record, 15(2), 1986, 16-52.

[BaR88] F. Bancilhon and R. Ramakrishnan, Performance evaluation of data­intensive logic programs. In [Min88], 439-517.

[Bar92a] R. Barker, CASE method (entity relationship modelling). Addison­Wesley, Wokingham, England, 1992.

564 References

[Bar92b] R. Barker, CASE method (function and process modelling). Addison­Wesley, Wokingham, England, 1992.

[BaS81] F. Bancilhon and N. Spyratos, Independent components of data bases. Proc. 7th Int. Conf. on Very Large Databases - VLDB'81, Cannes, 1981, IEEE Press, New York, 1981, 398-408.

[Ba V94] N. Bassiliades and I. Vlahavas, Modelling constraints with exceptions in object-oriented databases. In [ER'94], 189-204.

[BBB88] F. Bancilhon, G. Barbedette, V. Benzaken, C. Delobel, S. Gamerman, C. U!cluse, P. Pfeffer, P. Richard, and F. Velez, The design and implementation of 0 2 , an object-oriented database system. Proc. 2nd Int. Workshop on Object­Oriented Database Systems (ed. K. R. Dittrich), Bad Miinster, 1988, LNCS 334, Springer, Berlin, 1988, 1-32.

[BBD79] J. Biskup, P. A. Bernstein, and U. Dayal, Synthesizing independent data base schemes. Proc. 1979 ACM SIGMOD Int. Conf. on Management of Data (ed. P. A. Bernstein), Boston, Massachusetts, ACM Press, New York, 1979, 143-151.

[BBG78] C. Beeri, P. Bernstein, and N. Goodman, A sophisticate's introduction to database normalization theory. Proc. 4th Int. Conf. on Very Large Databases -VLDB'78 (ed. S. B. Yao), West Berlin, 1978, 113-124.

[BBG89] C. Beeri, P. A. Bernstein, and N. Goodman, A model for concurrency in nested transaction systems. JACM, 36(2), 1989, 230-269.

[BBS86] J. Biskup, H. H. Briiggemann, L. Schnetgoke, and M. Kramer, One flavor assumption and gamma-acyclicity for universal relation views. Proc. 5th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems- PODS'86, Cam­bridge, MA, 1986, ACM Press, New York, 1986, 148-159.

[BBT81] R. L. Benneworth, C. D. Bishop, C. J. M. Turnbull, W. D. Holman, and F. M. Monette, The implementation of GERM, an entity-relationship data base management system. Proc. 7th Int. Conf. on Very Large Databases- VLDB'81, Cannes, 1981, IEEE Press, New York, 1981, 478-484.

[BCD95] E. Buchholz, H. Cyriaks, A. Diisterhoft, H. Mehlan, and B. Thalheim, Applying a natural language dialogue tool for designing databases. Proc. 1st Workshop on Applications of Natural Language to Database Design (ed. M. Bouzeghoub), Paris, Afcet, 1995, 119-133.

[BCN92] C. Batini, S. Ceri, and S. Navathe, Conceptual database design (an entity­relationship approach). Benjamin/Cummings, Redwood City, 1992.

[BCP94] E. Baralis, S. Ceri, and S. Paraboschi, Declarative specification of con­straint maintenance. In [ER'94], 205-222.

[BCV86] A. P. Buchmann, R. S. Carrera, and M. A. Vazquez-Galindo, A general­ized constraint and exception handler for an object-oriented CAD-DBMS. Proc. 1st Int. Workshop on Object-Oriented Database Systems- OODBS'86 (eds. K. R. Dittrich, U. Dayal), Pacific Grove, California, 1986, IEEE-CS, 1986, 38-49.

[BDD84] C. Batini, V. De Antonellis, and A. Di Leva, Database design activities within the DATAID project. IEEE Database Engineering Bulletin, 7(4), 1984, 16-21.

[BDF84] C. Beeri, M. Dowd, R. Fagin, and R. Statman, On the structure of Arm­strong relations for functional dependencies. JACM, 31(1), 1984, 30-46.

[BDG83] P. Bertaina, A. Di Leva, and P. Giolito, Logical design in CODASYL and relational environments. In: Methodology and Tools for Data Base Design ( ed. S. Ceri), North-Holland, Amsterdam, 1983, 85-117.

[BDH80] A. Bekessy, J. Demetrovics, L. Hannak, P. Frankl, and G. 0. H. Katona, On the number of maximal dependencies in a database relation of fixed order. Discrete Math., 30, 1980, 83-88.

References 565

[BDK87] G. Burosch, J. Demetrovics, and G. 0. H. Katona, The poset of closures as a model of changing databases. Order 4, 1987, 127-142.

[BDK91] G. Burosch, J. Demetrovics, G. 0. H. Katona, D. J. Kleitman, and A. A. Sapozhenko, On the number of databases and closure operations. TCS, 78(2), 1991, 377-381.

[BDK92] P. Buneman, S. Davidson, and A. Kosky, Theoretical aspects of schema merging. Proc. 3rd Int. Conf. on Extending Database Technology - EDBT'92 (eds. A. Pirotte, C. Delobel, G. Gottlob), Vienna, 1992, LNCS 580, Springer, Berlin/New York, 1992, 152-167.

[BDL91] J. Biskup, J. Demetrovics, L. 0. Libkin, and M. Muchnik, On relational database schemes having a unique minimal key. J. of Information Processing and Cybernetics, ElK, Berlin, 27, 1991, 217-225.

[BDR85] R. P. Bragger, A. Dudler, J. Rebsamen and C. A. Zehnder, Gambit: An interactive database design tool for data structures, integrity constraints and transactions. IEEE TSE, 11(7), 1985, 574-583.

[BDT97] E. Buchholz, A. Diisterhoft, and B. Thalheim, Capturing information on behaviour with the RADD-NLI: A linguistic and knowledge-based approach. DKE, 23(1), 1997, 33-46.

[BeB79] C. Beeri and P. A. Bernstein, Computational problems related to the de­sign of normal forms in relational schemes. ACM TODS, 4(1), 1979, 30-59.

[BeB85] J. Berman and W. J. Blok, Positive Boolean dependencies. University of Chicago, Research Reports in Computer Science, No.5, 1985.

[BeD79] A. Bekessy and J. Demetrovics, Contribution to the theory of data base relations. Discrete Math., 27, 1979, 1-10.

[Bee80] C. Beeri, On the membership problem for functional and multivalued de­pendencies in relational databases. ACM TODS, 5(3), 1980, 241-259.

[Bee89] C. Beeri, Formal models for object oriented databases. Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases- DOOD'89 (eds. W. Kim, J.-M. Nicolas, S. Nishio), Kyoto, 1989, Elsevier Science, Amsterdam, 1990, 405-430.

[Bee90] C. Beeri, A formal approach to object oriented databases. DKE, 5(4), 1990, 353-382.

[Bee91] C. Beeri, Theoretical foundations of OODB's- a personal perspective. Data Engineering Bulletin, 14(2), 1991, 8-12.

[Bee92] C. Beeri, New data models and languages - the challenge. Proc. 11th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems - PODS'92, San Diego, California, 1992, ACM Press, New York, 1992, 1-15.

[Bee93] C. Beeri, Some thoughts on the future evolution of object-oriented database concepts. Proc. 5. GI-Fachtagung, Datenbanksysteme in Biiro, Technik und Wissenschaft - BTW'93 (eds. W. Stucky, A. Oberweis), Braunschweig, 1993, Informatik Aktuell, Springer, Berlin, 1993, 18-32.

[BeG80] P. A. Bernstein and N. Goodman, What does Boyce-Codd normal form do. Proc. 6th Int. Conf. on Very Large Databases- VLDB'80, Montreal, 1980, IEEE Computer Society Press, New York, 1980, 245-259.

[BeH81] C. Beeri and P. Honeyman, Preserving functional dependencies. SIAM J. Computing, 10(3), 1981, 647-656.

[BeK86] C. Beeri and M. Kifer, An integrated approach to logical design of rela­tional database schemes. ACM TODS, 11(2), 1986, 134-158.

[BeK90] C. Beeri and Y. Kornatzky, Algebraic optimization of object-oriented query languages. In [ICDT'90], 72-88.

[BeL93] A. J. Bernstein and P. M. Lewis, Concurrency in programming and database systems. Jones and Bartlett, Sudbury, MA, 1993.

[Bel95] S. Bell, The expanded implication problem of data dependencies. Technical Report LS-8-16, Comp. Sci. Dept., Dortmund University, 1995.

566 References

[BeM91] C. Beeri and T. Milo, Subtyping in OODB's. Proc. lOth ACM SIGACT­SIGMOD-SIGART Symp. on Principles of Database Systems- PODS'91, Den­ver, Colorado, 1991, ACM Press, New York, 1991, 300-314.

[Ben88] K. Benecke, On hierarchical normal forms. In [MFDBS'87], 10-19. [Bes95] E. Best, Semantik: Theorie sequentieller und paralleler Programmierung.

Vieweg, Wiesbaden, 1995. [BeT92] C. Beeri and B. Thalheim, Identification is well-founded in object-oriented

databases. Manuscript, 1992. [BeT93] J. B. Behm and T. J. Teorey, Relative constraints in ER data models. In

[ER'93], 46-59. [BeT95] C. Beeri and B. Thalheim, Can I see your identification, please? - Iden­

tification is well-founded in object-oriented databases. Manuscript, Cottbus­Jerusalem, 1995.

[BeT99] C. Beeri and B. Thalheim, Identification as a primitive of database models. Proc. Fundamentals of Information Systems, 7th Int. Workshop on Foundations of Models and Languages for Data and Objects- FoMLaD0'98 (eds. T. Polle, T. Ripke, K.-D. Schewe), Timmel, Ostfriesland, 1998, Kluwer, London, 1999, 19-36.

[BeV81] C. Beeri and M. Y. Vardi, On the properties of join dependencies. In [GMN81], 25-72.

[BeV84a] C. Beeri and M. Y. Vardi, A proof procedure for data dependencies. JACM, 31(4), 1984, 718-741.

[BeV84b] C. Beeri and M. Y. Vardi, Formal systems for tuple and equality gener­ating dependencies. SIAM J. Computing, 13(1), 1984, 76-98.

[BeV85] C. Beeri and M. Y. Vardi, Formal systems for join dependencies. TCS, 38, 1985, 99-116.

[BFH77] C. Beeri, R. Fagin, and J. H. Howard, A complete axiomatization for functional and multivalued dependencies in database relations. Proc. 1977 ACM SIGMOD Int. Conf. on Management of Data- SIGMOD'77 (ed. D. C. P. Smith), Toronto, ACM Press, New York, 1977, 47-61.

[BFM83] C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes. JACM, 30(3), 1983, 479-513.

[BFW98] P. Buneman, W. Fan, and S. Weinstein, Path constraints on semistruc­tured and structured databases. Proc. 17th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems - PODS'98, Seattle, Washington, 1998, ACM Press, New York, 1998, 129-138.

[BGM85] M. Bouzeghoub, G. Gardarin, and E. Metais, Database design tools: An expert system approach. Proc. 11th Int. Conf. on Very Large Data Bases -VLDB'85 (eds. A. Pirotte, Y. Vassiliou), Stockholm, 1985, Morgan Kaufmann, San Mateo, 1985, 82-95.

[BHG87] P. A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency control and recovery in database systems. Addison-Wesley, Reading, MA, 1987.

[BHH97] R. Breu, U. Hinkel, C. Hofmann, C. Klein, B. Paech, B. Rumpe, and V. Thurner, Towards a formalization of the unified modeling language. Proc. 11th European Conf. on Object-Oriented Programming- ECOOP'97 (eds. M. Aksit, S. Matsuoka), Jyviiskylii, LNCS 1241, Springer, Berlin, 1997, 344-366.

[BiB83] J. Biskup and H. H. Briiggemann, Designing acyclic database schemes. In [GMN83], 3-26.

[BiB89] J. Biskup and H. H. Briiggemann, An object-surrogate-value approach for database languages. Technical report 16-3-89, University Hildesheim, Dept. Computer Science, 1989.

References 567

[BiC86) J. Biskup and B. Convent, A formal view integration method. Proc. 1986 ACM SIGMOD Int. Conf. on the Management of Data (ed. C. Zaniolo), Wash­ington, D. C., SIGMOD Record, 15(2), 1986, 398-407.

[BiD91] J. Biskup and P. Dublish, Objects in relational database schemes with functional, inclusion and exclusion dependencies. In [MFDBS'91], 276-290.

[BiN78) H. Biller and E. J. Neuhold, Semantics of data bases: The semantics of data models. Information Systems, 3(1), 1978, 11-30.

[BinGO] A. Binemann-Zdanowics, Reconsidering deductive systems of Bell, Dolezal, Janas and McAllister. Cottbus 1999, submitted for publication.

[Bis78) J. Biskup, On the complementation rule for multi valued dependencies in database relations. Acta Informatica, 10, 1978, 297-305.

[Bis81] J. Biskup, Uber Datenbankrelationen mit Nullwerten und Maybe-Tupeln. Schriften zur Informatik und Angewandten Mathematik, Aachen, 1981, 67.

[Bis83) J. Biskup, A foundation of Codd's relational maybe-operations. ACM TODS, 8(4), 1983, 608-636.

[Bis89] J. Biskup, Boyce-Codd normal form and object normal forms. IPL 32(1), 1989, 29-33.

[Bis91] H.-J. Bisle-Miiller, Artikelworter im Deutschen: semantische und pragma­tische Aspekte ihrer Verwendung. Niemeyer, Tiibingen, 1991.

[Bis95) J. Biskup, Foundations of information systems. Vieweg, Wiesbaden, 1995 (In German).

[Bis98) J. Biskup, Achievements of relational database schema design theory re­visited. Proc. Workshop on Semantics in Databases - Selected Papers ( eds. L. Libkin, B. Thalheim), Prague, 1995, LNCS 1358, Springer, Berlin, 1998, 29-54.

[BIS93) P. Balasubramanian, T. Isakowitz, and E. A. Stohr, Designing hypermedia applications. Proc. ACM Hypertext'93- Posters, 1993, 33.

[BjH84) A. Bjomerstedt and C. Hulten, RED1: A database design tool for the relational model of data. IEEE Database Engineering Bulletin, 7(4), 1984, 34-39.

[BJ091) P. Buneman, A. Jung, and A. Ohori, Using powerdomains to generalize relational databases. TCS, 91(1), 1991, 23-55.

[BID96] H. Blockeel and L. De Readt, Inductive database design. Proc. 9th Int. Symp. on Foundation of Intelligent Systems - ISMIS'96 (eds. Z. W. Ras, M. Michalewicz), Zakopane, 1996, LNCS 1079, Springer, Berlin, 1996, 376-385.

[BLN86] C. Batini, M. Lenzerini, and S. B. Navathe, A comparative analysis of methodologies for database schema integration. ACM Computing Surveys, 18( 4)' 1986, 323-364.

[BLS94) P. Buneman, L. Libkin, D. Suciu, V. Tannen, and L. Wong, Comprehen­sion syntax. SIGMOD Record, 23(1), 1994, 87-96.

[BlT83] A. Blickle and A. Tarlecki, Naive denotational semantics. Proc. 9th IFIP, Information Processing, 1983, North-Holland, Amsterdam, 1983, 345-355.

[BlT96] A. C. Bloesch and T. A. Halpin, ConQuer: A conceptual query language. In [ER'96], 121-133.

[BMP96] J. Biskup, R. Menzel, T. Polle, andY. Sagiv, Decomposition of relation­ships through pivoting. In [ER'96], 28-41.

[BMR85] D. Bitton, H. Mannila, and K.-J. Rii.ihii, Design-by-example: A design tool for relational databases. Technical Report, TR 85-692, Cornell University, Computer Science Dept., 1985.

[BMS84] M. L. Brodie, J. Mylopoulos, and J. W. Schmidt (eds.), On conceptual modelling - Perspectives from artificial intelligence, databases, and program­ming languages. Topics in Information Systems, Springer, New York, 1984.

568 References

[BMZ88] M. Bierwisch, W. Motsch, and E. Zimmermann (eds.), Syntax, Semantik und Lexikon: Rudolf Ruzicka zum 65. Geburtstag. Akademie Verlag, Berlin, 1988.

[BoB95] M. Bouneffa and N. Boudjlida, Managing schema changes in object­relationship databases. In [ER'95], 113-122.

[BoC73] R. F. Boyce and D. D. Chamberlin, Using a structured english query language as a data definition facility. Research Report, RJ1318, IBM Res. Lab., San Jose, 1973.

[Boc86] J. B. Bocca, EDUCE: A marriage of convenience: Prolog and a relational DBMS. Proc. 3rd IEEE Symp. on Logic Programming - SLP'86, Salt Lake City, 1986, IEEE-CS, New York, 1986, 36-45.

[BoG84] M. Bouzeghoub and G. Gardarin, The design of an expert system for database design. Proc. 1st Int. Workshop on New Applications of Databases held at the ICOD-2 Meeting (eds. G. Gardarin, E. Gelenbe), Cambridge, Mass., 1983, Academic Press, 1984, 202-223.

[BOH92] A. P. Buchmann, M. T. Ozsu, M. Hornick, D. Georgakopoulos, and F. Manola, A transaction model for active distributed object systems. In: Database transaction models for advanced applications (ed. A. K. Elmagarmid), Morgan Kaufmann, San Mateo, 1992, 123-158.

[Bol79] A. Bolour, The process model of data. UCSF, Lab. of Med. lnf. Sc., TR 38, 1979.

[Boo95] G. Booch, Object-oriented analysis and design with applications. Addison­Wesley, Reading, 1995.

[Bor92] E. Borger, Berechenbarkeit, Komplexitat, Logik. Vieweg, Braunschweig, 1992.

[Bos62] R. Bosak, An Information Algebra. CACM, 5(4), 1962, 190-204. [BOT90] P. Bachmann, W. Oberschelp, B. Thalheim, and G. Vossen, The design

of RAD: Towards an interactive toolbox for database design. RWTH Aachen, Fachgruppe lnformatik, Aachener lnformatik-Berichte, 1990, Nr. 90-28, 1-15.

[Box98] D. Box, Essential COM. Addison-Wesley, Reading, MA, 1998. [BPR88] M. R. Blaha, W. J. Premerlani and J. E. Rumbaugh, Relational database

design using an object-oriented methodology. CACM, 31(4), 1988, 414-427. [BPS96] L. E. Bertossi, J. Pinto, P. Saez, D. Kapur, and M. Subramaniam, Au­

tomating proofs of integrity constraints in situation calculus. Proc. Foundations of Intelligent Systems, 9th International Symposium, ISMIS'1996 (eds. Z. W. Ras, M. Michalewicz), Zakopane, LNCS 1079, Springer, Berlin, 1996, 212-222.

[Bra83] R. Brachman, What IS-A is and isn't: An analysis of taxonomic links in semantic networks. Computer, 16(10), 1983, 30-36.

[Bra87] J. Bradley, Relationship relations and natural quantification in relational databases. Unpublished manuscript, 1987.

[Bre78] J. B. Brenner, A general model for integrity control. ICL Technical Journal, 1, 1978, 71-89.

[BrM86] M. L. Brodie and J. Mylopoulos (eds.), On knowledge base management systems (integrating artificial intelligence and database technologies). Topics in Information Systems, Springer, Berlin, 1986.

[Bro78] M. L. Brodie, Specification and verification of data base semantic integrity. PhD Th., Univ. Toronto, TR CSRG-91, 1978.

[Bro80] M. L. Brodie, Data abstraction, databases, and conceptual modelling: An annotated bibliography. National Bureau of Standards, US Dept. Commerce (Washington, D. C.), Special Publication 500-59, 1980.

[BrS80] M. L. Brodie and J. W. Schmidt, Standardization and the relational ap­proach to data bases: An ANSI task group status report. Proc. 6th Int. Conf. on Very Large Data Bases- VLDB'80, Montreal, 1980, IEEE-CS, 326-328.

References 569

[BRS82] F. Bancilhon, P. Richard, and M. Scholl, On-line processing of compacted relations. Proc. 8th Int. Conf. on Very Large Datebases - VLDB'82, Mexico City, 1982, Morgan Kaufmann, San Mateo, 263-269.

[BrS94] P. Bretherton and P. Singley, Metadata: A user's view. Proc. 7th Int. Work­ing Conf. on Scientific and Statistical Database Management- SSDBM'94 (eds. J. C. French, H. Hinterberger), Charlottesville, Virginia, 1994, IEEE Computer Society Press, 1994, 166-17 4.

[Bru92] T. A. Bruce, Designing quality databases with IDEF1X information mod­els. Dorset House, New York, 1992.

[BrV84] V. Brosda and G. Vossen, Update and retrieval in a relational database through a universal schema interface. Technical Report RWTH Aachen, TR-101, 1984.

[Bry89] F. Bry, Query evaluation in recursive databases: Bottom-up and top-down reconciled. ECRC Report IR-KB-64, ECRC, Miinchen, 1989.

[Bry90] F. Bry, Intensional updates: Abduction via deduction. Proc. 7th Int. Conf. on Logic Programming- ICLP'90 (eds. D. H. D. Warren, P. Szeredi), Jerusalem, 1990, MIT Press, 1990, 561-575.

[BSZ90] R. Budde, K.-H. Sylla, and H. Ziillighoven, Objektorientierter Systement­wurf. DIA Tutorium, Bonn, November 1990.

[BuD93] E. Buchholz and A. Diisterhoft, A natural language interface for database design- issues to be solved. Gl-AK-2.5.2-Workshop, Foundations of Information Systems (ed. B. Thalheim), Graal-Miiritz, 1993, 9-18.

[Bu086] W. Buszkowski and E. Orlowska, On the logic of database dependencies. Bull. Polish Academy of Sciences, 34(5-6), 1986, 345-354.

[BuV92] P. Buitelaar and R. Van De Riet, The use of a lexicon to interpret ER­diagrams: A LIKE project. In [ER'92], 167-177.

[BuV95] J. Burg and R. Van De Riet, COLOR-X event model: Integrated specifi­cation of the dynamics of individual objects. In [ER'95], 146-157.

[Cad76] J.-M. Cadiou, On semantic issues in the relational model of data. Proc. 5th Symp. on Mathematical Foundations of Computer Science- MFCS'76 (ed. A. W. Mazurkiewicz), Gdansk, 1976, LNCS 45, Springer, Berlin, 1976, 23-38.

[CaA84] M.A. Casanova and J. E. Amaral-de-Sa, Mapping uninterpreted schemes into entity-relationship diagrams: Two applications to conceptual schema de­sign. IBM Journal of Research and Development, 28(1), 1984, 82-94.

[CaD94] S. Castano and V. De Antonellis, Standard-driven re-engineering of entity­relationship schemas. In [ER'94], 566-578.

[CaF88] T. Catarci and F. M. Ferrara, OPTIM..ER: An automated tool for sup­porting the logical design within a complete CASE environment. In [ER'88], 369-388.

[CAiSE'92] Proc. 4th Int. CAiSE Conf., CAiSE'92- Advanced Information Systems Engineering (ed. P. Loucopoulos). Manchester, UK, May 12- 15, 1992, LNCS 593, Springer, Berlin, 1992.

[CAiSE'93] Proc. 5th Int. CAiSE Conf., CAiSE'93- Advanced Information Systems Engineering (eds. C. Rolland, F. Bodart, C. Cauvet). Paris, France, June 8-11, 1993, LNCS 685, Springer, Berlin, 1993.

[CAiSE'94] Proc. 6th lnf. CAiSE Conf., CAiSE'94- Advanced Information Systems Engineering (eds. G. Wijers, S. Brinkkemper, A. I. Wasserman). Utrecht, The Netherlands, June 6 - 10, 1994, LNCS 811, Springer, Berlin, 1995.

[CAiSE'95] Proc. 7th Int. CAiSE Conf., CAiSE'95- Advanced Information Systems Engineering (eds. J. livari, K. Lyytinen, M. Rossi). Jyviiskylii, Finland, June 12 - 16, 1995, LNCS 932, Springer, 1995.

570 References

[CAiSE'96] Proc. 8th Int. CAiSE Conf., CAiSE'96- Advanced Informations System Engineering (eds: P. Constantopoulos, J. Mylopoulos, Y. Vassiliou). Heraklion, Greece, May 20 - 24, 1996, LNCS 1080, Springer, Berlin, 1996.

[CAiSE'97) Proc. 9th Int. CAiSE Conf., CAiSE'97- Advanced Information Systems Engineering (eds. A. Olive, J. A. Pastor). Barcelona, Spain, June 16- 20, 1997, LNCS 1250, Springer, Berlin, 1997.

[CAiSE'98) Proc. lOth Int. CAiSE Conf., CAiSE'98 - Advanced Information Sys­tems Engineering (eds. B. Pernici, C. Thanos). Pisa, Italy, June 8 - 12, 1998, LNCS 1413, Springer, Berlin, 1998.

[CaM90] A. F. Cardenas and D. McLeod, Research foundations in object-oriented and semantic database systems. Prentice Hall, Englewood Cliffs, 1990.

[CaN86) J. L. Carswell, Jr. and S. B. Navathe, SA-ER: A methodology that links structured analysis and entity relationship modeling for database design. In [ER'86), 381-397.

[Cas81] M. A. Casanova, The theory of functional and subset dependencies over relational expressions. Dep. de lnf. Rep. 3/81, Pont. Univ. Cat., Rio de Janeiro, 1981.

[CaS90] M. Caruso and E. Sciore, The vision object-oriented database manage­ment system. Proc. Advances in database programming languages, Workshop on Advances in Database Programming Languages - DBPL'87 (eds. F. Ban­cilhon, P. Buneman), Roscoff, France, 1987, ACM Press/Addison-Wesley, New York, 1990, 147-163.

[Cas93] J. M. Castilho, A state-space approach for database redesign. In [ER'93), 520-530.

[Cat83] R. G. G. Cattell, Design and implementation of a relationship-entity-data model. Xerox, Palo Alto, Rep. CSL-83-4, 1983.

[CaT87) N. Cat Ho and B. Thalheim, On semantic and syntactic issues of null values in the relational model of databases. Manuscript, Dresden, 1987.

[Cat91] R. G. G. Cattell, Object data management (object-oriented and extended relational database systems). Addison-Wesley, Reading, MA, 1991.

[CaV83] M. A. Casanova and V. M. P. Vidal, Towards a sound view integration methodology. Proc. 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems- PODS'83, Atlanta, Georgia, 1983, ACM Press, New York, 1983, 36-47.

[Car89] J. Cardiff, The use of integrity constraints to perform query transforma­tions. Technical Report 130, Computer Science Dept., University of Queensland, 1989.

[CCN80] P. P. Chen, I. Chung, and F. Nakamura, Entity-relationship normal forms. Unpublished manuscript, 1980.

[CCP95) F. Casati, S. Ceri, B. Pernici, and G. Pozzi, Conceptual modeling of work flows. In [ER'95), 341-354.

[CCP96) F. Casati, S. Ceri, B. Pernici, and G. Pozzi, Workflow evolution. In [ER'96), 438-455.

[CDJ96] S. Conrad, M. Ding, S. Jannsen, G. Saake, and I. Schmitt, Integrity constraints in federated database design. Technical Report, UNIMD-CS-97-12, Dept. of Computer Science, University Magdeburg, 1996.

[CDS93] S. Castano, V. De Antonellis, and P. San Pietro, Reuse of object-oriented requirement specifications. In [ER'93), 339-351.

[CDV88] M. J. Carey, D. J. DeWitt, and S. Vandenberg, A data model and query language for EXODUS. Proc. 1988 ACM SIGMOD Int. Conf. on Management of Data- SIGMOD'88 (eds. H. Boral, P.-A. Larson), Chicago, Illinois, 1988, ACM Press, SIGMOD Record, 17(3), 1988, 413-423.

References 571

[CDZ92] S. Castano, V. De Antonellis, and B. Zonta, Classifying and reusing con­ceptual schemas. In [ER'92], 121-138.

[CEC85] D. M. Campbell, D. W. Embley, and B. Czejdo, A relationally complete query language for an entity-relationship model. In [ER'85], 90-97.

[Cel95] J. Celko, Joe Celko's SQL for smarties - Advanced SQL programming. Morgan Kaufmann, San Francisco, 1995.

[CeP84] S. Ceri and G. Pelagatti, Distributed databases: Principles and systems. McGraw-Hill, New York, 1984.

[Cer83] S. Ceri (ed.), Methodology and tools for database design. North-Holland, Amsterdam, 1983.

[CER90] B. Czejdo, R. Elmasri, M. Rusinkiewicz, and D. W. Embley, A graphical data manipulation language for an extended entity-relationship model. IEEE Computer, 23(3), 1990, 26-36.

[CeW90] S. Ceri and J. Widom, Deriving production rules for constraint mainte­nance. Proc. 16th Int. Conf. on Very Large Data Bases - VLDB'90 (eds. D. McLeod, R. Sacks-Davis, H.-J. Schek), Brisbane, Queensland, 1990, Morgan Kaufmann, San Francisco, 1990, 566-577.

[CFM81] C. Beeri, R. Fagin, D. Maier, A. 0. Mendelzon, J. D. Ullman, and M. Yannakakis, Properties of acyclic database schemes. Proc. 13th Annual ACM SIGACT Symp. on Theory of Computation - STOC'81, Milwaukee, Wisconsin, 1981, 355-362.

[CFP84] M. A. Casanova, R. Fagin, and C. H. Papadimitriou, Inclusion depen­dencies and their interaction with functional dependencies. JCSS, 28(1), 1984, 29-59.

[CFT91] M. A. Casanova, A. L. Furtado, and L. Tucherman, A software tool for modular database design. ACM TODS, 16(2), 1991, 209-234.

[CGM88] U. S. Chakravarthy, J. Grant, and J. Minker, Foundations of semantic query optimization for deductive databases. In [Min88], 243-273.

[CGS83] M. Colombetti, G. Guida, and M. Somalvico, NLDA: A natural language reasoning system for the analysis of data base requirements. In: Methodology and Tools for Data Base Design (ed. S. Ceri), North-Holland, Amsterdam, 1983, 163-179.

[CGT90] S. Ceri, G. Gottlob, and L. Tanca, Logic programming and databases. Springer, Berlin/New York, 1990.

[ChA80] P. P. Chen and J. Akoka, Optimal design of distributed information sys­tems. IEEE Trans. on Computers, C-20, 12, 1980, 1068-1080.

[ChA89] Chen & Associates, ER-designer reference manual. Baton Rouge, LA, 1986-1989.

[Cha88] A. Chandra, Theory of database queries. Proc. 7th ACM SIGACT­SIGMOD-SIGART Symp. on Principles of Database Systems - PODS'88, Austin, Texas, 1988, ACM Press, New York, 1988, 1-9.

[ChD97] S. Chaudhuri and U. Dayal, Data warehousing and OLAP for decision support. Proc. ACM SIGMOD Int. Conf. on Management of Data, Tucson, Arizona, 1997, SIGMOD Record, 26(2), ACM Press, New York, 1997, 507-508.

[Che76] P. P. Chen, The entity-relationship model: Toward a unified view of data. ACM TODS, 1(1), 1976, 9-36.

[Che83a] P. P. Chen. ER-A historical perspective and future directions. In [ER'83], 71-78.

[Che83b] P. P. Chen, English sentence structure and entity relationship diagrams. Information Science, 29(2), 1983, 127-149.

[Che84a] P. P. Chen, An algebra for a directional binary Entity-Relationship Model. Proc. 1st IEEE Int. Conf. on Data Engineering - ICDE'84, Los An­geles, 1984, IEEE Computer Society Press, 37-40.

572 References

[Che84b] P. P. Chen, Query languages for the entity relationship model. Proc. 1st IEEE CS Int. Conf. on Data Engineering - ICDE'84, Los Angeles, 1984, IEEE Computer Society Press, 41-48.

[Che85] P. P. Chen, Database design based on entity and relationship. In: Principles of Database Design, Volume I: Logical Organizations (ed. S. B. Yao), Prentice Hall, Englewood Cliffs, NJ, 1985, 174-210.

[Che92] P. P. Chen, ER vs. 00. In [ER'92], 1-2. [Che97] P. P. Chen, English, Chinese and ER diagrams. DKE 23, 1, 1997, 5-16. [ChH88] E. P. F. Chan and H. J. Hernandez, Independence reducible database

schemes. Proc. 1988 ACM SIGMOD Int. Conf. on Management of Data- SIG­MOD'88 (eds. H. Boral, P.-A. Larson), Chicago, Illinois, 1988, SIGMOD Record, 17(3), 1988, 163-173.

[Chi69] C. D. Childs, Feasibility of a set theoretic data structure. Proc. 4th World Computer Congress on Information Processing- IFIP'68 (ed. A. J. H. Morrell), Edinburgh, UK, 1968, North-Holland, Amsterdam, 1969, Vol. 1, 420-430.

[ChK73] C. C. Chang and H. J. Keisler, Model theory. North-Holland, Amsterdam, 1973.

[ChK83] D. W. Chilson and M. E. Kudlac, Databases design: A survey of logical and physical design techniques. Proc. 1983 ACM SIGMOD Conf. on the Man­agement of Data- SIGMOD'83, Databases for Business and Office Applications (ed. E. D. Carlson), San Jose, California, ACM Press, New York, 1983, 70-84.

[ChL73] C. L. Chang and R. C. T. Lee, Symbolic logic and mechanical theorem proving. Academic press, New York, 1973.

[ChR90] P. K. Chrysanthis and K. Ramamritham, ACTA: A framework for speci­fying and reasoning about transaction structure and behavior. Proc. 1990 ACM SIGMOD Int. Conf. on Management of Data- SIGMOD'90 (eds. H. Garcia­Molina, H. V. Jagadish), Atlantic City, NJ, 1990, ACM Press, SIGMOD Record, 19(2), 1990, 194-203.

[ChV83] A. K. Chandra and M. Y. Vardi, The implication problem for functional and inclusion dependencies is undecidable. Technical report, Stanford Univer­sity, Dept. of Camp. Sci., 1983.

[CIC88] N. Chandrasekaran, S. S. Iyengar, and P. P. Chen, A denotational seman­tics for the generalized ER model and a simple ER algebra. Int. J. Computer Math., 24, 1988, 99-113.

[Cin86J Cincom: Normal design users guide, No. P 26-9261-03, 1986. [CJA89] C. R. Carlson, W. Ji, and A. K. Arora, The nested entity-relationship

model. In [ER'89J, 43-57. [Cla96] W. ClauB, Using structural recursion as query mechanism for data models

with references. In [ER'96], 134-145. [Cle85] E. K. Clemons, Data models and the ANSI/SPARC architecture. In: Princi­

ples of database design, Volume I: Logical organizations (ed. S. B. Yao), Prentice Hall, Englewood Cliffs, 1985, 66-114.

[CLM81] A. K. Chandra, H. R. Lewis, and J. A. Makowsky, Embedded implica­tional dependencies and their inference problem. Proc. 13th Annual ACM Symp. on Theory of Computing - STOC'81, Milwaukee, Wisconsin, 1981, 342-354.

[CLS92] H.-M. C. Garcia, 0. Liu, and O.L.R. Sheng, An entity-relationship-based methodology for distributed database design: An integrated approach towards combined logical and distribution designs. In [ER'92], 178-193.

[CLT97] W. ClauB, J. Lewerenz, and B. Thalheim, Dynamic dialog management. Proc. Workshop Behavioral Modeling and Design Transformations (ed. S. W. Liddle), (track of ER'97), Los Angeles, 1997, http:/ /osm7.cs.byu.edu/ER97 /workshop4/clt.html.

References 573

[ClT98] W. Claufi and B. Thalheim, Abstraction layered structure-process code­sign. Proc. Management of Data, 8th Int. Conf. on Management of Data -COMAD'97 (ed. D. Janaki Ram), Chennai (Madras), India, 1997, Narosa Pub­lishing House, New Delhi, 1998, 223-237.

[CMD83] J. V. Carlis, S. T. March, and G. W. Dickson, Physical database design: A DSS approach. Information and Management, 6(4), 1983, 211-224.

[CoA96] I. Comyn-Wattiau and J. Akoka, Reverse engineering of relational database physical schema. In [ER'96], 372-391.

[Cod70] E. F. Codd, A relational model for large shared data banks. CACM, 13(6), 1970, 197-204.

[Cod71] E. F. Codd, Further normalization of the database model, In: Courant Inst. Comp. Sci. Symp. 6, Data Base Systems, Prentice Hall, Englewood Cliffs, NJ, 1971, 33-64.

[Cod72] E. F. Codd, Relational completeness of data base sublanguages. In: Data base systems (ed. R. Rustin), Prentice Hall, Englewood Cliffs, NJ, 1972, 65-98.

[Cod79] E. F. Codd, Extending the relational database model to capture more meaning. ACM TODS, 4(4), 1979, 397-434.

[Cod81] E. F. Codd, Data models in database management. Proc. Workshop on Data Abstraction, Databases and Conceptual Modelling, SIGPLAN Notices, 16(1), 1981, 112-114.

[Cod82] E. F. Codd, Relational databases: A practical foundation for productivity. CACM, 25(2), 1982, 109-117.

[Cod86] E. F. Codd, Missing information (applicable and inapplicable) in relational databases. SIGMOD Record, 15(4), 1986, 53-78.

[Cod91] E. F. Codd, The relational model for database management (version 2). Addison-Wesley, Reacting, MA, 1991.

[CoG93] P. Corrigan and M. Gurry, ORACLE performance tuning. O'Reilly & Associates, Sebastopol, 1993.

[CoK83] S. S. Cosmodakis and P. C. Kanellakis, Functional and inclusion depen­dencies - A graph theoretic approach. Technical Report CS-83-21, Brown Uni­versity, Dept. of Computer Science, 1983.

[Con86] B. Convent, Unsolvable problems related to the view integration approach. In [ICDT'86], 141-156.

[CoP84] S. S. Cosmadakis and C. H. Papadimitriou, Updates of relational views. JACM, 31(4), 1984, 742-760.

[COS97] D. Costal, A. Olive, and M.-R. Sancho, Temporal features of class popu­lations and attributes in conceptual models. In [ER'97], 57-70.

[Cra67] A. Craig, Modus ponens and derivation from Horn formulas. Zeitschrift fiir Mathematische Logik und Grundlagen der Mathematik, 13, 1967, 33-54.

[CST98] S. Conrad, I. Schmitt, and C. Tiirker, Considering integrity constraints during federated database design. Proc. Advances in Databases, 16th British National Conf. on Databases- BNCOD-16 (eds. S.M. Embury, N. J. Fiddian, W. A. Gray, A. C. Jones), Cardiff, Wales, 1998, LNCS 1405, Springer, Berlin, 1998, 119-133.

[CTW99] P. P. Chen, B. Thalheim, and L. Y. Wong, Future directions of conceptual modeling. In: Conceptual Modeling: Current Issues and Future Directions ( eds. P. P. Chen, J. Akoka, H. Kangassalo, B. Thalheim), Selected papers from the workshop on conceptual modeling, Los Angeles, 1997, LNCS 1565, Springer, Berlin, 1999, 287-301.

[Cul85] Cullinet, IDMS/R automatic system facility. Users guide. Revison 0.0, Re­lease 10.0. 1985.

574 References

(Cyr95] H. Cyriaks, Analyse der Semantik der Determinantien und ihre Nutzung fiir ein natiirlichsprachiges Interface im Datenbankentwurfssystem RADD. Diplomarbeit, Universitiit Rostock, Fachbereich lnformatik, 1995.

(Cze90] B. Czejdo, Using an ER query and update interface for rapid prototyping of hypertext systems. Proc. 23rd Annual Hawaii Int. Conf. on System Sciences (vol. 2), IEEE Computer Society Press, New York, 1990, 227-236.

(Cze81] G. Czedli, On dependencies in the relational model of data. ElK 17(2/3), 1981, 103-112.

(DaL91] M. Dahr and K. Lautenbach, Towards a formal theory of datalog nets. Computer Science Report 20/91, University Koblenz-Landau, 1991.

(DaM92] E. Dahlhaus and J. A. Makowsky, Query languages for hierarchic databases. Information and Computation, 101(1), 1992, 1-32.

(DaP88] K. S. Dawson and L. M. P. Parker, From entity-relationship diagrams to fourth normal form: A pictorial aid to analysis. The Computer Journal, 31(3), 1988, 258-268.

(Das92] S. K. Das, Deductive databases and logic programming. Addison-Wesley, Wokingham, England, 1992.

(Dat86] C. J. Date, An introduction to database systems. Addison-Wesley, Read­ing, Mass., 1986.

(DBP82] P. De Bra and J. Paredaens, Horizontal decompositions for handling ex­ceptions to functional dependencies. Report 82-20, University of Antwerp, Dept. of Mathematics, 1982.

(DeC73] C. Delobel and R. G. Casey, Decomposition of a database and the theory of boolean switching functions. IBM Journal Research and Development, 17(5), 1973, 374-386.

(Dec87a] H. Decker, Integrity enforcement on deductive databases. Proc. Expert Database Systems (ed. L. Kerschberg), 1st Int. Conf. on Expert Database Sys­tems, Charleston, South Carolina, 1986, Benjamin/Cummings, Redwood City, 1987, 381-395.

(Dec87b] R. Dechter, Decomposing an n-ary relation into a tree of binary relations. Proc. 1987 ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems- PODS'87, San Diego, California, 1987, ACM Press, New York, 1987, 185-189.

(DeG83] J. Demetrovics and G. Gyepesi, A note on minimal matrix representation of closure operations. Combinatorica, 3(2), 1983, 177-179.

(DeK83] J. Demetrovics and G. 0. H. Katona, Combinatorial problems of database models. Colloquia Mathematica Societatis Janos Bolyai 42, Algebra, Combina­torics and Logic in Computer Science, Gyor (Hungary), 1983, 331-352.

(Del73] C. Delobel, Contributions theoriques a la conception d'un systeme d'information. These d'Etat, Universite de Grenoble, 1973.

(Del78] C. Delobel, Normalization and hierarchical dependencies in the relational data model. ACM TODS, 3(3), 1978, 201-222.

[Del80] C. Delobel, An overview of the relational data theory. Proc. 8th Int. Fed­eration for Information Processing World Computer Congress- IFIP'80 (ed. S. H. Lavington), Tokyo and Melbourne, 1980, North-Holland, 1980, 413-426.

[Dem78] J. Demetrovics, On the number of candidate keys. IPL, 7(6), 1978, 266-269.

(Dem79] J. Demetrovics, On the equivalence of candidate keys with Sperner sets. Acta Cybernetica, 4(3), 1979, 247-252.

(Dem80a] J. Demetrovics, Candidate keys and antichains. SIAM J. on Algebraic and Discrete Methods, 1, 1980, 92.

[Dem80b] J. Demetrovics, Relacios adatmodell logikai es structuralis vizsgalata. Tanulmanyok, 114, 1980, 1-94.

References 575

[DeT88a] J. Demetrovics and V. D. Thi, Some results on functional dependencies. Acta Cybemetica, 8{3), 1988, 273-278.

[DeT88b] J. Demetrovics and V. D. Thi, Relations and minimal keys. Acta Cyber­netica, 8{3), 1988, 279-285.

[Deu91] 0. Deux, The 02 system. CACM, 34{10), 1991, 34-48. [DFK85] J. Demetrovics, Z. Fiiredi, and G. 0. H. Katona, Minimum matrix repre­

sentations of closure operations. Discrete Applied Mathematics, 11, 1985, 115-128.

[DFP97] R. De Nicola, G. L. Ferrari, and R. Pugliese, KLAIM: a kemellanguage for agents interaction and mobility. Report, Dipartimento di Sistemi e Informatica, Universita di Firenze, Florence, 1997.

[DGS93] C. De Castro, F. Grandi, and M. R. Scalas, Semantic interoperability of multitemporal relational databases. In [ER'93], 463-474.

[DGS94] G. Dinkhoff, V. Gruhn, A. Saalmann, and M. Zielonka, Business process modeling in the workflow management environment LEU. In [ER'94], 46-63.

[DiC95] Z. Diskin and B. Cadish, Variable sets and functions framework for con­ceptual modeling: Integrating ER and 00 via sketches with dynamic markers. In [ER'95], 226-237.

[Dij93] J. Dijkstra, On complex objects and versioning in complex environments. In [ER'93], 13-23.

[DiL89] G. Di Battista and M. Lenzerini, A deductive method for entity­relationship modeling. Proc. 15th Int. Conf. on Very Large Databases -VLDB'89 (eds. P. M. G. Apers, G. Wiederhold), Amsterdam, 1989, Morgan Kaufmann, Los Altos, California, 1989, 13-21.

[DiM89] J. Diederich and J. Milton, Objects, messages, and rules in database de­sign. In: Object-oriented concepts, databases and applications (eds. W. Kim, F. H. Lochovsky), ACM Press and Addison-Wesley, 1989, 177-197.

[Dip69] R. Di Paola, The recursive unsolvability of the decision problem for the class of definite formulas. JACM, 16{2), 1969, 324-327.

[DKM95] J. Demetrovics, G. 0. H. Katona, D. Miklos, 0. Seleznjev, and B. Thal­heim, The average length of keys and functional dependencies in (random) databases. In [ICDT'95], 266-279.

[DKM98a] J. Demetrovics, G. 0. H. Katona, D. Miklos, 0. Seleznjev, and B. Thal­heim, The average complexity of keys in (random) databases. TCS, 190, 1998, 151-166.

[DKM98b] J. Demetrovics, G. 0. H. Katona, D. Miklos, 0. Seleznjev, and B. Thal­heim, Functional dependencies in random databases. Joumal Studia Scientar­ium Matematicarum Hungarica, special issue in memoriam to A. Renyi, 34, 1998, 127-140.

[DKT88] G. Di Battista, H. Kangassalo, and R. Tamassia, Definition libraries for conceptual modelling. In [ER'88], 251-267.

[DLM89] J. Demetrovics, L. 0. Libkin, and I. B. Muchnik, Functional dependencies and the semilattice of closed classes. In [MFDBS'89], 136-147.

[DMR97] L. M. L. Delcambre, D. Maier, R. Reddy, and L. Anderson, Structured maps: Modeling explicit semantics over a universe of information. Int. Joumal of Digital Libraries, 1(1), 1997, 20-35.

[DNF79] C. S. DosSantos, E. J. Neuhold, and A. L. Furtado, A data type approach to the entity-relationship model. In [ER'79], 103-120.

[DoC83] A. Dogac and P. P. Chen, The entity-relationship model in the ANSI/ Spare framework. In [ER'83], 357-374.

[Dol99] T. Dolezal, Cardinality constraints for n-ary relationship types. Proc. of short papers- ADBIS'99 (eds. J. Eder, T. Weltzer), published by the University of Maribor, 1999, 156-162.

576 References

[DrG79] B. Dreben and W. B. Goldfarb, The decision problem- solvable classes of quantificational formulas. Addison-Wesley, New York, 1979.

[DTM95] 0. De Troyer and R. Meers man, A logic framework for a semantics of object oriented data modeling. In [ER'95], 238-249.

[DTr89] 0. De Troyer, RIDL •, A tool for the computer-assisted engineering of large databases in the presence of integrity constraints. Proc. 1989 ACM SIGMOD Int. Conf. on Management of Data (eds. J. Clifford, B. G. Lindsay, D. Maier), Portland, Oregon, 1989, ACM Press, SIGMOD Record, 18(2), 1989, 418-429.

[DuA83] S. R. Dumpala and S. K. Arora, Schema translation using the entity­relationship approach. In [ER'83], 337-356.

[Due97] A. Diisterhoft, On natural language interaction in database design. PhD Thesis, BTU Cottbus, infix-Verlag, St. Augustin, DISBIS 36, 1997 (In German).

[DuM90] S. Dulli and V. Milanese, A database design for graphical models. SIG­PLAN Notices, 25(12), 1990, 30-36.

[Dun89] E. B. Duncan, Structural knowledge bases for designers of learning mate­rials. Hypermedia, 1(1), 1989, 22-30.

[Dup94] Y. Dupont, Resolving fragmentation conflicts in schema integration. In [ER'94], 513-532.

[Dyb84] P. Dybjer, Some results on the deductive structure of join dependencies. TCS, 33, 1984, 95-105.

[ECS98] H.-D. Ehrich, C. Caleiro, A. Sernadas, and G. Denker, Logics for specifying concurrent information systems. Proc. Workshop on Logics and Databases ( eds. J. Chomicki, G. Saake), Kluwer, Boston, 1998, 167-198.

[EGN94] J. Eder, H. Groiss, and H. Nekvasil, A workflow system based on active databases. Proc. CON'94 (eds. G. Chroust, A. Benczur), Workflow Manage­ment: Challenges, Paradigms and Products, Oldenbourg, Wien, 1994, 249-265.

[Ehr82] H.-D. Ehrich, On the theory of specification, implementation, and param­eterization of abstract data types. JACM, 29(1), 1982, 206-227.

[EhS91] H.-D. Ehrich and A. Sernadas, Fundamentals object concepts and con­structions. In: Information Systems - Correctness and Reusability ( eds. G. Saake, A. Sernadas), Technical Report 91-03, Technische Universitiit Braun­schweig, 1991, 1-24.

[Eic84] C. F. Eick, From natural language requirements to good data base defini­tions - A data base design methodology. Proc. 1st Int. Conf. on Data Engineer­ing - ICDE'84, Los Angeles, California, 1984, IEEE Computer Society Press, 1984, 324-331.

[EiG95] T. Eiter and G. Gottlob, The complexity of logic-based abduction. JACM 42 ,1, 1995, 3-42.

[EiL85] C. F. Eick and P. C. Lockemann, Acquisition of terminological knowledge using database design techniques. Proc. 1985 ACM SIGMOD Int. Conf. on Man­agement of Data (ed. S. B. Navathe), Austin, Texas, 1985, SIGMOD Record, 14( 4), 84-94.

[EkJ96] L. Ekenberg and P. Johannessen, A formal basis for dynamic schema in­tegration. In [ER'96], 211-226.

[ELG84] H.-D. Ehrich, U. W. Lipeck, and M. Gogolla, Specification, semantics, and enforcement of dynamic database constraints. Proc. lOth Int. Conf. on Very Large Databases - VLDB'84 (eds. U. Dayal, G. Schlageter, L. H. Seng), Singapore, 1984, Morgan Kaufmann, San Mateo, 1984, 301-308.

[Elm92) A. K. Elmagarmid ( ed. ), Database transaction models for advanced appli­cations. Morgan Kaufmann, San Mateo, 1992.

[ELN86) R. Elmasri, J. A. Larson, and S. B. Navathe, Schema integration algo­rithms for federated databases and logical database design. Technical Report, TR CSC-8, Honeywell Corporate Systems Dev. Division, 8212, 1986.

References 577

[ElN89] R. Elmasri and S. B. Navathe, Fundamentals of database systems. Ben­jamin/Cummings, Redwood City, 1989.

[Emb98] D. W. Embley, Object database development: Concepts and principles. Addison-Wesley, Reading, Mass., 1998.

[ER'79] Proc. 1st Int. ER Conf., ER'79: Entity-Relationship Approach to Systems Analysis and Design (ed. P. P. Chen). Los Angeles, USA, 1979, North-Holland, Amsterdam, 1980.

[ER'81] Proc. 2nd Int. ER Conf., ER'81 (ed. P. P. Chen). North-Holland, Amster­dam, 1983.

[ER'83] Proc. 3rd Int. ER Conf., ER'83 (eds. C. G. Davis, S. Jajodia, P. A.-B. Ng, R. T. Yeh). Anaheim, USA, 1983, North-Holland, Amsterdam, 1983.

[ER'85] Proc. 4th Int. ER Conf., ER'85: Entity-Relationship Approach - The Use of ER Concept in Knowledge Representation (ed. P. P. Chen). Chicago, USA, Oct. 29 - 30, 1985, IEEE-CS and North-Holland, Amsterdam, 1985.

[ER'86] Proc. 5th Int. ER Conf., ER'86: Entity-Relationship Approach- Ten Years of Experience in Information Modeling (ed. S. Spaccapietra). Dijon, France, Nov. 17- 19, 1986, North-Holland, Amsterdam, 1987.

[ER'87] Proc. 6th Int. ER Conf., ER'87: Entity-Relationship Approach (ed. S. T. March). New York, USA, Nov. 9- 11, 1987, North-Holland, Amsterdam, 1988.

[ER'88] Proc. 7th Int. ER Conf., ER'88: Entity-Relationship Approach: A Bridge to the User (ed. C. Batini). Rome, Italy, Nov. 16 - 18, 1988, North-Holland, Amsterdam, 1989.

[ER'89] Proc. 8th Int. ER Conf., ER'89: Entity-Relationship Approach to Database Design and Querying (ed. F. H. Lochovsky). Toronto, Canada, Oct. 18- 20, 1989, North-Holland, Amsterdam, 1990.

[ER'90] Proc. 9th Int. ER Conf., ER'90 (ed. H. Kangassalo). Lausanne, Switzer­land, 1990, ER Institute, Pittsburgh, Participants Proc., 1990.

[ER'91] Proc. lOth Int. ER Conf., ER'91 (ed. T. J. Teorey). San Mateo, USA, 1991, ER Institute, Pittsburgh, Participants Proc., 1991.

[ER'92] Proc. 11th Int. ER Conf., Entity-Relationship Approach- ER'92 (eds. G. Pemul, AM. Tjoa). Karlsruhe, Germany, Oct. 7- 9, 1992, LNCS 645, Springer, Berlin, 1992.

[ER'93] Proc. 12th Int. ER Conf., Entity-Relationship Approach- ER'93 (eds. R. Elmasri, V. Kouramajian, B. Thalheim). Arlington, USA, Dec. 15- 17, 1993, LNCS 823, Springer, Berlin, 1994.

[ER'94] Proc. 13th Int. ER Conf., Entity-Relationship Approach- ER'94, Business Modeling andRe-Engineering (ed. P. Loucopoulos). Manchester, U.K., Dec. 13 - 16, 1994, LNCS 881, Springer, Berlin, 1994.

[ER'95] Proc. 14th Int. ER Conf., OO-ER'95: Object-Oriented and Entity­Relationship Modeling (ed. M. P. Papazoglou). Gold Coast, Australia, Dec. 12 - 15, 1995, LNCS 1021, Springer, Berlin, 1995.

[ER'96] Proc. 15th Int. ER Conf., Conceptual Modeling- ER'96 (ed. B. Thalheim). Cottbus, Germany, Oct. 7- 10, 1996, LNCS 1157, Springer, Berlin, 1996.

[ER'97] Proc. 16th Int. ER Conf., Conceptual Modeling- ER'97 (eds. D. W. Emb­ley, R. C. Goldstein). Los Angeles, USA, Nov. 3- 5, 1997, LNCS 1331, Springer, Berlin, 1997.

[ER'98] Proc. 17th Int. ER Conf., Conceptual Modeling- ER'98 (eds. T. W. Ling, S. Ram, M.-L. Lee). Singapore, Nov. 16- 19, 1998, LNCS 1507, Springer, Berlin, 1998.

[ER'99] Proc. 18th ER Conf., Conceptual Modeling - ER'99 (eds. J. Akoka, M. Bouzeghoub, I. Comyn-Wattiau, E. Metais). Paris, France, Nov. 15-18, 1999, LNCS 1728, Berlin, 1999.

578 References

[EWD96] J. Ebert, A. Winter, P. Dahm, A. Franzke, and R. Siittenbach, Graph based modeling and implementation with EER/GRAL. In [ER'96], 163-178.

[EWH85] R. Elmasri, J. Weeldreyer, and A. Hevner, The category concept: An extension to the entity-relationship model. DKE, 1(1), 1985, 75-116.

[EWK93] R. Elmasri, G. T. J. Wuu, and V. Kouramajian, A temporal model and query language for EER databases. In: Temporal Databases - Theory, design, and implementation (eds. A. U. Tansel, J. Clifford, S. K. Gadia, S. Jajodia, A. Segev), Chapter 9, Benjamin/Cummings, Redwood City, 1993, 212-229.

[FaF75] R. Fadous and J. Forsythe, Finding candidate keys for relational databases. Proc. 1975 ACM SIGMOD Int. Conf. on Management of Data - SIGMOD'75 (ed. W. F. King), San Jose, California, ACM Press, New York, 1975, 203-210.

[Fag77a] R. Fagin, Multivalued dependencies and a new normal form for relational databases. ACM TODS, 2(3), 1977, 262-278.

[Fag77b] R. Fagin, The decomposition versus synthetic approach to relational database design. Proc. 3rd Int. Conf. an Very Large Data Bases - VLDB'77, Tokyo, IEEE-CS and ACM SIGMOD Record, 9(4), 1977, 441-446.

[Fag80] R. Fagin, Horn clauses and database dependencies. Proc. 12th Ann. Symp. on the Theory of Computing - STOC'80, Los Angeles, California, 1980, 123-134.

[Fag81] R. Fagin, A normal form for relational data bases that is based on domains and keys. ACM TODS, 6(3), 1981, 387-415.

[Fag82a] R. Fagin, Armstrong databases, IBM Res. Lab., Res. Report RJ 3440(40926), 4/5/82, San Jose, 1982.

[Fag82b] R. Fagin, Horn clauses and database dependencies. JACM, 29(4), 1982, 952-985.

[Fag83] R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes. IBM Res. Lab., Res. Report RJ 3330 (39949), 11/25/81, San Jose, 1983.

[FaT92] A. Z. I. Fahmi and B. Thalheim, Data Base Design using the higher order­entity relationship model. Journal Kuwait University, Fac. of Sciences, 2, 1992, 28-48.

[FaV94] C. Fahrner and G. Vossen, A survey of database design transformation based on the entity-relationship model. University of Miinster, Computer Sci­ence Dept., Report in the RAD Project, 1994.

[FaV96] C. Fahrner and G. Vossen, A modular approach to relational reverse en­gineering. University of Miinster, Computer Science Dept., Technical Report 22/96-1, 1996.

[FBC87] D. H. Fishman, D. Beech, H. P. Cate, E. C. Chow, T. Connors, J. W. Davis, N. Derrett, C. G. Hoch, W. Kent, P. Lyngbaek, B. Mahbod, M.-A. Neimat, T. A. Ryan, and M.-C. Shan, IRIS: An object-oriented database man­agement system. ACM TOIS, 5(1), 1987, 48-69.

[FBK82] M. Friedell, J. Barnett, and D. Kramlich, Context-sensitive, graphic pre­sentation of information. Computer Graphics, 16(3), 1982, 181-188.

[Feh96] F. Fehler, Planning and development of online-systems for enterprise-wide information exchange. PhD Thesis, BTU Cottbus, 1996 (In German).

[FeR69] J. A. Feldman and P. D. Rovner, An ALGOL based associative language. CACM, 12, 1969, 439-449.

[Fer84] M. C. Fernandez, Determining the normalization level of a relation on the basis of Armstrong's axioms. Computers and Artificial Intelligence, 3, 1984, 495-504.

[Fer91] S. Ferg, Cardinality concepts in entity-relationship modeling. In [ER'96], 1-30.

[Fid87] R. Fidel, Database design for information retrieval: A conceptual approach. John Wiley & Sons, New York, 1987.

References 579

[Fin89] D. Finkelstein, An introduction to information engineering. Addison­Wesley, Sydney, 1989.

[FiV84] P. C. Fischer and D. Van Gucht, Weak multivalued dependencies. Proc. 3rd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems- PODS'84, Waterloo, Ontario, 1984, ACM Press, New York, 1984, 266-274.

[Fla81] M. Flavin, Fundamental concepts of information modeling. Yourdon Press, New York, 1981.

[FlH89] C. C. Fleming and B. von Halle, Handbook of relational database design. Addison-Wesley, Reading, MA, 1989.

[FLN88] P. Fankhauser, W. Litwin, E. J. Neuhold, and M. Schrefl, Global view def­inition and multidatabase languages - two approaches to database integration. Proc. Research into networks and distributed applications: European Telein­formatics Conf. - EUTEC0'88 (ed. R. Speth), Vienna, 1988, North-Holland, Amsterdam, 1988, 1069-1082.

[Flo86] C. Floyd, A comparative evaluation of system development methods. Proc. IFIP WG 8.1 Working Conf. on Comparative Review of Information Systems Design Methodologies: Improving the Practice, Information Systems Design Methodologies-Improving the Practice (eds. T. W. Olle, H. G. Sol, A. A. Verrijn­Stuart), Noordwijkerhout, The Netherlands, 1986, North-Holland, Amsterdam, 1986, 19-54.

[FMU83] R. Fagin, D. Maier, J.D. Ullman, and M. Yannakakis, Tools for template dependencies. SIAM J. Comput., 12(1), 1983, 30-59.

[FMV91] A. Formica, M. Missikoff, and S. Vazzana, An object-oriented data model for artificial intelligence applications. Proc. 1st Int. East/West Data Base Work­shop EWDW'90, Next Generation Information System Technology (eds. J. W. Schmidt, A. A. Stognij), Kiev, 1990, LNCS 504, Springer, Berlin, 1991, 26-41.

[FoH93] J. Fang and M. Ho, Knowledge-based approach for abstracting hierarchical and network schema semantics. In [ER'93], 508-519.

[FPR85] B. Flores, C. Proix, and C. Rolland, An intelligent tool for information design. Proc. 4th Scandinavian Research Seminar of Information Modeling and Data Base Management, Ellivuori, Finnland, 1985.

[FPT93] P. Fraternali, S. Paraboschi, and L. Tanca, Automatic rule generation for constraint enforcement in active databases. Proc. 4th Int. Workshop on Foun­dations of Models and Languages for Data and Objects - Modelling Database Dynamics- FoMLaD0'92 (eds. U. W. Lipeck, B. Thalheim), Volkse, Germany, 1992, Workshops in Computing, Springer, London, 1993, 153-173.

[FrE96] G. Frank and J. Eder, A meta-model for dynamic models. Technical Draft, University Klagenfurt, Computer Science Dept., 1996.

[FrL98] A. A. Freitas and S. H. Lavington, Mining very large databases with parallel processing. Kluwer, Boston, 1998.

[Fro86a] R. A. Frost, Formalising the notion of semantic integrity in database and knowledge base systems work. Proc. 5th British Nat. Conf. on Databases -BNCOD'86 (ed. E. A. Oxborrow), University of Kent at Canterbury, 1986, Cambridge University Press, 1986, 105-127.

[Fro86b] R. A. Frost, Introduction to knowledge base systems. MacMillan, New York, 1986. ·

[FrP94] C. Francalanci and B. Pernici, Abstraction levels for entity-relationship schemas. In [ER'94], 456-473.

[FrP98] P. Fraternali and P. Paolini, A conceptual model and a tool environment for developing more scalable, dynamic, and customizable web applications. Proc. Advances in Database Technology - EDBT'98, 6th Int. Conf. on Extending Database Technology (eds. H.-J. Schek, F. Saltor, I. Ramos, G. Alonso), Valen­cia, 1998, LNCS 1377, Springer, Berlin, 1998, 422-435.

580 References

[FSS92] L. Fegaras, T. Sheard, and D. W. Stemple, Uniform traversal combinators: Definition, use and properties. Proc. Automated Deduction - CADE'92, 11th Int. Conf. on Automated Deduction (ed. D. Kapur), Saratoga Springs, New York, 1992, LNCS 607, Springer, Berlin, 1992, 148-162.

[FST85] P. C. Fischer, L. V. Saxton, S. J. Thomas, and D. Van Gucht, Interactions between dependencies and nested relational structures. JCSS, 31, 1985, 343-354.

[FST98] T. Feyer, K.-D. Schewe, and B. Thalheim, Conceptual Design and Devel­opment of Information Services. In [ER'98], 7-20.

[FuL95] C. Fung and Q. Li, Versatile querying facilities for a dynamic object clus­tering model. In [ER'95], 77-88.

[FuN86] A. L. Furtado and E. J. Neuhold, Formal techniques for database design, Springer, Berlin, 1986.

[FUV83] R. Fagin, J.D. Ullman, and M. Y. Vardi, On the semantics of updates in databases. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems - PODS'83, Atlanta, Georgia, ACM Press, New York, 1983, 352-365.

[GaJ79] M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness. Freeman, 1979.

[GaM78] H. Gallaire and J. Minker (eds.), Logic and databases. Plenum Press, New York, 1978.

[GaM89] G. Gazdar and C. Mellish, Natural language processing in PROLOG: an introduction to computational linguistics. Addison-Wesley, Wokingham, Eng­land, 1989.

[GaR92] M. Gandhi and E. L. Robertson, A specification-based data model. In [ER'92], 194-209.

[GaS92] H.-M. C. Garcia and 0. L. R. Sheng, An entity-relationship-based method­ology for distributed database design: An integrated approach towards com­bined logical and distribution designs. In [ER'92], 178-193.

[Ga Y88] S. K. Gadia and C.-S. Yeung, A generalized model for a relational tem­poral database. Proc. 1988 ACM SIGMOD Int. Conf. on Management of Data - SIGMOD'88 (eds. H. Boral, P.-A. Larson), Chicago, Illinois, 1988, SIGMOD Record, 17(3), 1988, 251-259.

[GeL95] M. Gertz and U. W. Lipeck, "Temporal" integrity constraints in temporal databases. Proc. Recent Advances in Temporal Databases ( eds. J. Clifford, A. Tuzhilin), Workshops in Computing, Springer, London, 1995, 77-92.

[GeM95] J. R. Getta and L.A. Maciaszek, Management of inconsistent information in federated systems. In [ER'95], 412-423.

[GeN88] M. R. Genesereth and N. J. Nilsson, Logical foundations of artificial in­telligence. Morgan Kaufmann, Los Altos, 1988.

[Ger75] R. Gerritsen, A preliminary system for the design of DBTG data structures. CACM, 18, 1975, 25-30.

[GeR81] J.R. Getta and S. Romanski, Group dependencies in relational data bases. Arch. Automat. Telemech., 26(3), 1981, 365-372.

[Ger92] M. Gertz, Deriving integrity constraints maintaining triggers from transi­tion graphs. Proc. Kurzfassungen des 4. GI-Workshops Grundlagen von Daten­banken (eds. U. W. Lipeck, R. Manthey), Barsinghausen, 1992, Technical Re­port ECRC-92-13, ECRC, Miinchen, 1992, 40-44.

[Get93] J. R. Getta, Translation of extended entity-relationship database model into object-oriented database model. Proc. IFIP WG 2.6 Database Seman­tics Conf. on Interoperable Database Systems - DS-5 (eds. D. K. Hsiao, E. J. Neuhold, R. Sacks-Davis), Lome, Victoria, Australia, 1992, North-Holland, Amsterdam, 1993, IFIP Transactions A-25, 87-100.

[GiH86] S. Ginsburg and R. Hull, Sort sets in the relational model. JACM, 33(3), 1986, 465-488.

References 581

[Gil87] P. C. Gilmore, Concepts methods for database design. Technical Report TR-87-31, Dept. of Computer Science, University of British Columbia, 1987.

[Gil90] M. L. Gillenson, Database step-by-step (2nd ed.), John Wiley & Sons, New York, 1990.

[Gin88] M. Ginsberg, Non-monotonic reasoning. Morgan Kaufmann, Los Altos, 1988.

[Gir92] R. Girardi, Application engineering: Putting reuse to work. In: Object Frameworks (ed. D. Tsichritzis), Universite de Geneve, 1992, 137-149.

[GiS85) S. Ginsburg and E. H. Spanier, On completing tables to satisfy functional dependencies. TCS, 39(2-3), 1985, 309-317.

[GiZ82) S. Ginsburg and S. M. Zaiddan, Properties of functional dependency fam­ilies. JACM, 29(3), 1982, 678-698.

[GKP85) G. Gazdar, E. Klein, G. Pullum, and I. Sag, Generalized phrase structure grammar. Harvard University Press, Cambridge, Mass., 1985.

[GKS91] G. Gottlob, G. Kappel, and M. Schrefl, Semantics of object-oriented data models - The evolving algebra approach. Proc. Next Generation Information System Technology, 1st Int. East/West Data Base Workshop - EWDW'90 ( eds. J. W. Schmidt, A. A. Stognij), Kiev, 1990, LNCS 504, Springer, Berlin, 1991, 144-160.

[GLL93) J. Grant, T. W. Ling, and M.-L. Lee, ERL: Logic for entity-relationship databases. JIIS, 2, 1993, 115-147.

[GMN81) H. Gallaire, J. Minker, and J.-M. Nicolas (eds.), Advances in database theory, Vol. I. Plenum-Press, New York, 1981.

[GMN83) H. Gallaire, J. Minker, and J.-M. Nicolas (eds.), Advances in database theory, Vol. II. Plenum-Press, New York, 1983.

[GMN84) H. Gallaire, J. Minker, and J.-M. Nicolas, Logic and databases: A deduc­tive approach. ACM Computing Surveys, 16, 1984, 153-185.

[GMV86) M. H. Graham, A. 0. Mendelzon, and M. Y. Vardi, Notions of depen­dency satisfaction. JACM, 33(1), 1986, 105-129.

[GMW91] M. Gogolla, B. Meyer, and G. D. Westerman, Drafting extended entity­relationship schemas with QUEER. In [ER'91), 561-586.

[Gog94) M. Gogolla, An extended entity-relationship model - fundamentals and pragmatics. LNCS 767, Springer, Berlin, 1994.

[Gog95] M. Gogolla, A declarative query approach to object identification. In [ER'95), 65-76.

[GoH88] M. Gogolla and U. Hohenstein, Towards a semantic view of an extended entity-relationship model. Technical Report 88 - 02, TU Braunschweig, 1988.

[GoH91] M. Gogolla and U. Hohenstein, Towards a semantic view of an extended entity-relationship model. ACM TODS, 16(3), 1991, 369-416.

[Gol81] B. S. Goldstein, Formal properties of constraints on null values in relational databases. Technical Report 80-013 SUNY at Stony Brook, Dept. of Computer Science, 1981.

[Gol89] D. E. Goldberg, Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, Mass., 1989.

[GoL92] C. H. Gob and T. W. Ling, Extending entity relationship formalism for conceptual data modeling to capture more semantics. Proc. Information and Knowledge Management, 1st Int. Conf. on Information and Knowledge Man­agement- CIKM'92 (ed. Y. Yesha), Baltimore, MD, 1992, 629-636.

[GoM94] R. Godin and R. Missaoui, An incremental concept formation approach for learning from databases. TCS, 133(2), 1994, 387-419.

[Goo92] G. Goos, Object-oriented software engineering. Lecture manuscript, Ro­stock, 1992.

582 References

[GoS91] R. C. Goldstein and V. C. Storey, Commonsense reasoning in database design. In [ER'91], 77-92.

[GoT84] N. Goodman andY. G. Tay, A characterization of multivalued dependen­cies equivalent to a join dependency. IPL, 18, 1984, 261-266.

[Got87a] G. Gottlob, On the size of nonredundant FD-covers. IPL, 24(6), 1987, 355-360.

[Got87b] G. Gottlob, Computing covers for embedded functional dependencies. Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems- PODS'87, San Diego, California, 1987, ACM Press, New York, 1987, 58-69.

[GPT80] 0. Yu. Gortschinskaja, S. W. Petrow, and L. A. Tenenbaum, Decompo­sition of relations and logical database design. Awtomatika i telemechanika, 2, 1980, 159-166; 3, 1980, 152-160 (In Russian).

[GPV88] M. Gyssens, J. Paredaens, and D. Van Gucht, A uniform approach to­wards handling atomic and structural information in the nested relational database model. Report UIA 88-17, University of Antwerp, 1988.

[Gra79] J. Grant, Null values in a relational data base. IPL, 6(5), 1979, 156-157. [Gra87] J. Grant, Logical introduction to databases. Academic Press, New York,

1987. [Gri82] J. J. Griethuysen, Concepts and terminology for the conceptual schema

and the information base. Report of ISO TC 97 I SC5 I WG5, 1982. [GrJ82] J. Grant and B. E. Jacobs, On the family of generalized dependency con­

straints. JACM, 29( 4), 1982, 986-997. [GrM85a] J. Grant and J. Minker, Inferences for numerical dependencies. TCS, 41,

1985, 271-287. [GrM85b] J. Grant and J. Minker, Normalization and axiomatization for numerical

dependencies. Inf. Control, 65(1), 1985, 1-17. [GrR94] J. Gray and A. Reuter, Transaction processing: Concepts and techniques.

Morgan Kaufmann, San Mateo, 1994. [GRV94] M. Gandhi, E. L. Robertson, and D. Van Gucht, Leveled entity­

relationship model. In [ER'94], 420-436. [GSS89] G. Gottlob, M. Schrefl, and M. Stumptner, On the interaction between

closure and functional dependencies. In [MFDBS'89], 187-206. [GuL82] Y. Gurevich and H. R. Lewis, The inference problem for template depen­

dencies. Proc. 1st ACM Symp. on Principles of Database Systems- PODS'82, Los Angeles, California, 1982, ACM, New York, 1982, 199-204.

[Gur76] Y. Gurevich, The decision problem for standard classes. Journal of Sym­bolic Logic, 41, 1976, 460-464.

[Gur84] Y. Gurevich, Towards logic tailored for computational complexity. LNM 1104, Springer, Berlin, 1984, 175-216.

[Gus94] R. Gustas, From conceptual to business modeling. Proc. Baltic Workshop on National Infrastructure Databases - Baltic DB'94, Vilnius, Lithuania, 1994, 218-229.

[GyL97] M. Gyssens and L. V. S. Lakshmanan, A foundation for multidimensional databases. Proc. 23rd Int. Conf. on Very Large Databases- VLDB'97 (eds. M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, M. A. Jeusfeld), Athens, 1997, Morgan Kaufmann, San Francisco, 1997, 106-115.

[GyP83] M. Gyssens and J. Paredaens, Another view of functional and multivalued dependencies in the relational database model. Int. J. Computer and Informa­tion Sciences 12, 1983, 247-267.

[GyP86] M. Gyssens and J. Paredaens, On the decomposition of join dependencies. Advances in Computing Research, 3, 1986, 69-106.

References 583

[Gys86] M. Gyssens, On the complexity of join dependencies. ACM TODS, 11(1), 1986, 81-108.

[HaF86] Y. Hanatani and R. Fagin, A simple characterization of database depen­dency implication. IPL, 22, 1986, 281-283.

[Hai90] J.-1. Hainaut, Entity-relationship models: Formal specification and com­parison. In [ER'90], 53-64.

[Hai91] J.-1. Hainaut, Database reverse engineering: Models, techniques, and strategies. In [ER'91], 729-741.

[Hai92] J .-1. Hainaut, Temporal statistical model for entity-relationship schemas. In [ER'92], 79-96.

[HaJ94] P. Hartel and R. Jungclaus, Specifying business processes over objects. In [ER'94], 10-27.

[Hal95] T. A. Halpin, Conceptual schema and relational database design. Prentice Hall, Sydney, 1995.

[HaM91] R. A. Hason and J. A. Makowsky, Update languages versus query lan­guages. Proc. XI SCCC, Santiago, 1991, 17-30.

[HaP95] T. A. Halpin and H. A. Proper, Database schema transformation and optimization. In [ER'95], 191-203.

[Har87a] D. Harel, Statecharts: A visual formalism for complex systems. North­Holland, New York, 1987.

[Har87b] D. Harel, Logic and Databases: A critique. SIGPLAN Notices, 22(3), 1987, 14-20.

[Har96a] S. Hartmann, Uber die Charakterisierung und Konstruktion von Entity­Relationship-Datenbanken mit Kardinalitatsbedingungen. PhD Thesis, Univer­sitat Rostock, 1996.

[Har96b] S. Hartmann, Global cardinality constraints. Proc. Workshop Challenges of Application and Challenges of Design (track of ER'96) ( eds. M. Albrecht, B. Thalheim), Cottbus, 1996, 196-206.

[Har98] S. Hartmann, On the consistency of int-cardinality constraints. In [ER'98], 150-163.

[HaR99] T. Harder und E. Rahm, Datenbanksysteme - Konzepte und Techniken der Implementierung. Springer, Berlin 1999.

[HaS66] J. Hartmanis and R. E. Stearns, Algebraic structure theory of sequential machines. Prentice Hall, Englewood Cliffs, New Jersey, 1966.

[Has95] J. Hasebrock, Multimedia psychology. Spektrum, Berlin, 1995. [Haw90a] I. T. Hawryskiewycz, Relational database design. Prentice Hall, Sydney,

1990. [Haw90b] I. T. Hawryszkiewycz, The art of database design. Macmillan, 1990. [Hay95] D. C. Hay, Data model pattern: Conventions of thought. Dorset House,

New York, 1995. [Hef97] A. Hefner, A min-max theorem for a constrained matching problem. SIAM

Journal on Discrete Mathematics, 10(2), 1997, 180-189. [Heg88] S. J. Hegner, Decomposition of relational schemata into components de­

fined by both projection and restriction. Proc. 7th ACM SIGACT-SIGMOS­SIGART Symp. on Principles of Database Systems - PODS'88, Austin, Texas, ACM Press, New York, 1988, 174-183.

[Heg90] S. J. Hegner, Foundation of canonical update support for closed database views. In [ICDT'90], 422-436.

[HeG92] R. Herzig and M. Gogolla, Transforming conceptual data models into an object model. In [ER'92], 1992, 280-298.

[Heu89] A. Heuer, Equivalent schemes in semantic, nested relational, and relational database models. In [MFDBS'89], 237-253.

584 References

[Heu91] A. Heuer, Konzepte objektorienter Datenmodelle. In: Entwicklungstenden­zen bei Datenbank-Systemen (eds. G. Vossen, K.-U. Witt), Oldenbourg, 1991, 203-252.

[Heu92] A. Heuer, Objektorientierte Datenbanken, Konzepte, Madelle, Systeme. Addison-Wesley, Bonn, 1992.

[HeY85] A. R. Hevner und S. B. Yao, Network database design methods. In: Princi­ples of database design, Volume I: Logical organizations ( ed. S. B. Yao), Prentice Hall, Englewood Cliffs, 1985, 294-324.

[HGP92] M. Halper, J. Geller, and Y. Perl, "Part" relations for object-oriented databases. In [ER'92], 406-422.

[HHE96] J.-L. Hainaut, J.-M. Hick, V. Englebert, J. Henrard, and D. Roland, Un­derstanding the implementation of Is-A relations. In [ER'96], 42-57.

[Him90a] M. Himsolt, GraphEd user manual. University Passau, Computer Science Dept., 1990.

[Him90b) M. Himsolt, SGraph 3.0. University Passau, Computer Science Dept., 1990.

[HLM93) W. L. Hiirsch, K.-J. Lieberherr, and S. Mukherjea, Object-oriented schema extension and abstraction. Proc. 1993 ACM/SIGAPP Symp. on Ap­plied Computing: States of the Art and Practice - SAC'93, Indianapolis, ACM Press, New York, 1993, 54-62.

[HoE90) U. Hohenstein and G. Engels, Formal semantics of an entity-relationship­based query language. In [ER'90), 171-188.

[HoE92] U. Hohenstein and G. Engels, SQL/EER- Syntax and semantics of an entity-relationship-based query language. Information Systems, 17, 1992, 209-242.

[HoG88] U. Hohenstein and M. Gogolla, A calculus for an extended entity­relationship model. In [ER'88), 129-148.

[HoH91] U. Hohenstein and K. Hiilsmann, A language specifying static and dy­namic integrity constraints. In [ER'91), 389-416.

[Hoh93] U. Hohenstein, Formale Semantik eines erweiterten Entity-Relationship­Modells. Teubner, Stuttgart, 1993.

[Hon82] P. Honeyman, Testing satisfaction of functional dependencies. JACM, 29(3), 1982, 668-677.

[Hor99] I. Horrocks, Constructing the user interface with statecharts. Addison­Wesley, Harlow, 1999.

[HOT76) P. Hall, J. Owlett, and S. Todd, Relations and entitites. In: Modelling in Database Management Systems (ed. G. M. Nijssen), North-Holland, Amster­dam, 1976, 201-220.

[HoT86) Ho Thuan, Contribution to the theory of relational databases. PhD Thesis, Budapest, MTA Sztaki, 1986.

[How94) W. Hower, Constraint satisfaction-algorithms and complexity analysis. Fachbericht Informatik 17-94, Universitiit Koblenz-Landau, 1994.

[HPT88) G. J. Houben, J. Paredaens, and D. Tahon, Expressing structural infor­mation by the nested relational algebra: An overview. Computing Science Notes, Proc. 8th Int. Conf. on Computer Science - SCCC'88, Santiago de Chile, 1988.

[HRS92] C. Hiibel, D. Ruland, and E. Siepmann. On modeling integrated design environments. Proc. 1st European Design Automation Conf. - Euro-DAC'92, Hamburg, 1992, IEEE Computer Society Press, Los Alamitos, 1992.

[HSV95) P. S. Hands, A. Srinivasan, and G. M. Vignes, Database design with be­havior and views using parameterized petri nets. In [ER'95), 158-169.

[HTL84) Ho Thuan and LeVan Bao, Some results about keys of relational schemes. Acta Cybemetica, 7(1), 1984, 99-113.

References 585

[Hub85] G. U. Hubbard, Computer-assisted hierarchical database design. In: Prin­ciples of database design, Volume 1: Logical organizations (ed. S. B. Yao), Pren­tice Hall, Englewood Cliffs, 1985, 255-293.

[HuG83] R. Hull and S. Ginsburg, Order Dependencies in the relational model. TCS, 26, 1983, 149-195.

[HuK87] R. Hull and R. King, Semantic database modeling: Survey, applications, and research issues. ACM Computing Surveys, 19(3), 1987, 201-260.

[Hul84] R. Hull, Finitely specifiable implicational dependency families. JACM, 31, 1984, 210-226.

[Hul89] R. Hull, Four views of complex objects: A sophisticate's introduction. Proc. Workshop Theory and Applications of Nested Relations and Complex Objects, (eds. S. Abiteboul, P. C. Fischer, H.-J. Schek), Darmstadt, LNCS 361, Springer, Berlin, 1989, 87-116.

[Hul90] G. Hulin, On restructuring nested relations in partitioned normal form. Proc. 16th Int. Conf. on Very Large Databases - VLDB'90 (eds. D. McLeod, R. Sacks-Davis, H.-J. Schek), Brisbane, Queensland, 1990, Morgan Kaufmann, 1990, 626-637.

[HuYa 84] R. Hull and C. K. Yap, The format model: A theory of database orga­nization. JACM, 31(3), 1984, 518-537.

[ICDT'86] Prof. 1st Int. Conf. on Database Theory, ICDT'86 (eds. G. Ausiello, P. Atzeni). Rome, Italy, Sept. 8 - 10, 1986, LNCS 243, Springer, Berlin, 1986.

[ICDT'88] Proc. 2nd Int. Conf. on Database Theory, ICDT'88 (eds. M. Gyssens, J. Paredaens, D. Van Gucht). Bruges, Belgium, Aug. 31- Sept. 2, 1988, LNCS 326, Springer, Berlin, 1988.

[ICDT'90] Proc. 3rd Int. Conf. on Database Theory, ICDT'90 (eds. S. Abiteboul, P. C. Kanellakis). Paris, France, Dec. 12- 14, 1990, LNCS 470, Springer, Berlin, 1990.

[ICDT'92] Proc. 4th Int. Conf. on Database Theory, ICDT'92 (eds. J. Biskup, R. Hull). Berlin, Germany, Oct. 14 - 16, 1992, LNCS 646, Springer, Berlin, 1992.

[ICDT'95] Proc. 5th Int. Conf. on Database Theory, ICDT'95 (eds. G. Gottlob, M. Y. Vardi). Prague, Czech Republic, Jan. 11 - 13, 1995, LNCS 893, Springer, Berlin, 1995.

[ICDT'97] Proc. 6th Int. Conf. on Database Theory, ICDT'97 (eds. F. N. Afrati, P. Kolaitis). Delphi, Greece, Jan. 8 - 10, 1997, LNCS 1186, Springer, Berlin, 1997.

[ICDT'99] Proc. 7th Int. Conf. on Database Theory, ICDT'99 (eds. C. Beeri, P. Buneman). Jerusalem, Israel, Jan. 10 - 12, 1999, LNCS 1540, Springer, Berlin, 1999.

(ImL81] T. lmielinski and W. Lipski, Jr., The relational model of data and cylin­drical algebras. Int. Conf. on Supercomputing, Computer Science Institute of Polish Academy of Science, ICS PAS Rep. 446, Warszawa, 1981.

[ImL82] T. lmielinski and W. Lipski, Jr., A systematic approach to relational database theory. Computer Science Institute of Polish Academy of Science, ICS PAS Rep. 457, Warszawa, 1982.

[ImL83] T. lmielinski and W. Lipski, Incomplete information and dependencies in relational databases. Proc. of Annual Meeting- SIGMOD'83 (eds. D. J. DeWitt, G. Gardarin), San Jose, California, 1983, ACM Press, SIGMOD Record, 13(4), 1983, 178-184.

(lso91] ISOTEC, Methoden des Fachkonzepts. Plonzke lnformatik GmbH, Wies­baden, 1991.

[IS092] ISO/IEC 9075. Database language SQL, 1992. [Jac82] B. E. Jacobs, On database logic. JACM, 29(2), 1982, 310-332.

586 References

[Jac83] R. Jackendoff, Semantics and cognition. MIT Press, Cambridge, Mass., 1983.

[Jaj86] S. Jajodia, Recognizing multivalued dependencies in relation schemes. The Computer Journal, 29, 1986, 458-459.

[JaJ94] H. M. Jamil and P. Johannessen, Semantic interoperability - Context, is­sues and research directions. Proc. 2nd Int. Conf. on Cooperative Information Systems- CoopiS'94 (eds. M. L. Brodie, M. Jarke, M.P. Papazoglou), Toronto, Canada, 1994, 180-191.

[JaL80] S. W. Jablonski and 0. B. Lupanow, Diskrete Mathematik und mathema­tische Fragen der Kybernetik. Akademie-Verlag, Berlin, 1980.

[JaN83] S. Jajodia and P. A. Ng, On representation of relational structures by entity-relationship diagrams. In: Entity-Relationship Approach to Software En­gineering (eds. C. G. Davis, S. Jajodia, P. A. Ng, R. T. Yeh), North-Holland, Amsterdam, 1983, 249-263.

[Jan87] K.-P. Jantke, Inductive Inference of Functional Dependencies. Report Humboldt University Berlin, ORZ, 1987.

[Jan89] J. Janas, Covers of functional independencies. In [MFDBS'89], 254-268. [JaN90] K. Jiirvelin and T. Niemi, Entity-based query construction for relational

database access. Technical Report A-1990-6, Dept. of Computer Science, Uni­versity of Tampere, 1990.

[JaP79] D. Janssens and J. Paredaens, General dependencies. Report 79-35, Uni­versitaire instelling Antwerpen, Dept. Wiskunde, 1979.

[JaR83] A. Jankowski and C. Rauscher, Logical foundations approach to users do­main restriction in databases. TCS, 23, 1983, 11-26.

[JaS82] G. Jaeschke and H. J. Sebek, Remarks on the algebra of nonfirst-normal­form relations. Proc. 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems- PODS'82, Los Angeles, California, ACM Press, New York, 1982, 124-138.

[JaS91] S. Jajodia and R. Sandhu, Toward a multilevel secure relational data model. Proc. 1991 ACM SIGMOD Int. Conf. on Management of Data (eds. J. Clifford, R. King), Denver, Colorado, SIGMOD Record, 20(2), 1991, 50-59.

[JBS89] W. J. K. Jih, D. A. Bradbard, C. A. Snyder, and N. G. A. Thompson, The effects of relational and entity-relationship data models on query performance of end users. Int. Journal of Man-Machine Studies, 31(3), 1989, 257-267.

[JCJ95J I. Jacobson, M. Christerson, P. Jonsson, and G. Overgaard, Object­oriented· software engineering: A use case driven approach. Addison-Wesley, Reading, Mass., 1995.

[JeS95] C. Jensen and R. Snodgrass, Semantics of time-varying attributes and their use for temporal database design. In [ER'95], 366-377.

[JFL86] M. Junet, G. Falquet, and M. Leonard, ECRINS/86: An extended entity­relationship data base management system and its semantic query language. Proc. 12th Int. Conf. on Very Large Data Bases- VLDB'86 (eds. W. W. Chu, G. Gardarin, S. Ohsuga, Y. Kambayashi), Kyoto, 1986, Morgan Kaufmann, San Mateo, 1986, 259-266.

[JGK70] S. W. Jablonski, G. P. Gawrilow, and W. B. Kudrjavcev, Boolesche Funk­tionen und Postsche Klassen. Akademie-Verlag, Berlin, 1970.

[JNS83a] S. Jajodia, P. A. Ng, and F. N. Springsteel, Entity-relationship diagrams which are in BCNF. Int. J. Computer and Information Sciences, 12( 4), 1983, 269-283.

[JNS83b] S. Jajodia, P. A. Ng, and F. N. Springsteel, The problem of equivalence for entity-relationship diagrams. IEEE TSE, 9(5), 1983, 617-630.

[Joh91] P. Johannessen, A logic based approach to schema integration. In [ER'91], 147-162.

References 587

[Joh93a] P. Johannesson, Schema integration, schema translation, and interoper­ability in federated information systems. PhD Thesis, Stockholm University, 1993.

[Joh93b] P. Johannesson, Using conceptual graph theory to support schema inte­gration. In [ER'93], 283-296.

[Jon90] J. Jonsson, Semantic modeling through identification and characterization of objects. SIGMOD Record, 19(1), 1990, 23-28.

[JOS93] P. Jaeschke, A. Oberweis, and W. Stucky, Extending ER model clustering by relationship clustering. In [ER'93], 451-462.

[JOS94] P. Jaeschke, A. Oberweis, and W. Stucky, Deriving complex structured object types for business process modeling. In [ER'94], 28-45.

[JoS95] T. H. Jones and 1.-Y. Song, Binary representation of ternary relationships in ER conceptual modeling. In [ER'95], 216-225.

[JSH91] R. Jungclaus, G. Saake, and T. Hartmann, Language features for object­oriented conceptual modeling. In [ER'91], 309-324.

[Jun93] R. Jungclaus, Modeling of dynamic object systems - A logic-based ap­proach. Vieweg, Braunschweig, 1993.

[KaD93] G. 0. H. Katona and J. Demetrovics, A survey of some combinato­rial results concerning functional dependencies in relational databases. An­nals of Mathematics and Artificial Intelligence, Mathematical Fundamentals of Database and Knowledge Base Systems (ed. B. Thalheim et al.), 7, 1993, 63-82.

[Kah85] B. K. Kahn, Requirement specification techniques. In: Principles of database design, Volume I: Logical organizations (ed. S. B. Yao), Prentice Hall, Englewood Cliffs, 1985, 1-66.

[KaK91] T. Kamada and S. Kawai, A general framework for visualizing abstract objects and relations. ACM Transactions on Graphics, 10(1), 1991, 1-39.

[KaK93] P. Kandzia and H.-J. Klein, Theoretische Grundlagen relationaler Daten­banksysteme. Bibliographisches lnstitut, Darmstadt, 1993.

[Kam81] Y. Kambayashi, Database, a bibliography. Computer Science Press, Rockville, 1981.

[Kan80] P. C. Kanellakis, On the computational complexity of cardinality con­straints in relational databases. IPL, 11(2), 1980, 98-101.

[Kan90a] P. C. Kanellakis, Elements of relational database theory. In: Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics (ed. J. Van Leeuwen), Elsevier, Amsterdam, 1990, 1074-1156.

[Kan90b] H. Kangassalo, Foundation of conceptual modeling: A theory construc­tion view. Information Modeling and Knowledge Bases, lOS Press, 1990, 19-35.

[Kan93] H. Kangassalo, COMIC: A system and methodology for conceputal mod­elling and information construction. DKE, 9, 1993, 287-319.

[KaS88] G. Kappel and M. Schrefl, A behavior integrated entity-relationship ap­proach for the design of object-oriented databases. In [ER'88], 311-328.

[KaS91] G. Kappel and M. Schrefl, Object/behavior diagrams. Proc. 7th Int. Conf. on Data Engineering - ICDE'91, Kobe, Japan, 1991, IEEE Computer Society, New York, 1991, 530-539.

[KaS92] G. Kappel and M. Schrefl, Local referential integrity. In [ER'92], 41-61. [Kas96] R. Kaschek, Inheritance as a conceptual primitive. In [ER'96], 406-421. [KaS96] G. Kappel and M. Schrefl, Objektorientierte lnformationssysteme -

Konzepte, Darstellungsmittel, Methoden. Springer, Vienna, 1996. [Kat80] R. H. Katz, Database design and translation for multiple data models.

PhD Thesis, Dept. of Computer Science, UC Berkeley, 1980. [Kat84a] H. Katsuno, When do non-conflict free multivalued dependency sets ap­

pear. IPL, 18(2), 1984, 87-92.

588 References

[Kat84b] H. Katsuno, An extension of conflict-free multivalued dependency sets. ACM TODS, 9(2), 1984, 309-326.

[Kat90] R. H. Katz, Towards a unified framework for version modeling in engineer­ing databases. ACM Computing Surveys, 22(4), 1990, 375-408.

[KBB88] W. Kim, N. Ballou, J. Banerjee, H. T. Chou, J. Garza, and D. Woelk, In­tegrating an object-oriented programming system with a database system. Proc. 3rd Conf. on Object-Oriented Programming Systems, Languages, and Applica­tions - OOPSLA'88 (ed. N. K. Meyrowitz), San Diego, California, SIGPLAN Notices, 23(11), 1988, 142-152.

[KCV83] P. C. Kanellakis, S. S. Cosmodakis, and M. Y. Vardi, Unary inclusion dependencies have polynomial time inference problems. Technical report CS-83-09, Brown University, Dept. of Computer Science, 1983.

[Kel86] A. M. Keller, Set-theoretic problems of null completion in relational databases. IPL, 22(5), 1986, 261-265.

[Ken78] W. Kent, Data and reality. North-Holland, Amsterdam, 1978. [Ken81] W. Kent, Consequences of assuming a universal relation. ACM TODS,

6( 4), 1981, 539-556. [KeN92] N. Kehrer and G. Neumann, An EER prototyping environment and its

implementation in a Datalog language. In [ER'92], 243-261. [KeN97] R. E. Kent and C. Neuss, Conceptual analysis of hypertext. In: Intelligent

hypertext: Advanced techniques for the world wide web (eds. C. Nicholas, J. Mayfield), LNCS 1326, Springer, Berlin, 1997, 70-89.

[Ker87] L. Kerschberg ( ed. ), Expert database systems. Benjamin/Cummings, Menlo-Park, 1987.

[KGC85] T. D. Kimura, W. D. Gillett, and J. R. Cox, Jr., A design of data model based on abstraction of symbols. The Computer Journal, 28(3), 1985, 298-308.

[KhC86] S. Khoshafian and G. P. Copeland, Object identity. Proc. 1st Int. Conf. on Object-Oriented Programming Systems, Languages, and Applications - OOP­SLA'86 (ed. N. K. Meyrowitz), Portland, Oregon, 1986, SIGPLAN Notices, 21(11), 1986, 406-416.

[Kho93] S. Khoshafian, Object-oriented databases. John Wiley & Sons, New York, 1993.

[KiC93] S.-K. Kim and S. Chakravarthy, Modeling time: Adequacy of three district time concepts for temporal databases. In [ER'93], 475-491.

[KiH86] R. King and R. Hull, Semantic database modeling: Survey, applications and research issues. USC, TR 86-201, 1986.

[KiL89a] W. Kim and F. H. Lochovsky (eds.), Object-oriented concepts, databases, and applications. Addison-Wesley, Reading, Mass., 1989.

[KiL89b] M. Kifer and G. Lausen, F-logic: A higher-order language for reasoning about objects, inheritance, and schema. Proc. 1989 ACM SIGMOD Int. Conf. on Management of Data- SIGMOD'89 (eds J. Clifford, B. G. Lindsay, D. Maier), Portland, Oregon, 1989, SIGMOD Record, 18(2), 1989, 134-146.

[KiM85] R. King und D. McLeod, Semantic data models. In: Principles of database design, Volume I: Logical organizations (ed. S. B. Yao), Prentice Hall, Engle­wood Cliffs, 1985, 115-150.

[Kim90] W. Kim, Research directions in object-oriented database systems. Proc. 9th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Sys­tems- PODS'90, Nashville, Tennessee, 1990, ACM Press, New York, 1990, 1-15.

[Kim92] W. Kim, A framework for supporting triggers in object-oriented database systems. Int. Journal of Intelligent and Cooperative Information Systems, 1(1), 1992, 127-143.

[Kim96a] R. Kimball, A dimensional modeling manifesto. DBMS, 1996, 51-56.

References 589

[Kim96b] R. Kimball, The data warehouse toolkit. John Wiley & Sons, New York, 1996.

[Kin89] R. King, My cat is object-oriented. In: Object-Oriented Concepts, Databases, and Application (eds. W. Kim, F. H. Lochovsky), ACM Press and Addison-Wesley, 1989, 23-30.

[Kle94] H.-J. Klein, How to modify SQL queries in order to guarantee sure answers. SIGMOD Record, 23(3), 1994, 14-20.

[Kle98] M. Klettke, Akquisition von Integritatsbedingungen in Datenbanken. infix­Verlag, St. Augustin, DISBIS 51, 1998.

[Kle99] H.-J. Klein, On the use of marked nulls for the evaluation of queries against incomplete relational databases. Proc. Fundamentals of Information Systems, 7th Int. Workshop on Foundations of Models and Languages for Data and Ob­jects- FoMLaD0'98 (eds. T. Polle, T. Ripke, K.-D. Schewe), Timmel, Ostfries­land, 1998, Kluwer, London, 1999, 81-98.

[Kli83] B. Klipps, Ein allgemeiner Abhangigkeitsbegriff fiir Relationen und seine Axiomatisierung. Preprint WPU Rostock, Fachbereich Mathematik, 1983.

[KlP82] A. C. Klug and R. Price, Determining view dependencies using tableaux. ACM TODS, 7(3), 1982, 361-380.

[KlR97] H.-J. Klein and J. Rasch, Value based identification and functional depen­dencies for object databases. Proc. 3rd Basque Int. Workshop on Information Technology, IEEE Computer Science Press, New York, 1997, 22-34.

[Klu80] A. C. Klug, Calculating constraints on relational expressions. ACM TODS, 5(3), 1980, 260-290.

[Kna95] J. Knapp, Uniqueness conditions for ER representations. In [ER'95], 296-307.

[KnA96] A. J. Knobbe and P. W. Adriaans, Discovering foreign key relations in relational databases. Cybernetics and Systems 96, Vienna, 1996, 961-966.

[KnS25] K. Knopp and I. Schur, Elementare Beweise einiger asymptotischer Formeln der additiven Zahlentheorie. Mathematische Zeitschrift, 24, 1925, 559-574.

[Kob85] I. Kobayashi, An overview of database management technology. In: Ad­vances in Information System Science (ed. J. T. Tou), Vol. 9, Plenum Press, New York, 1985.

[Kob86a] I. Kobayashi, Databases and conceptual schemata: A formal framework. Proc. 12th Int. Conf. on Very Large Data Bases- VLDB'86 (eds. W. W. Chu, G. Gardarin, S. Ohsuga, Y. Kambayashi), Kyoto, Japan, 1986, Morgan Kaufmann, San Mateo, 1986, 3-23.

[Kob86b] I. Kobayashi, Losslessness and semantic correctness of database schema transformation: Another look to schema equivalence. Information Systems, 11(1), 1986, 41-59.

[Kob86c] I. Kobayashi, Classification and transformation of binary relationship re­lation schemata. Information Systems, 11(2), 1986, 109-122.

[Kob92] I. Kobayashi, Complex values, structured terms and aggregate functions. Technical Report, Sanno Institute, 1992.

[KoG95] V. Kouramajian and M. Gertz, A graphical query language for temporal databases. In [ER'95], 388-399.

[Kos84] A. W. Kostotschka, On the maximal cardinality of filters in n-ary cubes. Novosibirsk, Diskretnij Analiz, 41, 1984, 49-61 (In Russian).

[KoS86] H. F. Korth and A. Silberschatz, Database system concepts. McGraw-Hill, New York, 1986.

[Kos96] A. Kosky, Observational distinguishability of databases with object iden­tity. Proc. 5th Int. Workshop on Database Programming Languages- DBPL'95

590 References

(eds. P. Atzeni, V. Tannen), Gubbio, Umbria, 1995, Electronic Workshops in Computing, Springer, London, 1996, 11.

[Kou95] M. Koubarakis, Databases and temporal constraints: Semantics and com­plexity. Proc. Recent Advances in Temporal Databases (eds. J. Clifford, A. Tuzhilin), Int. Workshop on Temporal Databases, Zurich, 1995, Workshops in Computing, Springer, London, 1995, 93-109.

[KoZ95] M. Kolp and E. Zimanyi, Relational database design using an ER ap­proach and Prolog. Proc. Information Systems and Data Management ( ed. S. Bhalla), 6th Int. Conference on Information Systems and Data Management -CISMOD'95, Bombay, India, LNCS 1006, Springer, Berlin, 1995, 214.

[Kri71] S. Kripke, Identity and necessity. In: Identity and Individuation (ed. M. K. Munitz), Freeman, New York, 1971.

[Kri72] S. Kripke, Naming and necessity. In: Semantics of natural language ( eds. D. Davidson, G. Harman). Kluwer, Dordrecht, 1972.

[KrK67] G. Kreisel and J. L. Krivine (eds), Elements of mathematical logic; theory of models. Amsterdam, North-Holland, 1967.

[KSS87] R. A. Kowalski, F. Sadri, and P. Soper, Integrity checking in deductive databases. Proc. 13th Int. Conf. on Very Large Data Bases - VLDB'87 (eds. P. M. Stocker, W. Kent, P. Hammersley), Brighton, England, 1987, Morgan Kaufmann, San Mateo, 1987, 61-69.

[KTY79a] Y. Kambayashi, K. Tanaka, and S. Yajima, Semantic aspects of data dependencies and their application to relational database design. Proc. 3rd Int. Computer Software & Applications Conference - COMPSAC'79, Chicago, 398-403.

[KTY79b] Y. Kambayashi, K. Tanaka, and S. Yajima, Semantic aspects of data dependencies and their application to relational database design. Technical Re­port, Kyoto University /Kobe University, 1979.

[Kun82] H. S. Kunii, Graph data model and its data language. Springer, New York, 1982.

[KuS87] J. F. Kurose and R. Simha, Second derivative algorithms for optimal re­source allocation in distributed computer systems. Proc. 7th Int. Conf. on Dis­tributed Computing Systems, Berlin, 1987, 56-63.

[KYT80] Y. Kambayashi, S. Yajima, and K. Tanaka, Problems of relational database design. Data base design techniques I, LNCS 132, Springer, Berlin, 172-218.

[LaD83] J. A. Larson and P. A. Dwyer, Defining external schemas for an entity­relationship database. In [ER'83], 347-364.

[LaF93] A. H. F. Laender and D. J. Flynn, A semantic comparison of the modelling capabilities of the ER and NIAM models. In [ER'93], 242-256.

[Lak88] L. V. S. Lakshmanan, Split-freedom and MVD-intersection: A new charac­terization of multi valued dependencies having conflict-free covers. TCS, 62(1-2), 1988, 105-122.

[LaL95] S. M. Lang and P. C. Lockemann, Datenbankeinsatz. Springer, Berlin, 1995.

[LaL97] K. C. Laudon and J. P. Laudon, Essentials of management information systems. Prentice Hall, Upper Sale River, 1997.

[La094] M. W. Lansdale and T. C. Ormerod, Understanding interfaces, a hand­book of human-computer dialogue. Academic Press, London, 1994.

[LaS92] C. Laasch and M. H. Scholl, Generic update operations keeping object­oriented databases consistent. Proc. Informationssysteme und Kiinstliche lntel­ligenz: Modellierung (ed. R. Studer), 2. GI-Workshop - IS/KI'92, Ulm, 1992, lnformatik-Fachberichte, Band 303, Springer, Berlin, 1992, 40-55.

References 591

[Lau92] D. Lau, A completeness criterion for Pk(l). J. of Information Processing and Cybernetics, ElK, 28(3), 1992, 87-112.

[LBS98] R. Lackes, W. Brandl, and M. Siepermann, Datensicht von lnformations­systemen. PC Trainer. CD-ROM, Springer, Berlin, 1998.

[LCC94] C.-T. Liu, P. K. Chrysanthis, and S.-K. Chang, Database schema evo­lution through the specification and maintenance of changes on entities and relationships. In [ER'94], 132-151.

[LeL92] M. Levene and G. Loizou, Inferring null join dependencies in relational databases. BIT, 32, 1992, 413-429.

[LeL94a] M. Levene and G. Loizou, The additivity problem for functional depen­dencies in incomplete relations. Research Notes RN/94/41, Dept. of Computer Science, University College, London, 1994.

[LeL94b) M. Levene and G. Loizou, Null inclusion dependencies in relational databases. Research Notes RN/94/26, Dept. of Computer Science, University College, London, 1994.

[LeL95) M.-L. Lee and T. W. Ling, Resolving structural conflicts in the integration of entity-relationship schemas. In [ER'95], 424-433.

[LeL97] M.-L. Lee and T. W. Ling, Resolving constraint conflicts in the integration of entity-relationship schemas. In [ER'97], 394-407.

[LeL98] M. Levene and G. Loizou, The additivity problem for data dependencies in incomplete relational databases. In: Proc. Semantics in Databases ( eds. L. Libkin, B. Thalheim), LNCS 1358, Springer, Berlin, 1998, 136-169.

[LeN87] M. Lenzerini and P. Nobili, On the satisfiability of dependency constraints in entity-relationship schemata. Proc. 13th Int. Conf. on Very Large Data Bases - VLDB'87 (eds. P.M. Stocker, W. Kent, P. Hammersley), Brighton, England, 1987, Morgan Kaufmann, San Mateo, 1987, 147-154.

[LeN90] M. Lenzerini and P. Nobili, On the satisfiability of dependency constraints in entity-relationship schemata. Information Systems, 15( 4), 1990, 453-461.

[Leo92] M. Leonard, Database design theory. Macmillan, Houndsmills, 1992. [LeP82] C. H. LeDoux and D. S. Parker, Reflections on Boyce-Codd normal form.

Proc. 8th Int. Conf. on Very Large Databases - VLDB'82, Mexico City, 1982, Morgan Kaufmann, Los Altos, 1982, 131-141.

[LeS97] H.-J. Lenz and A. Shoshani, Summarizability in OLAP and statistical data base. Proc. 9th Int. Conf. on Scientific and Statistical Database Management -SSDBM'97, Olympia, Washington, 1997, 132-143.

[LEW95) S. W. Liddle, D. W. Embley, and S. N. Woodfield, Unifying modeling and programming through an active, object-oriented, model-equivalent program­ming language. In [ER'95], 55-64.

[LEW96] J. Y. Lee, R. Elmasri, and J. Won, Specification of calendars and time series for temporal databases. In [ER'96], 341-356.

[Lew98] J. Lewerenz, Dialogs as a mechanism for specifying adaptive interaction in database application design. Proc. CAiSE'98, 5th Doctoral Consortium ( eds. A. Erni, V. Thurner), Pisa, 1998. ·

[LiB90] U. W. Lipeck and S. Braf:l, Tools for integrity-centered design of database applications. Internal report of the Computer Science Dept., University Dort­mund, 1990 (In German).

[Lie79] Y. E. Lien, Multivalued dependencies with null values in relational databases. Proc. 5th Int. Conf. on Very Large Data Bases - VLDB'79 (eds. A. L. Furtado, H. L. Morgan), Rio de Janeiro, 1979, IEEE-CS, 1979, 61-66.

[Lie80] Y. E. Lien, On the semantics of the entity-relationship data model. Proc. Entity-Relationship Approach to System Analysis and Design (ed. P. P. Chen), 1st Int. Conf. on the Entity-Relationship Approach, Los Angeles, California, 1979, North-Holland, Amsterdam, 1980, 155-168.

592 References

[Lie82] Y. E. Lien, On the equivalence of database models. JACM, 29(2), 1982, 333-363.

[Lie85) Y. E. Lien, Relational database design. In: Principles of database design, Volume 1: Logical organizations (ed. S. B. Yao), Prentice Hall, Englewood Cliffs, 1985, 211-254.

[Lif88] V. Lifschitz, On declarative semantics of deductive databases and logic pro­grams. In [Min88], 177-192.

[LiG92) T. W. Ling and C. H. Goh, Logical database design with inclusion de­pendencies. Proc. Int. Conf. on Data Engineering- ICDE'92 (ed. G. Forouzan), Tempe, Arizona, 1992, IEEE Computer Society Press, New York, 1992, 642-649.

[LiL92] T. W. Ling and M.-L. Lee, A theory for entity-relationship view updates. In [ER'92], 262-279.

[Lin85a] T. W. Ling, An analysis of multivalued and join dependencies based on the entity-relationship approach. DKE, 1, 1985, 253-271.

[Lin85b] T. W. Ling, A normal form for entity-relationship diagram. In [ER'85], 24-35.

[LiN86] U. W. Lipeck and K. Neumann, Modeling and manipulating objects in geo-scientific databases. In [ER'86], 67-85.

[Lip81] W. Lipski, Jr., On database with incomplete information. JACM, 28(1), 1981, 41-70.

[Lip89] U. W. Lipeck, Dynamic integrity of databases. Springer, Berlin, lnformatik­Fachberichte, 209, 1989.

[LiT93] U. W. Lipeck and B. Thalheim (eds.), Modeling database dynamics. Se­lected papers 4th Int. Workshop on Foundations of Models and Languages for Data and Objects, Volkse, 1992, Workshops in Computing, Springer, London, 1993.

[LiT94] T. W. Ling and P. K. Teo, A normal form object-oriented entity relation­ship diagram. In [ER'94], 241-258.

[Liu95] L. Liu, Adaptive schema design and evalution in an object-oriented infor­mation system. In [ER'95], 21-31.

(Llo97] M. Lloyd-Williams, Exploiting domain knowledge during the automated design of object-oriented databases. In [ER'97], 16-29.

[LMG83] K. Laver, A. 0. Mendelzon, and M. H. Graham, Functional dependen­cies on cyclic database schemes. Proc. SIGMOD'83, Annual Meeting (ed. D. J. DeWitt), San Jose, California, 1983, SIGMOD Record, ACM Press, 13(4), 1983 79-91.

(LMS88] J. Leuchner, L. Miller, and G. Slutzki, A polynomial time algorithm for testing implications of a join dependency and embedded functional dependen­cies. Proc. 1988 ACM SIGMOD Int. Conf. on Management of Data - SIG­MOD'88 (eds. H. Boral, P.-A. Larson), Chicago, Illinois, 1988, SIGMOD Record, 17(3), ACM Press, New York, 1988, 218-224.

[LoM78] P. C. Lockemann and H. C. Mayr, Computer-based information systems. · Springer, Berlin, 1978 (In German).

[LoM84) R. A. Lorie and A. Maier, Using a relational DBMS for geographical da­tabases. Ceo-Processing, 2, 1984, 243-257.

[LoM91) P. C. Lockemann and G. Moerkotte, On the notion of concept. In [ER'91), 349-370.

[LoS87] P. C. Lockemann and J. W. Schmidt, Datenbank-Handbuch. Springer, Berlin, 1987.

[LQA97] W. Labio, D. Quass, and B. Adelberg, Physical database design for data warehouses. Proc. 13th Int. Conf. on Data Engineering - ICDE'97 (eds. A. Gray, P.-A. Larson), Birmingham, UK, 1997, IEEE Computer Society Press, New York, 1997, 277-288.

References 593

[LRV88] C. Lecluse, P. Richard, and F. Velez, 02, an object-oriented data model. Proc. 1988 ACM SIGMOD Int. Conf. on Management of Data - SIGMOD'88 (eds. H. Boral, P.-A. Larson), Chicago, Illinois, 1988, SIGMOD Record, 17(3), ACM Press, New York, 1988, 424-433.

[LSP93] E.-P. Lim, J. Srivastava, S. Prabhakar, and J. Richardson, Entity iden­tification in database integration. Proc. 9th Int. Conf. on Data Engineering -ICDE'93, Vienna, 1993, IEEE Computer Society Press, New York, 1993, 294-301.

[LST87) J. W. Lloyd, E. A. Sonenberg, and R. W. Topor, Integrity constraint checking in stratified databases. Logic Programming, 4, 1987, 331-343.

[LST99) H.-J. Lenz, A. Shoshani, and B. Thalheim, The impact of conceptual mod­eling to the correctness of aggregation functions. Manuscript, Berlin/Cottbus, 1999.

[Luk90] W. Lukaszewicz, Non-monotonic reasoning - formalization of common sense reasoning. Ellis Horwood, New York, 1990.

[Lu078) C. L. Lucchesi and S. L. Osborn, Candidate Keys for Relations. JCSS, 17, 1978, 270-279.

[Mac71) S. MacLane, Categories for the working mathematician. Graduate Texts in Mathematics, 5, Springer, New York, 1971.

[MaC85) S. T. March and J. V. Carlis, Physical database design: Techniques for improved database performance. In: Query Processing in Database Systems (eds. W. Kim, D. S. Reiner, D. S. Batory), Springer, New York, 1985, 279-296.

[Mac90) L. A. Maciaszek, Database design and implementation. Prentice Hall, Syd­ney, 1990.

[MaC97) E. Malinowski and S. Chakravarthy, Fragmentation techniques for dis­tributing object-oriented databases. In [ER'97), 347-360.

[Mai83) D. Maier, The theory of relational databases. Computer Science Press, Rockville, MD, 1983.

[Mai96] R. Maier, Benefits and quality of data modeling - Result of an empirical analysis. In [ER'96), 245-260.

[Mak81] J. A. Makowsky, Characterizing data base dependencies. Proc. 8th Collo­quium on Automata, Languages and Programming- ICALP'81 (eds. S. Even, 0. Kariv), Acre, Israel, 1981, LNCS 115, Springer, Berlin, 1981, 86-97.

[Mak87) J. A. Makowsky, Why Hom formulas matter in computer science: Initial structures and generic examples. JCSS, 34(3-4), 1987, 266-292.

[MaM85) J. Martin and C. McClure, Diagramming techniques for analysts and programmers. Prentice Hall, Englewood Cliffs, 1985.

[MaM90] V. M. Markowitz and J. A. Makowsky, Identifying extended entity­relationship object structures in relational schemes. IEEE TSE, 16, 1990, 777-790.

[Man90] R. Manthey, Satisfiability of integrity constraints: Reflections on a ne­glected problem. Proc. 2nd Workshop on Foundations of Models and Languages (eds. J. Goers, A. Heuer), Aigen, 1990, University Clausthal-Zellersfeld, Com­puter Science Dept., lnformatik-Bericht 90/3, 169-180.

[Man91) R. Manthey, Declarative languages - Paradigm of the past or challenge to the future? Proc. Next Generation Information System Technology, LNCS 504, Springer, Berlin, 1991, 1-16.

[Man96] H. Mannila, Schema design and knowledge discovery (abstract). In [ER'96), 27.

[MaP82] F. Manola and A. Pirotte, CQLF - a query language for CODASYL­type databases. Proc. 1982 ACM SIGMOD Int. Conf. on Management of Data SIGMOD'82 (ed. M. Schkolnick), Orlando, Florida, 1982, ACM Press, New York, 1982, 94-103.

594 References

[MaP96] P. Maret and J.-M. Pinon, Process knowledge modeling. In [ER'96], 89-104.

[MaR82] H. Mannila and K.-J. Rii.ihii, On the relationship between minimum and optimum covers for a set of functional dependencies. Research Rep. C-1982-51, University of Helsinki, 1982.

[MaR85a] H. Mannila and K.-J. Rii.ihii, Design by example: An application of Arm­strong relations. Technical Report, Cornell University, Computer Science Dept., TR 85-665, 1985, 19.

[MaR85b] H. Mannila and K.-J. Rii.ihii, Small Armstrong relations for database design. Proc. 4th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems - PODS'85, Portland, Oregon, 1985, ACM Press, New York, 1985, 245-250.

[MaR86] H. Mannila and K.-J. Rii.ihii, Inclusion dependencies in database design. Proc. 2nd Int. Conf. on Data Engineering ICDE'86, Los Angeles, California, 1986, IEEE Computer Society, 1986, 713-718.

[Mar87] J. Martin, Recommended diagrammatic standards for analysts and pro­grammers- a basis for automation. Prentice Hall, Englewood Cliffs, 1987.

[Mar89] J. Martin, Information engineering. Prentice Hall, Englewood Cliffs, 1989. [Mar90] V. M. Markowitz, Referential integrity revisited: An object-oriented per­

spective. Proc. 16th Int. Conf. on Very Large Data Bases- VLDB'90 (eds. D. McLeod, R. Sacks-Davis, H.-J. Schek), Brisbane, Queensland, 1990, Morgan Kaufmann, San Francisco, 1990, 578-589.

[MaR92a] H. Mannila and K.-J. Rii.ihii, The design of relational databases. Addison-Wesley, Wokingham, England, 1992.

[MaR92b] H. Mannila and K.-J. Rii.ihii, On the complexity of inferring functional dependencies. Discrete Applied Mathematics, 40, 1992, 237-243.

[MaR95] S. T. March and S. Rho, Allocating data and operations to nodes in distributed database design. IEEE TKDE, 7(2), 1995, 955-967.

[MaR96] J. A. Makowsky and E. V. Ravve, Translation schemes and the funda­mental problem of database design. In [ER'96], 5-26.

[MaR98] J. A. Makowsky and E. V. Ravve, Dependency preserving refinements and the fundamental problem of database design. DKE, Special Issue: ER'96 (ed. B. Thalheim), 24(3), 1998, 277-312.

[MaS77] F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. North-Holland, Amsterdam, 1977.

[MaS89a] V. M. Markowitz and A. Shoshani, On the correctness of representing extended entity-relationship structures in the relational model. Proc. 1989 ACM SIGMOD Int. Conf. on Management of Data SIGMOD'89 (eds. J. Clifford, B. G. Lindsay, D. Maier), Portland, Oregon, 1986, ACM Press, SIGMOD Record, 18(2), 1989, 430-439.

[MaS89b] V. M. Markowitz and A. Shoshani, Abbreviated query interpretation in extended entity-relationship oriented databases. In [ER'89], 40-58.

[MaS91] F. Matthes and J. W. Schmidt, Towards database application systems: Types, kinds and other open invitations. Proc. Next Generation Information System Technology (eds. J. W. Schmidt, A. A. Stognij), 1st Int. East/West Data Base Workshop, Kiev, 1990, LNCS 504, Springer, Berlin, 1991, 185-211.

[MaS92] V. M. Markowitz and A. Shoshani, Representing extended entity­relationship structures in relational databases: A modular approach. ACM TODS, 17(3), 1992, 423-464.

[MaU92] J. A. Makowsky and J. Ukelson, A formalism for interactive menu design. Interacting with Computers, 4(1), 1992, 83-110.

[Mau99] C. Maurer, Fundamentals of non-sequential programming. Springer, Berlin, 1999 (In German).

References 595

[MaV85] J. A. Makowsky and M. Y. Varcli, On the expressive power of data de­pendencies. Research report, Swiss Federal Institute of Technology, 1985.

[MaW86] S. Manchanda and D. S. Warren, Towards a logical theory of database updates. SUNY, Stony Brook, CSD, TR 8619, 1986.

[MaW88] D. Maier and D. S. Warren, Computing with logic: Logic programming with Prolog. Benjamin/Cummings, Menlo Park, 1988.

[MBG84] J. Mylopoulos, A. Borgida, S. J. Greenspan, and H. K. T. Wong, Informa­tion system design at the conceptual level - The TAXIS project. IEEE Database Engineering Bulletin, 7(4), (special issue on database design aids, methods, and environments), 1984, 4- 9.

[MBJ90] J. Mylopoulos, A. Borgida, M. Jarke, and M. Koubarakis, Telos: Repre­senting knowledge about information systems. ACM TOIS, 8{4), 1990, 325-362.

[MBW80] J. Mylopoulos, P. A. Bemstein, and H. K. T. Wong, A language facil­ity for designing interactive database-intensive applications. ACM TODS, 5(2), 1980, 185-207.

[McP97] P. McBrien and A. Poulovassilis, A formal framework for ER schema transformation. In [ER'97], 408-421.

[MDL87] H. C. Mayr, K. R. Dittrich, and P. C. Lockemann, Database design. In [LoS87], 481-557 (In German).

[MeD84] K. Meyer and J. Doughty, Automatic normalization and entity­relationship generation through attributes and roles. SIGMOD Record, 14(3), 1984, 69-103.

[Mee86] R. Meersman, Reasoning about conceptual database design - A semi­tutorial. IFIP, TC-2 Conf. on Knowledge and Data (DS-2) Portugal, North­Holland, 1986.

[MeH86] R. Meersman and A. Homdasch, Modeling static and dynamic aspects of information systems. IFIP, TC-2 WG 2.6 Work. Conf. on Database Semantics (DS-1), Albufeira, Portugal, 1986.

[Meh95] H. Mehlan, Entwicklung einer ID /LP-Grammatik zur Unterstiitzung einer natiirlichsprachigen Eingabe fiir das Datenbankentwurfssystem RADD. Diplom­arbeit, Universitiit Rostock, Fachbereich lnformatik, 1995.

[MeM79] A. 0. Mendelzon and D. Maier, Generalized mutual dependencies and the decomposition of database relations. Proc. 5th Int. Conf. on Very Large Data Bases VLDB'79 (eds. A. L. Furtado, H. L. Morgan), Rio de Janeiro, Brazil, IEEE-CS, New York, 1979, 75-82.

[Men79] A. 0. Mendelzon, On axiomatizing multivalued dependencies in relational databases. JACM, 26(1), 1979, 37-44.

[Men84] A. 0. Mendelzon, Database states and their tableaux. ACM TODS, 9(2), 1984, 264-282.

[MeN96] G. Metakides and A. Nerode, Principles of logic and logic programming. Elsevier, Amsterdam, 1996, Stuclies in computer science and artificial intelli­gence, Bd. 13.

[Mes92] J. Meseguer, Conclitioned rewriting logic as a united model of concurrency. TCS 96(1), 1992, 73-155.

[MeS93] J. Melton and A. R. Simon, SQL: A complete guide. Morgan Kaufmann, San Francisco, 1993.

[MeW93] J.-J. Ch. Meyer and R. J. Wieringa, Deontic logic in computer science: normative system specification. John Wiley & Sons, Chichester, 1993.

[MeW98] J.-J. Ch. Meyer and R. J. Wieringa, Logics for databases and information systems. Proc. Workshop on Logics and Databases (eds. J. Chomicki, G. Saake), Kluwer, Boston, 1998, 71-116.

[Mey88] B. Meyer, Object-oriented software construction. Prentice Hall, New York, 1988.

596 References

[MeZ79] M. A. Melkanoff and C. Zaniolo, Decomposition of relations and synthesis of entity-relationship diagrams. In [ER'79], 277-294.

[MFDBS'87] Proc. 1st MFDBS Symposium on Mathematical Fundamentals of Database and Knowledge Bases Systems, MFDBS'87 (eds. J. Biskup, J. Demetrovics, J. Paredaens, B. Thalheim). Dresden, GDR, Jan. 19- 23, 1987, LNCS 305, Springer, Berlin, 1988.

[MFDBS'89] Proc. 2nd MFDBS Symposium on Mathematical Fundamentals of Database and Knowledge Bases Systems, MFDBS'89 (eds. J. Demetrovics, B. Thalheim). Visegnid, Hungary, June 26- 30, 1989, LNCS 364, Springer, Berlin, 1989.

[MFDBS'91] Proc. 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Bases Systems, MFDBS'91 (eds. B. Thalheim, J. Demetrovics, H.-D. Gerhardt). Rostock, Germany, May 6- 9, 1991, LNCS 495, Springer, 1991.

[MFU81] D. Maier, R. Fagin, J.D. Ullman, and M. Yannakakis, Tools for template dependencies. IBM, Research Report, RJ3033, 1981.

[MGK88] L. L. Miller, S. K. Gadia, S. C. Kothari, and K. C. Liu, Completeness issues for join dependencies derived from the universal relation join dependency. IPL, 28(5), 1988, 269-274.

[MGR95] R. Missaoui, J.-M. Gagnon, and R. Godin, Mapping an extended entity­relationship schema into a schema of complex objects. In [ER'95], 204-215.

[MHB88] M. E. McLaughlin, K. B. Hill, D. D. Brown, M. A. Rogers, A. M. Howell, and P. P. Hatch, An integrated methodology and toolset for database design. SIGMOD Record, 17( 4), 1988, 37-55.

[MiG90] R. Missaoui and R. Godin, The implication problem for inclusion depen­dencies: A graph approach. SIGMOD Record, 19(1), 1990, 36-40.

[Mil89] R. Millner, Communication and concurrency. Prentice Hall, London, 1989. [MiN83] J. Minker and J.-M. Nicolas, On recursive axioms in deductive data bases.

Information Systems, 8(1), 1983, 1-13. [Min88] J. Minker (ed.), Foundations of deductive databases and logic program­

ming. Morgan Kaufmann, Los Altos, 1988. [MiS66] A. A. Mitalauskas and W. A. Statusljawistschus, Local limit theorems

and asymptotic decomposition for sums of independent lattice-based probalistic variables. Litowskij matematitscheskij sbornik, 6( 4), 1966, 569-583 (In Russian).

[Mit83] J. C. Mitchell, The implication problem for functional and inclusion de­pendencies. Information and Control, 56(3), 1983, 154-173.

[Mit90] J. C. Mitchell, Type systems for programming languages. In: Handbook of Theoretical Computer Science, Vol. B- Formal Models and Semantics (ed. J. Van Leeuwen), Elsevier, Amsterdam, 1990, 365-458.

[Mit91] S. Mittra, Principles of relational database systems. Prentice Hall, Engel­wood Cliffs, 1991.

[Miu92] T. Miura, Nesting quantification in a visual data manipulation language. In [ER'92], 226-242.

[MiW87] M. Missikoff and G. Wiederhold, Towards a unified approach for expert and database systems. In: Expert database systems ( ed. L. Kerschberg), Ben­jamin/Cummings, Menlo Park, 1987, 383-399.

[MMA89] J. Mayne, L. McAfee, and T. J. Teorey, An application of entity­relationship data modeling techniques to the automated manufacturing process. IEEE Int. Conf. on Data and Knowledge Engineering 2, 1989.

[MML93] E. Metais, J.-N. Meunier, and G. Leverau, Database schema design: A perspective from natural language techniques to validation and view integration. In [ER'93], 190-205.

References 597

[MMR85] J. A. Makowsky, V. M. Markowitz, and N. Rotics, Entity-relationship consistency for relational schemes. Technical Report 392, Technion, Haifa, 1985.

[MMS79] D. Maier, A. 0. Mendelzon, andY. Sagiv, Testing implications of data dependencies. ACM TODS, 4(4), 1979, 455-469.

[MMT86] A. Malhotra, H. M. Markowitz, Y. Tsalalikhin, D. P. Pazel, and L. M. Burns, An entity-relationship programming language. IBM, TR RC 11816, 1986.

[MoB81] A. Motro and P. Buneman, Construction superviews. Proc. 1981 ACM SIGMOD Int. Conf. on the Management of Data - SIGMOD'81 (ed. Y. E. Lien), Ann Arbor, Michigan, 1981, ACM Press, New York, 1981, 55-64.

[MoE96] W. Y. Mok and D. W. Embley, Transforming conceptual models to object-oriented database designs: Practicalities, properties, and peculiarities. In [ER'96], 309-324.

[Mok97] W. Y. Mok, On keys and normal forms. IPL, 62(5), 1997, 255-258. [Mon86] D. E. Monarchi, The representation of rules in the ER model. Rocky

Mountain Conf. on AI, 1986. [Moo96] D. L. Moody, Graphical entity relationship models: Towards a more user

understandable representation of data. In [ER'96], 227-244. [MoS94] D. L. Moody and G. G. Shanks, What makes a good data model? Evalu­

ating the quality of entity-relationship models. In [ER'94], 94-111. [Mot87] A. Motro, Superviews: Virtual integration of multiple databases. IEEE

TSE, 13(7), 1987, 785-798. [MoY90] A. Motro and Q. Yuan, Querying Database Knowledge. Proc. 1990 ACM

SIGMOD Int. Conf. on Management of Data - SIGMOD'90 (eds. H. Garcia­Molina, H. V. Jagadish), Atlantic City, New Jersey, 1990, ACM Press, New York, SIGMOD Record, 19(2), 1990, 173-183.

[MRS85] D. Maier, D. Rozenshtein, and J. Stein, Representing roles in universal scheme interfaces. IEEE TSE, 11(7), 1985, 644-652.

[MRW84] D. Maier, D. Rozenshtein, and D. S. Warren, Window functions. Oregon Grad. Ctr., TR-CSE-84-002, 1984.

[MS086] D. Maier, J. Stein, A. Ottis, and A. Purdy, Development of an object­oriented DBMS. Proc. Conf. on Object-Oriented Programming Systems, Lan­guages, and Applications OOPSLA'86 (ed. N. K. Meyrowitz), Portland, Ore­gon, 1986, SIGPLAN Notices, 21(11), 1986, 472482.

[MSY81] D. Maier, Y. Sagiv, and M. Yannakakis, On the complexity of testing implications of functional and join dependencies. JACM, 28( 4), 1981, 680-695.

[NaE89] S. B. Navathe and R. Elmasri, Fundamentals of database systems. Ben­jamin/Cummings, Redwood City, 1989.

[NaP88] S. B. Navathe and M. K. Pillalamarri, 00-ER: Toward making the E-R approach object-oriented. In [ER'88], 185206.

[NaR89] S. B. Navathe and M. Ra, Vertical partitioning for database design: A graphical algorithm. Proc. 1989 ACM SIGMOD Int. Conf. on Management of Data SIGMOD'89 (eds. J. Clifford, B. G. Lindsay, D. Maier), Portland, Oregon, 1989, SIGMOD Record, 18(2), ACM Press, New York, 1989, 440-450.

[NaS78] S. B. Navathe and M. Schkolnick, View representation in logical database design. Proc. 1978 ACM SIGMOD Conf. on the Management of Data - SIG­MOD'78 (eds. E. I. Lowenthal, N. B. Dale), Austin, Texas, 1978, ACM Press, New York, 144-156.

[Nav80] S. B. Navathe, An intuitive approach to normalize network structured data. Proc. 6th Int. Conf. on Very Large Databases- VLDB'80, Montreal, Que­bec, 1980, IEEE-CS, New York, 1980, 350-358.

[Nav85] S. B. Navathe, Schema implementation and restructuring. In: Principles of database design, Volume 1: Logical organizations (ed. S. B. Yao), Prentice Hall, Englewood Cliffs, 1985, 361396.

598 References

[NDT88] G. M. Nijssen, D. J. Duke, and S.M. Twine, The entity-relationship data model considered to be harmful. Preprint University of Queensland, Dept. of Computer Science, 1988.

[Nei94] P. O'Neil, Database principles, programming, performance. Morgan Kauf­mann, Los Altos, 1994.

[NEL86] S. B. Navathe, R. Elmasri, and J. A. Larson, Integrating user views in database design. IEEE Computer, 19(1), 1986, 50-62.

[Neu96] K. Neumann, Datenbanktechnik fiir Anwender. Hanser, Miinchen, 1996. [Ngu89] A. H. H. Ngu, Conceptual transaction modeling. IEEE TKDE, 1(4), 1989,

508-518. [Nic78] J.-M. Nicolas, First-order logic formalization for functional, multivalued

and mutual dependencies. Proc. 1978 ACM SIGMOD Int. Conf. on Management of Data- SIGMOD'78, Austin, Texas, 1978, ACM Press, New York, 1978, 40-46.

[NiD83] J.-M. Nicolas and R. Demolombe, On the stability of relational queries. Proc. Workshop on Logical Data Bases, Toulouse, 1982.

[NiH89] G. M. Nijssen and T. A. Halpin, Conceptual schema and relational database design- a fact oriented approach. Prentice Hall, New York, 1989.

[Nil87] J. F. Nilsson, w-order knowledge bases. Technical University of Denmark, Dept. of Computer Science, Lyngby, TR - 1987 - 32, 1987.

[NiY78] J.-M. Nicolas and K. Yazdanian, Integrity checking in deductive data bases. Proc. Logic and Data Bases, Symp. on Logic and Databases, Advances in Data Base Theory- ADBT'77(eds. H. Gallaire, J. Minker), Toulouse, 1977, Plenum Press, New York, 1978, 325344.

[NNJ93] B. Narasimhan, S. B. Navathe, and S. Jayaraman, On mapping ER and relational models into 00 schemas. In [ER'93], 402-413.

[Nor93] M. C. Norrie, An extended entity-relationship approach to data manage­ment in object-oriented systems. In [ER'93], 390-401.

[NoW94] M. C. Norrie and M. Wunderli, Coordination system modeling. In [ER'94], 474-490.

[NRT83] K. K. Nambiar, T. Radhakrishnan, and V. G. Tikeka.r, Representation of functional dependencies in relational databases using linear graphs. TCS, 24(2), 1983, 143-159.

[NSW96] M. C. Norrie, A. Steiner, A. Wiirgler, and M. Wunderli, A model for classification structures with evolution control. In [ER'96], 456-471.

[NTD91] 0. Nierstrasz, D. Tsichritzis, V. De Mey, and M. Stadelmann, Objects +scripts =applications. In: Object Composition (ed. D. Tsichritzis), Geneva University, Computer Science Dept., 1991, 11-29.

[Obe88] A. Oberweis, Checking database integrity constraints while simulating in­formation system behavior. Proc. 9th European Workshop on Applications and Theory of Petri Nets, Venice, 1988, 299-308.

[Obe90] A. Oberweis, Time structures for information systems. PhD Thesis, Uni­versity Mannheim, 1990 (In German).

[OhN95] Y.-C. Oh and S. Navathe, SEER: Security enhanced entity-relationship model for secure relational databases. In [ER'95], 170-180.

[Oho90] A. Ohori, Semantics of types for database objects. TCS, 76(1), 1990, 53-92. [01178] T. W. Olle, The Codasyl approach to data base management. John Wiley

& Sons, New York, 1978. [Ore85] 0. Oren, Integrity constraints in the conceptual schema language SYS­

DOC. In [ER'85], 270-278. [Orm84] L. Orman, Nested set languages for functional databases. Information

Systems, 9(3), 1984, 241-249. [OrS96] E. Ortner and B. Schienmann, Normative language approach- A frame­

work for understanding. In [ER'86], 261-276.

References 599

[Ort93] E. Ortner, KASPER - Konstanzer Sprachkritik-Programm fiir das Software-Engineering. Universitat Konstanz, lnformationswissenschaft, Bericht 36-93, 1993.

[Ort94] E. Ortner, MELCHIOS - Methodenneutrale Konstruktionssprache fiir ln­formationssysteme. Universitat Konstanz, lnformationswissenschaft, Bericht 60-94, 1994.

[OsY85] Z. M. Oszoyoglu and L. Y. Yuan. A normal form for nested relations. Proc. 4th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems PODS'85, Portland, Oregon, ACM Press, New York, 1985, 251-260.

[PaC93] K. Parsaye and M. Chignell, Intelligent database tools and applications. John Wiley & Sons, New York, 1993.

[PaP80] D. S. Parker and K. Parsaye-Ghomi, Inferences involving embedded mul­tivalued dependencies and transitive dependencies. Proc. 1980 ACM SIGMOD Int. Conf. on Management of Data - SIGMOD'80 (eds. P. P. Chen, R. C. Sprowls), Santa Monica, California, 1980, ACM Press, New York, 1980, 52-57.

[Pap86] C. H. Papadimitriou, The theory of database concurrency control. Com­puter Science Press, Rockville, 1986.

[Par78] J. Paredaens, On the expressive power of relational algebra. IPL 7(2), 1978, 107-111.

[Par80a] J. Paredaens, The interaction of integrity constraints in an information system. Journal of Computer and System Sciences, 20(3), 1980, 310-327.

[Par80b] J. Paredaens, Transitive dependencies in a database scheme. RAIRO In­form., 14(1), 1980, 149-165.

[Par82a] J. Paredaens, A universal formalism to express decompositions, functional dependencies and other constraints in a relational data base. TCS, 19(2), 1982, 143-163.

[Par82b] A. Parkin, Data analysis and system design by entity-relationship mod­eling. The Computer Journal, 25(4), 1982, 401-409.

[PaS85] C. Parent and S. Spaccapietra, An algebra for a general entity-relationship model. IEEE TSE, 11(7), 1985, 634-643.

[PaS86] C. Parent and S. Spaccapietra, Enhancing the operational semantic of the entity-relationship model. In: Data semantics (DS-1) (eds. T. B. Steel, Jr., R. Meersman), Proc. IFIP WG 2.6 Working Conf. on Data Semantics DS-1, Hasselt, North-Holland, Amsterdam, 1986, 159-173.

[PaS89] C. Parent and S. Spaccapietra, Complex objects modelling: An entity­relationship approach. In: Nested Relations and Complex Objects (eds. S. Abite­boul, P. C. Fischer, H.-J. Schek), Proc. Workshop Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1987, LNCS 361, Springer, Berlin, 1989, 272-296.

[PaV88] J. Paredaens and D. Van Gucht, Possibilities and limitations of using flat operators in nested algebra expressions. Proc. 7th ACM SIGACT-SIGMOD­SIGART Symp. on Principles of Database Systems - PODS'88, Austin, Texas, ACM Press, New York, 1988, 29-38.

[Paw73] Z. Pawlak, Mathematical foundations of information retrieval. CC PAS Reports 101, Warszawa, 1973.

[Paw82] Z. Pawlak, Rough sets. Int. Journal of Computer and Information Sciences, 11, 1982, 341-356.

[PBH90] B. W. Porter, R. Bareiss, and R. C. Holte, Concept learning and heuristic classification in weak-theory domains. AI, 45(1-2), 1990, 229-263.

[PCK89] K. Parsaye, M. Chignell, S. Khoshafian, and H. Wong, Intelligent databases: Object-oriented deductive hypermedia technologies. John Wiley & Sons, New York, 1989.

600 References

[PDG89) J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht, The structure of the relational database model. Springer, Berlin, 1989.

[PeM88) J. Peckam and F. Maryanski, Semantic data models. ACM Computing Surveys, 20(3), 1988, 153-189.

[Pen97) N. Pendse, The OLAP report. Available through www.olapreport.com, 1997.

[Pe093) R. J. Peters and M. T. Ozsu, Reflection in a uniform behavioral object model. In [ER'93J, 34-45.

[Pet89) S. V. Petrov, Finite axiomatization of languages for representation of sys­tem properties: Axiomatization of dependencies. Information Sciences, 47, 1989, 339-372.

[PiC90) J. V. Pitt and R. J. Cunningham, Attributed translation and the semantics of natural language. In: Attribute Grammars and their Applications ( eds. P. Deransart, M. Jourdan), Proc. Int. Conf. WAGA, Paris, France, 1990, LNCS 461, Springer, Berlin, 1990,

[Pin93) M. Pinkal, Semantikformalismen fiir die Sprachverarbeitung. Universitiit des Saarlandes, CLAUS-Report Nr. 26, Saarbriicken, 1993.

[Pin94) B. Pintemagel, ER Interface fiir Datenbank-Programmiersprachen. Di­plomarbeit, Universitiit Rostock, Fachbereich Informatik, 1994.

[PIP97) 0. Pastor Lopez, E. Insfm, V. Pelechano, J. Romero, and J. Merseguer, 00-method, An 00 software production environment combining conventional and formal methods. In [CAiSE'97], 145-158.

[PKB94) M. P. Papazoglou, B. J. Kramer, and A. Bouguettaya, On the represen­tation of objects with polymorphic shape and behavior. In [ER'94), 223-240.

[PoD93) L. F. Pollacia and L. M. L. Delcambre, The object flow model: A formal framework for describing the dynamic construction, destruction and interaction of complex objects. In [ER'93J, 1-12.

[PoH92) A. Poetzsch-Heffter, Identification as programming language principle. Technical Report Number TUM-19223, Institut fiir Informatik der Technischen Universitiit Miinchen, 1992.

[Pro96) H. A. Proper, Data schema design as a schema evolution process. Technical Report Number FIT-TR-96-02, Queensland University of Technology, Faculty of Information Technology, 1996.

[PRY89) C. Parent, C. Rolin, K. Yetongnon, and S. Spaccapietra, An ER calculus for the entity-relationship complex model. In [ER'89J, 361-384.

[PuS97) S. Purao and V. C. Storey, Intelligent support for retrieval and synthesis of pattems for object-oriented databases. In [ER'97], 30-42.

[PWT93) G. Pemul, W. Winiwarter, and AM. Tjoa, The entity-relationship model for multilevel security. In [ER'93J, 166-177.

[Qua86) P. T. Quang, Merise: A french methodology for information system anal­ysis and design. Journal of Systems Management, 1986, 21-24.

[Qui53) W. V. Quine, From a logical point of view. Cambrigde Press, Mass., 1953. [RaC89) S. Ram and S. M. Curran, An automated tool for relational database

design. Information Systems, 14(3), 1989, 247-259. [Rad92) K. Radermacher, Abstraction techniques in semantic modeling. Proc. 2nd

European-Japanese Seminar on Information Modeling and Knowledge Bases, Tampere, 1992.

[RaS92a) 0. Rauh and E. Stickel, Entity tree clustering- A method for simplifying ER designs. In [ER'92), 62-78.

[RaS92b) 0. Rauh and E. Stickel, Beziehungsprobleme: Zur Quantifizierung von Beziehungsarten im ER-Modell. IT 1992, 6.

[RaS93) 0. Rauh and E. Stickel, Searching for compositions in ER schemes. In [ER'93), 7 4-84.

References 601

[Rat97] Rational Software Corporation, Unified modeling language, versiOn 1.1. http:/ /www.rational.com/uml/resources/ documentation, 1997.

[RBF86] D. S. Reiner, G. Brown, M. Friedell, J. Lehman, R. McKee, R. Rheingans, and A. Rosenthal, A database designer's workbench. In [ER'86], 347-360.

[RCR93] J. F. Roddick, N. G. Craske, and T. J. Richards, A taxomony for schema versioning based on the entity relationship models. In [ER'93], 137-148.

[ReG94] M. Reingruber and W. W. Gregory, The data modeling handbook. John Wiley & Sons, New York, 1994.

[Reg96] J.-C. Regin, Generalized arc consistency for global cardinality constraint. Proc. 13th National Conf. on Artificial Intelligence and the 8th Innovative Ap­plications of Artificial Intelligence Conf., AAAI Press/MIT Press, 1996, 209-215.

[Rei78] R. Reiter, On closed world databases, Proc. Logic and Databases, Symp. on Logic and Data Bases, Advances in Data Base Theory - ADBT'77 ( eds. H. Gallaire, J. Minker), Toulouse, 1977, Plenum Press, New York, 1978, 55-76.

[Rei84] H. Reichel, Structural induction on partial algebras. Akademie-Verlag, Berlin, Mathematical research, Vol. 18, 1984.

[Rei88] R. Reiter, On integrity constraints. Proc. 2nd Conf. on Theoretical Aspects of Reasoning About Knowledge (ed. M. Y. Vardi), Pacific Grove, CA, 1988, Morgan Kaufmann, Los Altos, 1988, 97-111.

[Rei92] R. Reiter, On formalizing database updates: Preliminary report. Proc. Ad­vances in Database Technology EDBT'92 (eds. A. Pirotte, C. Delobel, G. Got­tlob), 3rd Int. Conf. on Extending Database Technology, Vienna, 1992, LNCS 580, Springer, Berlin/New York, 1992, 10-20.

[Rei96] J. Reinert, Ein Regelsystem zur lntegritatssicherung in aktiven relationalen Datenbanksystemen. Infix, Sankt Augustin, 1996.

[Ren60] A. Renyi, A new fundamental problem of information theory. Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl., 1960, 10, 251-282 (In Hungarian).

[Ren93] M. Rennhackkamp, Unconvential referential constraints. Database Pro­gramming and Design, 8, 1993, 55-61.

[Ris78] J. Rissanen, Theory of relations for databases - a tutorial survey. Proc. 7th Symp. Mathematical Foundations of Computer Science- MFCS'78 (ed. J. Winkowski), Zakopane, 1978, LNCS 64, Springer, Berlin, 1978, 536-551.

[Ris88] N. Rishe, Database design fundamentals. Prentice Hall, Englewood Cliffs, 1988.

[Ris93] N. Rishe, A methodology and tool for top-down relational database design. DKE, 10, 1993, 259-291.

[RKB87] M. A. Roth, H. F. Korth, and D. S. Batory, SQL/NF: A query language for nonlNF relational databases. Information Systems, 12(1), 1987, 99-114.

[RKS85] M.A. Roth, H. F. Korth, and A. Silberschatz, Extended algebra and cal­culus for non-lNF relational databases. Revised Technical Report 84-36, Com­puter Science Dept., University of Austin, 1985.

[RMN90] A. Rochfeld, J. Morejon, and P. Negros, Inter-relationship links in E-R models. In [ER'90], 143-156.

[RoC88] T. R. Rogers and R. G. G. Catell, Entity-relationship user interfaces. IEEE Data Engineering Bulletin, 11(2), 1988, 44-53.

[Rod92] J. F. Roddick, Schema evolution in database systems- An annotated bib­liography. SIGMOD Record, 21(4), 1992, 35-40.

[RoP92] C. Rolland and C. Proix, A natural language approach for requirements engineering. In [CAiSE'92], 257-277.

[RoR89] A. Rosenthal and D. S. Reiner, Database design tools: Combining theory, guesswork, and user interaction. In [ER'89], 187-201.

[RoR94] A. Rosenthal and D. S. Reiner, Tools and transformations -rigorous and otherwise- for practical database design. ACM TODS, 19(2), 1994, 167-211.

602 References

[RoS87] L.A. Rowe and M. R. Stonebreaker, The POSTGRES Data Model. Proc. 13th Int. Conf. on Very Large Data Bases VLDB'87 (eds. P. M. Stocker, W. Kent, P. Hammersley), Brighton, UK, 1987, Morgan Kaufmann, San Mateo, 1987, 83-96.

[RoS93] E. Rose and A. Segev, TOOSQL - A temporal object-oriented query lan­guage. In [ER'93], 122-136.

[RoT95] M. Roll and B. Thalheim, The surplus value service system FOKUS. INF0'95, Information technologies for trade, industry and administration, Pots­dam, 1995, 355-366 (In German).

[RPC93] I. Ramos Salavert, 0. Pastor Lopez, J. Cuevas, and J. Devesa, Objects as observable processes. Proc. 4th Int. Workshop on the Deductive Approach to Information Systems and Databases, DAISD'1993 (ed. A. Olive), Sept. 1993, Lloret de Mar, 51-72.

[Run94] N. Runge, Scheme transformations on the basis of optimizing combina­tions of partially applicable elementary transformation methods. PhD Thesis, Karlsruhe University, Computer Science Dept., Shaker Verlag, Aachen, 1994.

[RWB93] P. Rosengren, U. Wingstedt, M. Bem, and P. Kool, ER-based information retrieval in a mixed database environment. In [ER'93], 426-437.

[Saa88] G. Saake, Spezifikation, Semantik und Uberwachung von Objektlebens­liiufen in Datenbanken. PhD Thesis, Technische Universitiit Braunschweig, lnformatik-Skripte 20, 1988.

[Saa91] G. Saake, Descriptive specification of database object behavior. DKE, 6, 1991, 4773.

[Sac85] D. Sacca, Closures of Database Hypergraphs. JACM, 32( 4), 1985, 774-803. [Sae95] M. Saeki, Object-oriented meta modeling. In [ER'95], 250-259. [Sag83] Y. Sagiv, A characterization of globally consistent databases and their

correct access paths. ACM TODS, 8(2), 1983, 266-286. [Sak79] H. A. Sakai, A unified approach to the logical design of a hierarchical data

model. In [ER'79], 61-74. [Sak83a] H. A. Sakai, Entity-relationship approach to logical database design. In

[ER'83], 155-187. [Sak83b] H. A. Sakai, A method for entity-relationship behavior modeling. In

[ER'83], 111-129. [SaK88] F. Sadri and R. A. Kowalski, A theorem-proving approach to database

integrity. In [Min88], 313-362. [SaT95] P. C. Saxena and B. K. Tyagi, Fuzzy functional dependencies and indepen­

dencies in extended fuzzy relational database models. Fuzzy Sets and Systems, 69(1), 1995, 65-89.

[SaU82] F. Sadri and J.D. Ullman, Template dependencies: A large class of depen­dencies in relational databases and its complete axiomatization. JACM, 29(2), 1982, 363-372.

[Sau90] D. Saunders, Normalisation, constraints and modeling. Technical Report, Queen Mary College, Dept. of Computer Science, QMW-DCS-1990-518, 1990.

[Saw82] Y. Sagiv and S. Walecka, Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies. JACM, 29(1), 1982, 103-117.

[Sch60] K. Schutte, Beweistheorie. Springer, Berlin, 1960. [Sch77] J. W. Schmidt, Some high level language constructs for data of type rela­

tion. ACM TODS, 2(3), 1977, 247-261. [Sch78] M. Schkolnick, A survey of physical database design methodology and tech­

niques. Proc. 4th Int. Conf. on Very Large Databases- VLDB'78 (ed. S. B. Yao), Berlin, 1978, IEEE-CS, New York, 474-487.

References 603

[Sch91] A.-W. Scheer, Principles of efficient information management. Springer, Berlin, 1991.

[Sch94] K.-D. Schewe, The specification of data-intensive application systems. Ad­vanced PhD Thesis, Brandenburg University of Technology at Cottbus, 1994.

[Sch95] K.-D. Schewe, Specification and development of correct relational database programs. Technical Report, TU Clausthal, 1995.

[Sch96] B. Schewe, Kooperative Softwareentwicklung. Deutscher Universitiits­Verlag, Wiesbaden, 1996.

[Sch98a] T. Schmidt, Requirements, concepts, and solutions for the development of a basic technology of information services - The client. Master Thesis, Bran­denburg University of Technology at Cottbus, 1998 (In German).

[Sch98b] R. Schwietzke, Requirements, concepts, and solutions for the development of a basic technology of information services - The server. Master Thesis, Bran­denburg University of Technology at Cottbus, 1998 (In German).

[Sci81] E. Sciore, Real-world MVD's. Proc. 1981 ACM SIGMOD Int. Conf. on the Management of Data- SIGMOD'81 (ed. Y. E. Lien), Ann Arbor, Michigan, 1981, ACM Press, New York, 1981, 121-132.

[Sci82a] E. Sciore, A complete axiomatization for full join dependencies. JACM, 29(2), 1982, 373-393.

[Sci82b] E. Sciore, Inclusion dependencies and the universal instance. Technical report 82/041, SUNY at Stony Brook, Dept. of Comp. Sci., 1982.

[Sci89] E. Sciore, Object specialization. ACM TODS, 7(2), 1989, 103-122. [Sci91] E. Sciore, Abbreviation techniques for entity-relationship query languages.

In [ER'91], 129-145. [Sci94] E. Sciore, Query abbreviation in the entity-relationship model. Information

Systems, 19(6), 1994, 491-511. [ScM90] J. W. Schmidt and F. Matthes, Language technology for post-relational

data systems. Proc. Database Systems of the 90s (ed. A. Blaser), Int. Symp., Miiggelsee, Berlin, 1990, LNCS 466, Springer, Berlin, 1990, 81-114.

[ScM91] J. W. Schmidt and F. Matthes, Modular and rule-based database pro­gramming in DBPL. University of Glasgow, Dept. of Computing Science, FIDE­report/91/15, 1991.

[ScS83] G. Schlageter and W. Stucky, Datenbanksysteme: Konzepte und Modelle. Teubner, Stuttgart, 1983.

[ScS84] H.-J. Schek and M. H. Scholl, An algebra for the relational model with relation-valued attributes. Technical report DVSI-1984-T1, Technical University of Darmstadt, 1984.

[ScS90] H. J. Schek and M. H. Scholl, Evolution of data models. Proc. Database Systems of the 90s (ed. A. Blaser), Int. Symp., Miiggelsee, Berlin, 1990, LNCS 466, Springer, Berlin, 1990, 135-153.

[ScS95] I. Schmitt and G. Saake, Managing object identity in federated database systems. In [ER'95], 400-411.

[ScS96a] K.-D. Schewe and B. Schewe, View-centered conceptual modeling - An object oriented approach. In [ER'96], 357-371.

[ScS96b] I. Schmitt and G. Saake, Integration of inheritance trees as part of view generation for database federations. In [ER'96], 195-210.

[ScS97] I. Schmitt and G. Saake, Merging inheritance hierarchies for schema inte­gration based on concept lattices. Technical report, Dept. of Computer Science, University Magdeburg, UNIMD-CS-97-6, 1997.

[ScT89] J. W. Schmidt and C. Thanos (eds.), Foundations of knowledge base man­agement. Topics in Information Systems, Springer, Berlin, 1989.

[ScT93] K.-D. Schewe and B. Thalheim, Fundamental concepts of object oriented databases. Acta Cybernetica, 11(4), 1993, 4981.

604 References

[SCT95] G. Saake, S. Conrad, and C. Tiirker, From object specification towards agent design. In [ER'95], 329-340.

[ScT96] K.-D. Schewe and B. Thalheim, Active consistency enforcement for re­pairable database transitions. Proc. 6th Int. Workshop on Foundations of Mod­els and Languages for Data and Objects, Integrity in Databases (eds. S. Conrad, H.-J. Klein, K.-D. Schewe), Technical University Magdeburg, 1996, Preprint 4/1996, 87102.

[ScT98a] K.-D. Schewe and B. Thalheim, On the strength of rule triggering sys­tems for integrity maintenance. Pro c. Database Systems ( ed. C. McDonald), 9th Australasian Database Conf.- ADC'98, Australian Computer Science Commu­nications, 20(2), 1998, 77-88.

[ScT98b] K.-D. Schewe and B. Thalheim, Limitations of rule triggering systems for integrity maintenance in the context of transition specification. Acta Cybernet­ica, 13, 1998, 277-304.

[ScT98c] K.-D. Schewe and B. Thalheim, Readings in object-oriented databases. Preprint I-10/1998, Cottbus Technical University, Computer Science Institute, 1998.

[ScT99a] K.-D. Schewe and B. Thalheim, Towards a theory of consistency enforce­ment. Acta Informatica, 36, 1999, 97-141.

[ScT99b] K.-D. Schewe and B. Thalheim, A generalization of Dijkstra's calculus to typed program specifications. Proc. Fundamentals of Computation Theory, 12th Int. Symp. on Fundamentals of Computation Theory - FCT'99 (eds. G. Ciobanu, G. Paun), lasi, Romania, 1999, LNCS 1684, Springer, Berlin, 1999, 463-474.

[SDP81] Y. Sagiv, C. Delobel, D. S. Parker, and R. Fagin, An equivalence between relational database dependencies and a fragment of propositional logic. JACM, 28(3), 1981, 435-453.

[SeE91] A. Sernadas and H.-D. Ehrich, What is an object, after all? Proc. Object­Oriented Databases: Analysis, Design & Construction - DS-4, IFIP TC2/WG 2.6 Working Conf. on Object-Oriented Databases: Analysis, Design & Con­struction (eds. R. Meersman, W. Kent, S. Khosla), Windermere, UK, 1990, North-Holland, Amsterdam, 1991, 39-69.

[SeT88] 0. Seleznjev and B. Thalheim, On the number of minimal keys in relational databases over nonuniform domains. Acta Cybemetica, 8(3), 1988, 267-271.

[SeT96a] 0. Seleznjev and B. Thalheim, Random databases and keys. Technical University Cottbus, Research Report, 1-11, 1996, 1-15.

[SeT96b] 0. Seleznjev and B. Thalheim, Applying poisson approximation to database theory. Proc. 4th Bernoulli Congress, abstracts, Vienna, 1996, 425.

[SeT98] 0. Seleznjev and B. Thalheim, Behavior of keys in random databases. Proc. SCCC'98, Antofagasta, Chile, 1998, 171-183.

[Sha81] M. J. R. Shave, Entities, functions, and binary relations: Steps to a con­ceptual schema. The Computer Journal, 24(1), 1981, 42-47.

[Sha92] D. E. Shasha, Database tuning-a principle approach. Prentice Hall, Engle­wood Cliffs, 1992.

[She88] J. C. Shepherdson, Negation in logic programming. In [Min88], 19-88. [Shl91] D.-G. Shin and K. B. Irani, Fragmenting relations horizontally using a

knowledge-based approach. IEEE TSE, 17(9), 1991, 872-883. [Sho85] P. Shoval, Essential information structure diagrams and database schema

design. Information Systems, 10( 4), 1985, 417-423. [Sho86] R. C. Shock, Computing the minimum cover of functional dependencies.

IPL, 22(3), 1986, 157-159. [Sho91a] P. Shoval, An integrated methodology for functional analysis process de­

sign and database design. Information Systems, 16(1), 1991, 49-64.

References 605

[Sho91b] P. Shoval, One-to-one dependencies in database design. IEEE TKDE, 3(3), 1991, 371-379.

[Sho96] P. Shoval, A tool for mapping binary relationship diagrams to object ori­ented database schemas. Proc. Workshop ER Case Tools, Research Track (track of ER'96) ( eds. B. Thalheim, S. Yigitbasi), Cottbus, 1996, BTU Cottbus, 43-52.

[Sho97] A. Shoshani, OLAP and statistical databases: Similarities and differences. Proc. 16th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems - PODS'97, Tucson, Arizona, 1997, ACM Press, New York, 1997, 185-196.

[SIG97] L. Silverston, W. H. Inmon, and K. Graziano, The data model resource book. John Wiley & Sons, New York, 1997.

[Sii96] H. Siirtola, Managing large entity-relationship diagrams. Proc. Workshop ER Case Tools, Research Track of ER'96 (eds. B. Thalheim, S. Yigitbasi), Cottbus, 1996, BTU Cottbus, 29-42.

[Sim94] G. Simsion, Data modeling essentials. Van Nostrand Reinhold, New York, 1994.

[Sin88] E. J. Sinz, The structured entity-relationship model. Angewandte lnfor­matik, 30(5), 1988, 191-202 (In German).

[SJB92] W. W. Song, P. Johannesson, and J. A. Bubenko, Jr., Semantic similarity relations in schema integration. In [ER'92], 97-120.

[SLC96] A. Soares da Silva, A. H. F. Laender, and M.A. Casanova, An approach to maintaining optimized relational representations of entity-relationship schemas. In [ER'96], 292-308.

[SLT90] M. H. Scholl, C. Laasch, and M. Tresch, Updateable views in object­oriented databases. Report ETH Ziirich, Dept. of Computer Science, 150, 1990.

[Smi78] J. M. Smith, A normal form for abstract syntax. Proc. 4th Int. Conf. on Very Large Databases- VLDB'78 (ed. S. B. Yao), West Berlin, 1978, 156-162.

[Smi85] H. C. Smith, Database design: Composing fully normalized tables from a rigorous dependency diagram. CACM, 28(8), 1985, 826-838.

[SmS77] J. M. Smith and D. C. P. Smith, Database abstractions: Aggregation and generalization. ACM TODS, 2(2), 1977, 105-133.

[SoJ93] 1.-Y. Song and T. H. Jones, Analysis of binary relationships within ternary relationships in ER modeling. In [ER'93], 271-282.

[SoK93] A. S!Z)lvberg and D. C. Kung, Information systems engineering. Springer, Berlin, 1993.

[Sol78] N. A. Solovjev, Tests, stuctures and applications. Nauka, Novosibirsk, 1978 (In Russian).

[Son95] W.W. Song, Integration principles, methods and applications. PhD The­sis, Dept. of Computer and Systems Sciences, Royal Institute of Technology, Stockholm, Sweden, 1995.

[Sou96] C. Soutou, Extracting n-ary relationships through database reverse engi-neering. In [ER'96], 392-405. .

[Spa91] S. Spaccapietra, Cooperative database design. Proc. 17th Int. Conf. on Very Large Data Bases - VLDB'91 (eds. G. M. Lohman, A. Sernadas, R. Camps), Barcelona, Catalonia, 1991, Morgan Kaufmann, San Francisco, 1991, 315-316. .

[SpC89] F. N. Springsteel and P. J. Chuang, ERDDS: An intelligent E-R based database design system, yielding normal forms under extended regularity. Proc. Entity-Relationship Approach: A Bridge to the User (ed. C. Batini), 7th Int. Conf. on the Entity-Relationship Approach, Rome, 1988, North-Holland, Ams­terdam, 1989, 349-368.

[Spe28] E. Sperner, Ein Satz iiber Untermengen einer endlichen Menge. Mathema­tische Zeitschrift, 27, 1928, 544-548.

606 References

[Spe80] S. H. Spewak, A pragmatic approach to database design. Proc. 6th Int. Conf. On Very Large Data Bases - VLDB'80, Montreal, Quebec, IEEE-CS, 1980, 151-152.

[SpP89] S. Spaccapietra and C. Parent, View integration: a step forward. Reports Lausanne University, 1989.

[Spy82] N. Spyratos, A homomorphism theorem for data base mappings. IPL, 15(11 ), 1982, 91-96.

[SSS92] K.-D. Schewe, J. W. Schmidt, D. W. Stemple, B. Thalheim, and I. Wetzel, Generating methods to assure global integrity. Rostocker Informatik-Berichte, 14, 1992.

[SST94] K.-D. Schewe, D. W. Stemple, and B. Thalheim, Higher-level genericity in object-oriented databases. Proc. 6th Int. Conf. on Management of Data -COMAD'94 (eds. S. Chakravarthy, P. Sadanandan), Bangalore, 1994.

[SST95] B. Schewe, K.-D. Schewe, and B. Thalheim, Object-oriented design of data intensive business information systems. Informatik-Forschung und Entwicklung, 10(3), 1995, 115-127 (In German).

[SST98] B. Schewe, K.-D. Schewe, and B. Thalheim, Codesign of structures, pro­cesses, and interfaces for large-scale reactive Information Systems. Proc. 17th Int. Conference on Conceptual Modeling- ER'98, Tutorial, Singapore, 1998.

[SSW79] P. Scheuermann, G. Schiffner, and H. Weber, Abstraction capabilities and invariant properties of modeling within the entity-relationship approach. In [ER'79J, 121-140.

[SSW92] K.-D. Schewe, J. W. Schmidt, and I. Wetzel, Identification, genericity and consistency in object-oriented databases. In [ICDT'92], 341-356.

[Ste96] M. Steeg, The conceptual database design optimizer CoDO - concepts, im­plementation, application. In [ER'96J, 105-120.

[StG88] V. C. Storey und R. C. Goldstein, A methodology for creating user views in database design. ACM TODS, 13(3), 1988, 305-338.

[STH90] R. Spencer, T. J. Teorey, and E. Hevia, ER standards proposal. In [ER'90], 405-412.

[Sto75] M. Stonebraker, Implementation of integrity constraints and views by query modification. Proc. 1975 ACM SIGMOD Int. Conf. on the Management of Data - SIGMOD'75 (ed. W. F. King), San Jose, California, ACM Press, New York, 65-78.

[Sto91] V. C. Storey, Relational database design based on the entity-relationship model. DKE, 7, 1991, 47-83.

[Sto93] V. C. Storey, Understanding semantic relationships. The VLDB Journal, 2( 4)' 1993, 455-488.

[StP84] A. A. Stognij and W. W. Pasitschnik, Relational database models. Institut Kibernetiki, Kiev, 1984 (In Russian).

[StS90] D. W. Stemple and T. Sheard, Construction and calculus of types for database systems. In: Advances in Database Programming Languages (eds. F. Bancilhon, P. Buneman), Addison-Wesley, New York, 1990, 3-22.

[StS91] D. W. Stemple and T. Sheard, A recursive base for database programming primitives. Proc. Next Generation Information System Technology (eds. J. W. Schmidt, A. A. Stognij), 1st Int. East/West Data Base Workshop, Kiev, 1990, LNCS 504, Springer, Berlin, 1991, 311-332.

[STS93] K.-D. Schewe, B. Thalheim, J. W. Schmidt, and I. Wetzel, Integrity En­forcement in Object-Oriented Databases. Proc. Modelling Database Dynamics, selected papers from the 4th Int. Workshop on Foundations of Models and Lan­guages for Data and Objects- FoMLaD0'92 (eds. U. W. Lipeck, B. Thalheim), Volkse, 1992, Workshops in Computing, Springer, London, 1993, 174-195.

References 607

(StT71] S. J. Stephen and Y. S. Tang, An efficient algorithm for generating com­plete test sets for combinatorial logic circuits. IEEE Trans. Comput., 11, 1971, 1245-1251.

(STW91] K.-D. Schewe, B. Thalheim, I. Wetzel, and J. W. Schmidt, Extensible safe object-oriented design of database applications. University Rostock, Computer Science Dept., Preprint CS-09-91, 1991.

(STW92] K.-D. Schewe, B. Thalheim, and I. Wetzel, Foundations of object-oriented concepts. Technical Report, Computer Science Dept., Hamburg University, 1992.

(Su83] S. Y. W. Su, SAM*: A semantic association model for corporate and scientific-statistical databases. lnf. Sci., 29, 1983, 151-199.

(Su85] S. Y. W. Su, Processing-requirement modeling and its applications in logical database design. Principles of database design, Volume 1: Logical organizations (ed. S. B. Yao), Prentice Hall, Englewood Cliffs, 1985, 151-173.

(Sub87] K. Subieta, Denotational semantics of query languages. Information Sys­tems, 12(1), 1987, 69-82.

(SuL79] S. Y. W. Su and D. H. Lo, A semantic association model for conceptual database design. In (ER'79], 147-171.

(SuM86] K. Subieta and M. Missala, Semantics for the entity-relationship model. In (ER'86], 197-216.

(SUS97] V. C. Storey, H. Ullrich, and S. Sundaresan, An ontology for database design automation. In (ER'97], 2-15.

(SWL83] N. C. Shu, H. K. T. Wong, and V. Y. Lum, Forms approach to require­ments specification for database design. Proc. ACM SIGMOD Int. Conf. on Management of Data - SIGMOD'83 (eds. D. J. DeWitt, G. Gardarin), San Jose, California, ACM Press, New York, 1983, SIGMOD Record, 13(4), 1983, 161-172.

(TaC95] F. Tangorra and D. Chiarolla, A methodology for reverse engineering hier­archical databases. Information and Software Technology, 37(4), 1995, 225-231.

(TaL94] Z. Tari and X. Li, Method restructuring and consistency checking for object-oriented schemas. In (ER'94], 152-170.

(Tal97] C. L. Talcott, Composable semantic models for actor theories. Proc. Theo­retical Aspects of Computer Software, 3rd. Int. Symposium on Theoretical As­pects of Computer Software- TACS'97 (eds. M. Abadi, T. Ito), Sendai, Japan, 1997, LNCS 1281, Springer, Berlin, 1997, 321-364.

(Tar92] Z. Tari, On the design of object-oriented databases. In (ER'92], 389-405. (Tau90] B. Tauzovich, An expert system approach to database design. Proc.

Database and expert systems applications - DEXA'90 ( eds. AM. Tjoa, R. Wag­ner), Proc. Int. Conf. on Database and Expert Systems Applications, Vienna, 1990, Springer, Vienna, 1990, 322-326.

(TBe92] J. H. Ter Bekke, Semantic data modelling. Prentice Hall, London, 1992. (TCG89] L. Tucherman, M. A. Casanova, P. M. Gualandi, and A. P. Braga, A pro­

posal for formalizing and extending the generalization and subset abstractions in the entity-relationship model. In (ER'89], 27-41.

(TCY92] F. S. C. Tseng, A. L. P. Chen, and W.-P. Yang, On mapping natural language constructs into relational algebra through E-R representation. DKE, 9, 1992/93, 97-118.

(Tei95] M. Teisseire, Behavioral constraints: Why using events instead of states. In (ER'95], 123-132.

(Ten91] L. A. Tenenbaum, An open problem. Personal statement during MFDBS'91, Rostock, 1991.

(Teo89] T. J. Teorey, Database modeling and design: The entity-relationship ap­proach. Morgan Kaufmann, San Mateo, 1989.

608 References

[TFC83] L. Tucherman, A. L. Furtado, and M. A. Casanova, A pragmatic approach to structured database design. Proc. 9th Int. Conf. on Very Large Data Bases - VLDB'83 (eds. M. Schkolnick, C. Thanos), Florence, 1983, VLDB Endow­ment/Morgan Kaufmann, 1983, 219-231.

[Tha83] B. Thalheim, Decompositions in relational databases. Colloquia Mathe­matica Societatis Janos Bolyai 42; Algebra, Combinatorics and Logic in Com­puter Science, Gyor, Hungary, 1983, 811-821.

[Tha84a] B. Thalheim, Deductive basis of relations. Proc. MFSSSS 84, LNCS 215, Springer, Berlin, 226-230.

[Tha84b] B. Thalheim, A complete axiomatization of full join dependencies. Bull. EATCS, 24, 1984, 109-116.

[Tha84c] B. Thalheim, Dependencies in relational data structures. Acta Cybemet­ica, 7(1), 1984, 115-125.

[Tha85a] B. Thalheim, Abhangigkeiten in Relationen. Advanced PhD Thesis, TU Dresden, 1985.

[Tha85b] B. Thalheim, Funktionale Abhangigkeiten in relationalen Datenstruk­turen. J. Inf. Process. Cybem. ElK, 21(1/2), 1985, 23-33.

[Tha85c] B. Thalheim, Bibliographie zur Theorie der Abhangigkeiten in rela­tionalen Datenbanken, 1970-1984, TU Dresden 566/85, Dresden, 1985.

[Tha86] B. Thalheim, A review of research on dependency theory in relational databases. Proc. 9th Int. Seminar on Database Management Systems, Rein­hardtsbrunn, GDR, 1986, 136-159.

[Tha87a] B. Thalheim, Design tools for large relational database systems. In [MFDBS'87], 210-224.

[Tha87b] B. Thalheim, On the number of keys in relational databases. Proc. Fun­damentals of Computation Theory, Int. Conf. on Fundamentals of Computation Theory- FCT'87 (eds. L. Budach, R. G. Bakharajev, 0. B. Lipanov), Kazan, USSR, LNCS 278, Springer, Berlin, 1987, 448-455.

[Tha87c] B. Thalheim, Overloaded variables in many-sorted logics. Preprint 07-08-87, TU Dresden, 1987.

[Tha88a] B. Thalheim, A systematic approach to database theory. Proc. INF0'88, 1988, 158-160 (In German).

[Tha88b] B. Thalheim, Logical relational database design tools using different classes of dependencies. J. New Gener. Comput. Syst., 1(3), 1988, 211-228.

[Tha88c] B. Thalheim, Knowledge bases or data bases? In: Theoretical Founda­tions of Artificial Intelligence (eds. J. Grabowski, K.-P. Jantke, and H. Thiele), Akademie-Verlag, Berlin, 1988, 278-292.

[Tha89a] B. Thalheim, The higher-order entity-relationship model and (DB?. In [MFDBS'89], 382-397.

[Tha89b] B. Thalheim, On semantic issues connected with keys in relational databases permitting null values. J. of Information Processing and Cybemetics, ElK, 25(1/2), 1989, 11-20.

[Tha89c] A. Thayse (ed.), From modal logic to deductive databases. John Wiley & Sons, vol. 1: 1989, vol. 2: 1990.

[Tha90a] B. Thalheim, Generalizing the entity-relationship model for database modeling. J. New Gener. Comput. Syst., 3(3), 1990, 197-212.

[Tha90b] B. Thalheim, Theoretical fundamentals of the higher-order entity­relationship model. Unpublished manuscript, Kuwait, 1990.

[Tha9la] B. Thalheim, Extending the entity-relationship model for a high-level, theory-based database design. Proc. Next Generation Information System Tech­nology, 1st Int. East/West Data Base Workshop (eds. J. W. Schmidt, A. A. Stognij), Kiev, 1990, LNCS 504, Springer, Berlin, 1991, 161-184.

References 609

(Tha91b] B. Thalheim, Concepts of the database design. In: Trends in database management systems (eds. G. Vossen, K.-U. Witt), Oldenbourg, Miinchen, 1991, 1-48 (In German).

(Tha91c] B. Thalheim, Dependencies in relational databases. Teubner, Leipzig, 1991.

(Tha92a] B. Thalheim, The database design system (DB?. Database - 92. Proc. 3rd Australian Database Conf., Research and Practical Issues in Databases (eds. B. Srinivasan, J. Zeleznikow), World Scientific Publ., 1992, 279-292.

(Tha92b] B. Thalheim, HERM: Putting theory into practice. Proc. IFIP Work­shop on Database Intellectualization, Kaliningrad, 1992, Control Systems and Machines, 5/6, 1992, 85-93.

(Tha92c] B. Thalheim, Fundamentals of cardinality constraints. In (ER'92], 7-23. (Tha92d] B. Thalheim, Design with the database design system (DB?. Proc. 4th

Int. Conf. Putting into practice methods and tools for information system design (ed. H. Habrias), Nantes, France, 1992, 155-174.

(Tha92e] B. Thalheim, On the number of keys in relational and nested relational databases. Discrete Applied Mathematics, 38, 1992, 265-282.

(Tha93a] B. Thalheim, Fundamentals of database and knowledge base systems. En­cyclopedia of Computer Science and Technology (eds. A. Kent, J. G. Williams, C. M. Hall), Marcel Dekker, New York, vol. 29, 1993, 317-343.

(Tha93b] B. Thalheim, Fundamentals of Entity-Relationship Modeling. Annals of Mathematics and Artificial Intelligence, Baltzer, 7(1-4), 1993, 197-256.

(Tha93c] B. Thalheim, Semantics in entity-relationship models. Proc. Workshop Semantics of Programming Languages and Model Theory (eds. E. Borger, M. Droste, J. Gurevich), Gordon and Breach, OPA, New York, Algebra, Logic and Applications, 5, 1993, 327-361.

(Tha93d] B. Thalheim, Database design strategies. Proc. Advanced School Ad­vances in Database Theory and Applications (eds. J. Paredaens, L.A. Tenen­baum), Springer, Berlin, 1993, CISM Courses and Lectures, 347, 267-286.

(Tha94] B. Thalheim, Event-conditioned semantics in databases. In (ER'94], 171-189.

(Tha95] B. Thalheim, A general framework for database design strategies. Proc. 2nd East/West Database Workshop (eds. J. Eder, L.A. Kalinichenko), Klagen­furt, 1994, Workshops in Computing, Springer, London, 1995, 263-274.

[Tha97a] B. Thalheim, Development of database-backed information services for Cottbus net. Preprint CS-20-97, Computer Science Institute, Brandenburg Uni­versity of Technology at Cottbus, 1997.

(Tha97b] B. Thalheim, Codesign of structures, functions and interfaces in database applications. Preprint 1-05-1997, Computer Science Institute, Brandenburg Uni­versity of Technology at Cottbus, 1997 (In German).

(Tha99a] B. Thalheim, The strength of ER modeling. In: Conceptual Modeling: Current Issues and Future Directions ( eds. P. P. Chen, J. Akoka, H. Kangassalo, B. Thalheim), Selected papers from the workshop on conceptual modeling, Los Angeles, 1997, LNCS 1565, Springer, Berlin, 1999, 227-242.

(Tha99b] B. Thalheim, Restructuring a data warehouse for an efficient decision support system. Proc. Gulf Conf. on Decision Support Systems, Kuwait, 1999.

(The95] S. Thelemann, Assertion of consistency within a complex object database using a relationship construct. In (ER'95], 32-43.

(The96] D. Theodoratos, Deductive object oriented schemas. In (ER'96], 58-72. (THo93] A. H. M. Ter Hofstede, Information modelling in data intensive domains.

PhD Thesis, University of Nijmegen, 1993. (Tho97] E. Thomson, OLAP solutions: Building multidimensional information sys­

tems. John Wiley & Sons, New York, 1997.

610 References

[TjB93] A M. Tjoa and L. Berger, Transformation of requirement specifications expressed in natural language into an EER model. In [ER'93), 206-217.

[TKY79) Y. Tanaka, Y. Kambayashi, and S. Yajima, Properties of embedded mul­tivalued dependencies in relational data bases. Trans. IEEE Japan E 62, 8, 1979, 536-543.

[TNC91] A. K. Tanaka, S. B. Navathe, S. Chakravarthy, and K. Karlapalem, ER­R: An enhanced ER model with situation-action rules to capture application semantics. In [ER'91], 59-76.

[ToM96] T. Topaloglou and J. Mylopoulos, Representing partial spatial information in databases. In [ER'96), 325-340.

[TOR96) A. H. M. Ter Hofstede, M. E. Orlowska, and J. Rajapakse, Verification problems in conceptual workflow specifications. In [ER'96), 73-88.

[ToS88] R. W. Topor and E. A. Sonenberg, On domain independent databases. In [Min88], 217-240.

[TPC94) M. Teisseire, P. Poncelet, and R. Cicchetti, Towards event-driven mod­elling for database design. Proc. 20th Int. Conf. on Very Large Data Bases -VLDB'94 (eds. J. B. Bocca, M. Jarke, C. Zaniolo), Santiago de Chile, 1994, Morgan Kaufmann, San Francisco, 1994, 285-296.

[Tra50] B. A. Trachtenbrot, Impossibility of an algorithm for the decision problem on finite classes. Dokladi akademii nauk 70, 1950, 569-572.

[Tsi89) D. Tsichritzis, Object-oriented development for open systems. In: Ob­ject oriented development, Universite de Geneve, Centre Universitaire D'lnformatique, 1989.

[TsL82] D. Tsichritzis and F. H. Lochovsky, Data Models. Prentice Hall, Englewood Cliffs, 1982.

[TuW83) E. Tugenthat and U. Wolf, Logisch-semantische Propiideutik. Reclam, Stuttgart, 1983.

[TWB89) T. J. Teorey, G. Wei, D. L. Bolton, and J. A. Koenig, ER model cluster­ing as an aid for user communication and documentation in database design. CACM, 32(8), 1989, 975-987.

[TYF86] T. J. Teorey, D. Yang, and J. P. Fry, A logical design methodology for relational databases using the extended entity-relationship model. ACM Com­puting Surveys, 18(2), 1986, 197-222.

[UKN92] S. D. Urban, A. P. Karadimce, and R. B. Nannapaneni, The imple­mentation and evaluation of integrity maintenance rules in an object-oriented database. Proc. 8th Int. Conf. on Data Engineering- ICDE'92 (ed. F. Golshani), Tempe, Arizona, IEEE Computer Society, New York, 1992, 562-572.

[Ull83] J. D. Ullman, On Kent's 'Consequences of assuming a universal relation'. ACM TODS, 8(4), 1983, 637-643.

[Ull89] J. D. Ullman, Principles of database and knowledge-base systems. Com­puter Science Press, Rockville, MD, 1989.

[Ull91] J. D. Ullman, A comparison of deductive and object-oriented database systems. Proc. Deductive and Object-Oriented Databases, 2nd Int. Conf. -DOOD'91 (eds. C. Delobel, M. Kifer, Y. Masunaga), Munich, 1991, LNCS 566, Springer, Berlin/New York, 1991, 263-277.

[Var81] M. Y. Vardi, The decision problem for database dependencies. IPL, 12(5), 1981, 251-254.

[Var84] M. Y. Vardi, The implication and finite implication problems for typed template dependencies. Journal of Computer and System Sciences, 28(1), 1984, 3-28.

[Var88] M. Y. Vardi, Fundamentals of dependency theory. In: Trends in Theoretical Computer Science (ed. E. Borger), Computer Science Press, Rockville, 1988, 171-224.

References 611

[Vas78] V. P. Vashenko, Multiple separation of a function using a fixed adjoint function. Soviet Math. Dokl., 19(2), 1978, 246-249.

[Vas80] Y. Vassiliou, Functional dependencies and incomplete information. Proc. 6th Int. Conf. on Very Large Databases - VLDB'80, Montreal, Quebec, 1980, IEEE-CS, 260-269.

[VeA96] M. W. W. Vermeer and P. M. G. Apers, On the applicability of schema integration techniques to database interoperation. In [ER'96], 179-194.

[VeC93] A. V. Velho and R. Carapuca, From entity-relationship models to role­attribute models. In [ER'93], 257-270.

[VeG95] J. Venable and J. Grundy, Integrating and supporting entity relationship and object role models. In [ER'95], 318-328.

[VeM81] M. Vetter and R. N. Maddison, Database design methodology. Prentice Hall, Englewood Cliffs, 1981.

[VGT87] A. Van Gelder and R. W. Topor, Safety and correct translation of re­lational calculus formulas. Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on the Principles of Database Systems- PODS'87, San Diego, California, 1987, ACM Press, New York, 1987, 313-327.

[VGu87] D. Van Gucht, On the expressive power of the extended relational alge­bra for the unnormalized relational model. Proc. 6th ACM SIGACT-SIGMOD­SIGART Symp. on the Principles of Database Systems- PODS'87, San Diego, California, 1987, ACM Press, New York, 1987, 302-312.

[VGu88] D. Van Gucht, Interaction-free multivalued dependency sets. TCS, 62(1-2), 1988, 221-233.

[VHD91] P. Van Hentenrych and Y. Deville, The cardinality operator: A new log­ical connective for constraint logic programming Proc. 8th Int. Conf. on Logic Programming- ICLP'91 (ed. K. Furukawa), Paris, 1991, MIT Press, 1991, 745-759.

[Via83] V. Vianu, Dynamic constraints and database evolution. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems - PODS'83, At­lanta, Georgia, 1983, ACM Press, New York, 1983, 389-399.

[Via87] V. Vianu, Dynamic functional dependencies and database aging. JACM, 34(1), 1987, 28-59.

[Vin92] M. W. Vincent, Modification anomalies and Boyce-Codd normal form. Technical Report, CIS-92-007, University of South Australia, 1992.

[Vin94] M. W. Vincent, The semantic justification for normal forms in relational database design. PhD Thesis, Monash University, Melbourne, 1994.

[Vin97] M. W. Vincent, A corrected 5NF definition for relational database design. TCS, 185(2), 1997, 379-391.

[ViS93a] M. W. Vincent and B. Srinivasan, Redundancy and the justification for fourth normal form in relational databases. Journal of Foundations of Computer Science, 4( 4), 1993, 355-365.

[ViS93b] M. W. Vincent and B. Srinivasan, A note on relation schemes which are in 3NF but not in BCNF. IPL, 48, 1993, 281-283.

[ViW95] V. Vidal and M. Winslett, A rigorous approach to schema restructuring. In [ER'95], 101-112.

[Voi58] J. K. Voischvillo, Simplification methods for Boolean functions. Naushnije dokladi vysschej schkoli, Filosofskije nauki, 2, 1958, 120-135 (In Russian).

[Vos87] G. Vossen, Datenmodelle, Datenbanksprachen und Datenbank­Management-Systeme. Addison-Wesley, Bonn, 1987 (2nd edition, 1994).

[Vos90] G. Vossen, Transaktionsverarbeitung in Datenbanksystemen unter Aus­nutzung semantischer Informationen. Hiithig, Heidelberg, 1990.

[Vos91] G. Vossen, Data Models, database lap.guages and database management systems. Addison-Wesley, Wokingham, England, 1991.

612 References

(VoW90] G. Vossen and K.-U. Witt, Das DB2-Handbuch. Addison-Wesley, Bonn, 1990.

(VVA97] J. Van den Bussche, D. Van Gucht, M. Andries, and M. Gyssens, On the completeness of object-creating database transformation languages. JACM, 44(2), 1997, 272-319.

(Wad87] P. L. Wadler, List comprehensions. In: The implementation of functional programming languages (ed. S. L. Peyton Jones), Prentice Hall, Englewood Cliffs, 1987.

(Wad90] P. L. Wadler, Comprehending monads. Mathematical Structures in Com­puter Science, 2, 1990, 461-493.

(Wan90) K. Wang, Polynomial time designs towards both BCNF and efficient data manipulation. Proc. 1990 ACM SIGMOD Int. Conf on Management of Data­SIGMOD'90 (eds. H. Garcia-Molina, H. V. Jagadish), Atlantic City, N.J., 1990, ACM Press, 1990, SIGMOD Record, 19(2), 1990, 74-83.

(Wan92] K. Wang, On characterizing boundedness of database schemes with bounded dependencies. TCS, 100(2), 1992, 347-364.

(Wan96] G. Wanner, Entwurf einer objektorientierten Anfragesprache und deren Transformation in SQL-Anweisungen. Proc. Workshop ER Case Tools, Research Track (track of ER'96) (eds. B. Thalheim, S. Yigitbasi), Cottbus, 1996, BTU Cottbus, 1996, 53-73.

(War94] B. Warboys, Reflections on the relationship between BPR and software process modeling. In [ER'94], 1-9.

[WaT91] D. A. Watt and P. Trinder, Towards a theory of bulk types. FIDE Report 91-26, University of Glasgow, 1991.

[Wa Y91] K. Wang and L. Y. Yuang, Incremental database design revisited. Proc. Int. Conf. on Computing and Information, Ottawa, Canada, 1991, LNCS 497, Springer, Berlin, 1991, 219.

[WCL94] J. Widom, R. Cochrane, and B. G. Lindsay, Implementing set-oriented production rules as an extension to starburst. Proc. 17th Int. Conf. on Very Large Data Bases- VLDB'91 (eds. G. M. Lohmann, A. Sernadas, R. Camps), Barcelona, Catalonia, 1991, Morgan Kaufmann, San Francisco, 1994, 577-589.

[Wed90] G. E. Weddell, A theory of functional dependencies for object-oriented data models. Proc. Deductive and Object-Oriented Databass, 1st Int. Conf. on Deductive and Object-Oriented Databases- DOOD'89 (eds. W. Kim, J.-M. Nicolas, S. Nishio), Kyoto, 1989, North-Holland/Elsevier Science, Amsterdam, 1990, 150-169.

[Wed92] G. E. Weddell, Reasoning about functional dependencies generalized for semantic data models. ACM TODS, 17(1), 1992, 32-64.

[Weg90] P. Wegner, Concepts and paradigms of object-oriented programming. SIG­PLAN OOP Messenger, 1(1), 1990, 7-87.

[WeG99] P. Wegner and D. Goldin, Interaction as a framework for modeling. In: Conceptual modeling: current issues and future directions ( eds. P. P. Chen, J. Akoka, H. Kangassalo, B. Thalheim), LNCS 1565, Springer, Berlin, 1999, 243-257.

(Wen97] S. Wendt, Zeigen, Nennen, Umschreiben- die drei Altemativen der Identi­fikation. Internal report, Dept. of Electrical Engineering, University of Kaisers­lautem, 1997.

[WGS97] D. Wijesekera, M. Ganesh, J. Srivastava, and A. Nerode, Tableaux for functional and independencies. Tableaux'97, Minneapolis, 1997, 19-29.

(WiE81] G. Wiederhold and R. Elmasri, The structural model for database design. In [ER'81], 237-257.

(Wie83] G. Wiederhold, Database design. McGraw Hill, New York, 2nd edition, 1983.

References 613

[Wie87] G. Wiederhold, File organization for database design. McGraw Hill, New York, 1987.

[Wie89] G. Wiederhold, Design concepts and implementation of databases. Mc­Graw Hill, New York, 1989.

[Wie95a] G. Wiederhold, Modeling and system maintenance. In [ER'95], 1-20. [Wie95b] R. J. Wieringa, Combining static and dynamic modelling methods: A

comparison of four methods. The Computer Journal, 38(1), 1995, 17-30: [Wie96] R. J. Wieringa, Requirements engineering: Frameworks for understanding.

John Wiley & Sons, Chichester, 1996. [Wij95] J. Wijsen, Design of temporal relational databases based on dynamic

and temporal functional dependencies. Proc. Recent Advances in Temporal Databases (eds. J. Clifford, A. Tuzhilin), Workshops in Computing, Springer, London, 1995, 61-76.

[Win90] M. Winslett, Updating Logical Databases. Cambridge University Press, Cambridge, 1990.

[Win93] R. Winter, Design and implementation of derived entities. In [ER'93], 60-73.

[Win94] R. Winter, Formalized conceptual models as a foundation of information systems development. In [ER'94], 437-455.

[Wir90] M. Wirsing, Algebraic specification. In: Handbook of Theoretical Com­puter Science, Vol. B, Formal Models and Semantics (ed. J. Van Leeuwen), Elsevier, Amsterdam, 1990, 675-788.

[WiW84] M. Winslett and G. Wiederhold, Relational and entity-relationship databases in VLSI design. IEEE Database Engineering Bulletin, 7(2), 1984, 61-66.

[WMW89] R. Wieringa, J.-J. Meyer, and H. Weigand, Specifying dynamic and deontic integrity constraints. DKE, 4(2), 1989, 147-189.

[WRR90] G. Wiederhold, T. Risch, P. Rathmann, L. DeMichiel, S. Chaudhuri, B.­S. Lee, K. Law, T. Barsalou, and D. Quass, A mediator architecture for abstract data access. Stanford University, Report STAN-CS-90-1303, 1990.

[WV093] J. Wijsen, J. Vandenbulke, and H. Olivie, Functional dependencies gen­eralized for temporal databases that include object-identity. In [ER'93], 99-109.

[WWN89] G. Wiederhold, M. Winslett, and N. Naclerio, Layering an Engineering Information System. IEEE COMPCON, 34, 1989, 444-449.

[Yan86] C.-C. Yang, Relational Databases. Prentice Hall, Englewood Cliffs, 1986. [YaT89] M. Yaseen and B. Thalheim, Practical Database Design Methodologies.

Kuwait University, Faculty of Science, 1989. [Yao85] S. B. Yao. Principles of database design, Volume 1: Logical organizations,

Prentice Hall, Englewood Cliffs, 1985. [YLC96] A. Yahia, L. Lakhal, R. Cicchetti, and J.-P. Bordat, i02: An algorithmic

method for building inheritance graphs in object database design. In [ER'96], 422-437.

[Yok88] K. Yokota, Deductive approach for nested relations. In: Programming of future generation computers II (eds. K. Fuchi, L. Kott), 1988, 461-481.

[YTS99] S. Yigitbasi, B. Thalheim, K. Seelig, S. Radochla, and R. Jurk, Entwick­lung und Bereitstellung einer Forschungs- und Umweltdatenbank fiir das BTUC lnnovationskolleg. Rekultivierung von Bergbaufolgelandschaften (eds. F. Hiittl, D. Klem, E. Weber), Walter de Gruyter, Berlin, 1999, 269-282.

[YuM94] E. S. K. Yu and J. Mylopoulos, FromE-R to" A-R"- Modelling Strategic Actor Relationship for Business Process Reengineering. In [ER'94], 548-565.

[Yu086] L.-Y. Yuan and Z. M. Ozsoyoglu, Unifying functional and multi valued dependencies for relational database design. Proc. 5th ACM SIGACT-SIGMOD

614 References

Symp. on Principles of Database Systems- PODS'86, Cambridge, Mass., 1986, ACM Press, New York, 1986, 183-190.

[Yu092] L.-Y. Yuan and Z. M. Ozsoyoglu, Design of desirable relational database schemes. JCSS, 45(3), 1992, 435-470.

[YWH82] S. B. Yao, V. E. Waddle, and B. C. Housel, View modeling and integra­tion using the functional data model. IEEE TSE, 8(6), 1982, 544-553.

[YWH85] S. B. Yao, V. Waddle, and B. C. House, An interactive system for database design and integration. In: Principles of database design, Volume 1: Logical organizations (ed. S. B. Yao), Prentice Hall, Englewood Cliffs, 1985, 325-360.

[ZAB86] C. Zaniolo, H. Ait-Kaci, D. Beech, S. J. Cammarata, and D. Maier, Object-oriented database systems and knowledge systems. Proc. Expert database systems, 1st Int. Workshop (ed. L. Kerschberg), Kiawah Island, South Carolina, 1984, Benjamin/Cummings, 1986, 49-65.

[Zal89] M. S. Zalenko, Modeling semantics in data bases. Science, Moscow, 1989 (In Russian).

[ZaL93] A. Zamperoni and P. Lohr-Richter, Enhancing the quality of conceptual database specifications through validation. In [ER'93], 85-98.

[Zan76] C. Zaniolo, Analysis and design of relational schemata for database sys­tems. Technical report UCLA-ENG-7669, Los Angeles, 1976.

[ZaS81] A. V. Zamulin and I. N. Skopin, Data base design using abstract data types. Programming and Computer Software (Translation of Programmirovaniye, Moscow, USSR), 7(5), 1981, 267-271.

[ZdM90] S. B. Zdonik, and D. Maier, Readings in object-oriented database systems. Morgan Kaufmann, 1990.

[Zeh85] C. A. Zehnder, lnformationssysteme und Datenbanken. Teubner, Stuttgart, 1985.

[ZhB92] J. Zhou and P. Baumann, Evaluation of complex cardinality constraints. In [ER'92], 24-40.

[ZhH90] Y. Zhou and M. Hsu, A theory for rule triggering systems. Proc. Advances in Database Technology, 2nd Int. Conf. on Extending Database Technology -EDBT'90 (eds. F. Bancilhon, C. Thanos, D. Tsichritzis), Venice, 1990, LNCS 416, Springer, Berlin/New York, 1990, 407-421.

[ZhM83] Z. Q. Zhang and A. 0. Mendelzon, A graphical query language for entity relationship databases. In [ER'83], 441-448.

[Zh092] Y. Zhang and M. E. Orlowska, A new polynomial time algorithm for BCNF relational database design. Information Systems, 17(2), 1992, 185-193.

[ZNG90] J. Zhu, R. Nassif, P. Goyal, P. Drew, and B. Askelid, Incorporating a model hierarchy into the ER paradigm. In [ER'90], 68-80.

Yet here I am, a wretched fool, No wiser than I was before.

They call me Magister, even Doctor, And for some ten years now

I've led my students by the nose, Up and down, across, and in circles -

All I see is that we cannot know. Goethe, Faust I, Night

List of Figures

2.1

3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 3.10

3.11 3.12 3.13 3.14

3.15 3.16 3.17 3.18 3.19 3.20 3.21

4.1 4.2 4.3 4.4 4.5 4.6 4.7 4.8 4.9 4.10 4.11 4.12 4.13

Classification of Databases ...................................... .

Decomposition of Overloaded Entity Types ........................ . Decomposition of Relationship Types with Key Attributes .......... . Representing Different Roles with Weak Entity Types .............. . Weak Entity Types with Mutual Identification ..................... . Identification Problems with Overloaded Weak Type Associations .... . Can the Relationship Type Producing Be Decomposed? ............. . Representing Producing by Three Binary Relationship Types ........ . Ternary Relationship Type ...................................... . Decomposition of a Ternary Relationship Type to Two Binary Types .. Second Decomposition of a Ternary Relationship Type to Two Binary Types ........................................................ . Decomposition of a Ternary Relationship Type to Three Binary Types . Decomposition of a Ternary Relationship Type to Two Binary Types .. Representing Producing by a Weak Entity Type ................... . Unifying the Entity Type Machine and the Relationship Type Produc-ing .......................................................... . Sole Relationship Types and Their Possible Meaning ............... . Is-A Relationship Types with the Union Constructor ............... . Mixing Pointer and Set Semantics in Relationship Types ............ . Decomposition of n-ary Relationship Types ........................ . Normalization of Types Before Introduction of Binary Associations . . .. Decomposition of n-ary Relationship Types Using Constraints ....... . Grouping and Using Meta-Entity Types ........................... .

Commuting Diagram for Aggregation and Abstraction .............. . Insert Graphs for the Type Person" .............................. . HERM Diagram of the University Database ....................... . The Library HERM Schema ..................................... . HERM Diagram of the Court Database ........................... . HERM Diagram Representing the Medical Application Database ..... . Weak Entity Type with Ternary Identifying Relationship Type ...... . Compact HERM Representation with Equivalent Information ........ . HERM Diagrams With/Without Higher-Order Relationship Types ... . Is-A, Unary and Role Relationship Types ......................... . Higher-Order Types for Boyce-Codd Normal Form Decompositions ... . HERM Diagram of Mathematical Reviews Database ................ . Representation of Extended Types ............................... .

27

35 36 37 37 39 41 42 43 43

44 44 44 46

47 48 49 50 50 51 52 54

63 70 75 78 81 83 84 85 87 88 89 91 98

5.1 The Classification of Integrity Constraints .......................... 107

616 List of Figures

5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 5.10 5.11 5.12 5.13 5.14 5.15 5.16 5.17 5.18 5.19 5.20 5.21 5.22 5.23 5.24 5.25 5.26 5.27

6.1 6.2 6.3 6.4 6.5 6.6 6.7 6.8 6.9 6.10 6.11 6.12 6.13

7.1 7.2 7.3 7.4 7.5 7.6 7.7 7.8 7.9 7.10 7.11

Taxonomy of Constraints Based on Relational Structural Properties .. . Representing Class Inclusion and Exclusion Constraints ............. . Path Functional and Inter-Fact-Type Uniqueness Constraints ........ . Tree Representation of a Hierarchical Decomposition ............... . Behavior of the Key Probability in Dependence on Domain Size ..... . Behavior of the Key Probability in Dependence in Relation Size ..... . Lookup and Participation Representation ......................... . Different Semantics Represented by Teorey's Approach ............. . Different Notions for a Paper Reviewing Database .................. . SERM Arrows and Types for Different Cardinalities and Types ...... . ER, SERM and HERM Representation of the Turtle Leagues ....... . Different Meanings of (1,1)-(0,m) Relationship Types ............... . Dissimilar Semantics of Path Inclusion and Cardinality Constraints ... . Unsatisfiable Schema ........................................... . Graph for Prerequisites ......................................... . The Cardinality Order -< ........................................ . Correction of Cardinality Constraints in Schemata ................. . VVorkshop Schedule Schema ..................................... . Decomposable Independent Concepts ............................. . Independent Concepts and Meta-Entity Types ..................... . Representation of Independent Concepts by Relationship Types ...... . Information for Course Scheduling ............................... . Decomposition on the Basis of Pivoting ........................... . Binary Representation After Pivoting ............................. . Alternative Binary Representation After Pivoting .................. . Constraint Acquisition Based on Design-By-Example ............... .

Navigation Graph in the HERM Algebra .......................... . Conjunctive Navigation Graph in the HERM Algebra ............... . Navigation Graphs with Quantified Path Expressions ............... . Navigation Graphs with Negation and Transitive Closure ............ . Billing of Members ............................................. . The Catalogue User View ....................................... . The User View for Borrowing Books .............................. . Statistical Analysis of Reading Habits ............................ . HERM Diagram for Billing Matters .............................. . HERM Diagram for the Medical Manual on Diseases ............... . HERM Diagram for the Medical Manual on Drugs ................. . Possible Enforcement Rules for Generic Operations (Insert Operation) . The External View - Student and Lecture During Winter Term 1994 ..

The General Scheme of the Conference Database ................... . The Scheme of the Conference Database After Assignment .......... . Simple Transition System ....................................... . Conference Database Transition System ........................... . Transformation Applied to Segment i ............................. . Most General Transition System for the First Subsequence .......... . Two Most General Transition Systems for the Nine Transformations .. . Final, Unique, Most General Transition System .................... . Enforcement Specification for Married People ...................... . Associated Rule Hypergraph ..................................... . Critical Trigger Paths .......................................... .

109 127 136 140 162 163 176 177 178 179 180 182 183 188 189 195 196 200 202 204 205 206 207 207 208 211

229 230 231 232 234 235 235 237 238 239 239 243 252

277 278 280 280 283 288 288 289 299 304 305

List of Figures 617

8.1 Address Defined by Weak Entity Types ............................ 315 8.2 HERM Diagram of the Newspaper Distribution Database ............ 317 8.3 The Clan Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 318 8.4 Or Identification Structure of a Person . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 320 8.5 Complex Identification Through Relationship Types . . . . . . . . . . . . . . . . . 321 8.6 Identification Defined for Algebraic Expressions . . . . . . . . . . . . . . . . . . . . . 322 8. 7 Structural Is-A Relationship Type of Two Entity Types . . . . . . . . . . . . . . 324 8.8 Is-A relationship Types and Clusters .............................. 330 8.9 Is-A relationship Types Which Cannot Be Replaced by Subtypes ...... 331 8.10 Commuting Diagram for View Update ............................. 335 8.11 Updateability for Join Views ..................................... 339 8.12 Commuting Diagram for Database Update with Supplements ......... 340 8.13 Commuting Diagram for Database Update ......................... 340 8.14 Another University Schema (Schema B) ............................ 343 8.15 View Cooperation in Databases ................................... 347 8.16 Star Schema on Purchases ........................................ 351 8.17 Snowflake Schema on Purchases ................................... 351 8.18 Extended HERM and OLAP Representations of Time ............... 352 8.19 Unfold, Fold and Classification Operations in the HERM Algebra ..... 354 8.20 Information Services Codesign: Data and Process Flow Perspective . . . . 357 8.21 Subschema for Cultural, Sport, etc., Events ........................ 358 8.22 The Subgraph of Interest in Sport . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 365 8.23 Commuting Diagram for Dynamic Inclusion . . . . . . . . . . . . . . . . . . . . . . . . 370 8.24 Equivalence of Schemata on the Basis of Constraints and Components . 371 8.25 Non-derivability of Joins by Cardinality Constraints ................ 378 8.26 Exclusion of the Redundant Type Have . . . . . . . . . . . . . . . . . . . . . . . . . . . 379 8.27 Hierarchical Dependence of Types with Redundancy ................ 380 8.28 Splitting the Interview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 381 8.29 Offers as Relationship Type ...................................... 381 8.30 Interview as New Entity Type .................................... 382 8.31 Interview Using Grouping ........................................ 383 8.32 HERM Solution with an Offer Entity Type . . . . . . . . . . . . . . . . . . . . . . . . . 383 8.33 Compact HERM Solution with an Offer Relationship Type . . . . . . . . . . . 384 8.34 Verification in the Cinema Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 385 8.35 HERM Diagram of LFG-SPO Sentences . . . . . . . . . . . . . . . . . . . . . . . . . . . 386 8.36 Transformed HERM Diagram of LFG-SPO Sentences . . . . . . . . . . . . . . . . 386 8.37 HERM Diagram of PTQ-SPO Sentences . . . . . . . . . . . . . . . . . . . . . . . . . . . 387 8.38 Correcting Wrong Associations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 388 8.39 Network Representation of the Star Type Person .................... 390 8.40 HERM Representation of the Star Type Person . . . . . . . . . . . . . . . . . . . . . 391 8.41 Tree Dependency in the Extended Relationship Type Lecture* ........ 401 8.42 Solutions for the Airline Database with Transitive Path Constraints . . . 403 8.43 Solutions for the Airline Database with Cyclic Constraints . . . . . . . . . . . 404 8.44 Normalized Airline Database Scheme Without Problematic Constraints 404 8.45 The Decomposition of Recursive Relationship Types. . . . . . . . . . . . . . . . . 406 8.46 Depth-Restricted Horizontal Decomposition of Part-Subpart .......... 408 8.47 The Cluster Representation of Part-Subpart ........................ 409

9.1 The Linguistic Triangle .......................................... 427 9.2 Main Dimensions in Structure-Oriented Design ..................... 436 9.3 Top-Down Database Design Primitives ............................ 441 9.4 The Acquisition of Information in Database Design .................. 449 9.5 Structure-Oriented Design Strategies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 452

618 List of Figures

9.6 9.7 9.8 9.9 9.10 9.11 9.12 9.13 9.14 9.15 9.16 9.17 9.18 9.19 9.20 9.21 9.22 9.23 9.24 9.25 9.26

Data Structures During Database Design .......................... . The Unit PERSON ............................................. . The Unit DRUG ............................................... . The Unit DISEASE ............................................ . The Units in the Medical Example and Their Common Types ....... . The Representation of Processes ................................. . Transaction RequestABook ...................................... . The Abstraction Layer Model of the Database Design Process ....... . Interaction Specification for Dialogue Objects ...................... . Abstraction Layers of Structure-Oriented Design ................... . Codesign by Stepwise Construction and Refinement ................ . Diagrams Used for Specification of Interaction ..................... . Dialogue Scene Diagram for Lecture Offering ...................... . Dialogue Cooperation Diagram for Lecture Scheduling .............. . Dialogue Sequence Diagram for Lecture Offering ................... . Interface Object Derived from the Dialogue Object AddOffer ........ . Abstract Statechart for Lecture Scheduling ........................ . Refinement of the Statechart for Login ............................ . The Design Information Model. .................................. . Architecture of ( D B) 2 • • •••••••••••••••••••••••••••••••••••••••••

Architecture of RADD .......................................... .

453 454 456 457 458 459 460 463 465 466 469 470 471 472 473 473 475 476 489 492 495

10.1 Bachman Diagram of the University Database . . . . . . . . . . . . . . . . . . . . . . 542

Index

;3-normal form, 307, 419 (p,q)-constraint, 153 *-cardinality constraint, 169 +-cardinality constraint, 169 3NF, see Third normal form

Abort dependence, 260 Abort/compensation dependence, 260 Absolute value, 62 Abstraction, 18, 438 - Concept abstraction, 18 - Context abstraction, 19 - Data abstraction, 20 - Functional abstraction, 19 - Implementation abstraction, 19 - Localization abstraction, 19 - Modularization, 19 - Structure concept abstraction, 18 - Type abstraction, 63 Abstraction aspect, 19 Abstraction layer model, 462 Abstraction level, 393 Access set, 260 Accuracy, 62 ACID, 256 Action, 257 Activity, 261 Additivity problem, 155 Adequacy, 397 Advantages

ER approach, 8 - HERM approach, 9, 55, 86, 528 - Relational approach, 7 Advantages of HERM, 552 Affinity relationship type, 326 Afunctional constraint, 153 Agent, 261 Aggregation, 18 - Aggregate class, 53 Aggregation function, 233 - Applicability, 62 Algebra, 223

- Cluster class, 229 - Entity classes, 226 - Nested relation algebra, 224 - Relationship class, 229 Algebraic constraint, 127 Algebraic dependency, 124, 127 Algebraic expression, 127 Algebraic properties - Dependency, 156 - Invariance of operations, 157 Analogy, 431 Anomaly, 392 ANSI/SPARC architecture, 333 Application aspect, 432 Application engineering, 425 Approximation constraint, 199 Archive database, 410 Argumentative query, 255 Armstrong database, 209 Armstrong relation, 160 Armstrong's deductive system, 42 Array, 64 Aspect - Abstraction aspect, 19 - Application aspect, 432 Attribute - Simple, 34 Attribute grammar, 485 Attribute type, 56 - Absolute type, 62 - Abstraction, 63 - Atomar type, 62 - Continuous type, 63 - Derived attribute, 102 - Derived type, 62 - Implementation type, 61 - Interval type, 62 - Nested type, 62 - Nominal type, 62 - Ordinal type, 62 - Presentation type, 61

620 Index

- Rank type, 62 - Ratio type, 62 - Scale, 62 Authorization, 244 Average complexity, 161 Axiomatization, 118

Bag, 64, 510 Bag algebra, 103 Bag type, 103 BCNF, see Boyce-Codd normal form Behavior-oriented design, 434 Bernoulli relation, 162 Binding, 19 Block existence constraint, 218 Bottom-up design, 442 Bounded domain dependency, 149 Boyce-Codd normal form, 43, 158 Bulk operation, 242 Bulk type, 94 Business process, 261 Business rule, 299 BV dependency, 143

Candidate constraint, 482 Cardinality constraint, 149, 165 - *-cardinality constraint, 169 - +-cardinality constraint, 169 - Default assumption, 184 - Functional cardinality constraint, 174 - General cardinality constraint, 172 - Generalized cardinality constraint,

168 - Global cardinality constraint, 200 - Interval-cardinality constraint, 170 - Key-based constraint, 419 - Look-across constraint, 167, 171 - Look-up constraint, 167 - Many-cardinality constraint, 174 - Monotonicity, 182 - Non-axiomatizability, 186 - Participation constraint, 167 - Projected cardinality constraint, 170 - Relational constraint, 185 - Satisfiability, 188 - Strong cardinality constraint, 167 - Term cardinality constraint, 173 - Type cardinality, 168 - Visibility constraint, 176 Cardinality constraint correction, 375 Chase, 143 Check table, 64 Class, 30

Class constraint, 102, 109 Classification, 18, 61 Closure dependency, 144 Cluster type, 56, 67, 90 - Higher-order cluster type, 68 Clustering, 224, 382 Coercion function, 330 Collection, 103 Commit dependence, 260 Common sense reasoning, 498 Compactification of schemata, 373 Comparative query, 255 Compiler, 503 Completion, 155 Complexity, 159, 161 - Clarity, 14 - Combinatorial, 555 - Comprehensibility, 13 - Computational, 13 - Storage, 13 Component inclusion constraint, 506 Component object model, 19 Composition, 291 Concept abstraction, 18 Conceptual independence, 334 Conceptual layer, 462 Conceptual level, 350 Conceptual tuning, 334, 423 Condition table, 247 Conditional functional dependency, 153 Conditional general linkage constraint,

202 Conditional inclusion constraint, 201 Conflict-free set of constraints, 145 Confluence, 294 Consequence, 291 Consistency, 271, 294 Consistent constraint set, 188 Consistent set of types, 68 Constraint inheritance, 332 Constraint preservation, 396 Constructive access expression, 240 Constructor, 141, 240 Containment relationship type, 323 Context abstraction, 19 Continuous engineering, 555 Continuous value, 63 Controlled redundancy, 505 Cooperation diagram, 470 Critical cycle, 190 Critics - Active database systems, 301 - Binary ER model, 40

- Codd, 5, 165 - Kimball, 4 - Nijssen, 5, 165 - OLAP, 350 - 00 approach, 8, 33 - Relational approach, 7, 39 - Rule triggering, 306 - SERM, 180 Cross, 152 Crucial dependency, 337 Cycle, 190 Cylindric algebra, 123

Data abstraction, 20 Data scheme, 34 Database farm, 19 Database mining, 214 Dataflow, 456 DBPL, 240 Decision problem, 121 Decision query, 254 Declarative treatment, 506 Decomposition, 18, 394 - Ternary relationship type, 41 Decomposition dependency, 142 Decomposition of components, 37 4 Deductive basis, 412 Deductive database model, 99 Deductive normal form, 410 Deductive normalization, 394 Default assumption, 184 Default translation option, 510 Default value, 61, 506 Definite formula, 120 Definition query, 255 Delete, 241 Deontic logics, 309 Dependency, 116, 120 Derivability, 433 Derivable type, 378 Derivation, 117 Derived attribute, 102 Derived value, 62 Design dimension, 435 Design faults, 24 Design pattern, 11 Design primitive, 438 Design problem, 1 Design-by-example, 208, 446 Design-by-units, 450 Determiner, 481 Diagonal, 265 Dialogue, 462

Dialogue class, 470 Dialogue object, 470 Difference, 111, 224 Disjunction, 232

Index 621

DKNF, see Domain/key normal form Domain, 34 Domain dependency, 149 Domain function, 34 Domain-compatible, 65 Domain-independent formula, 120 Domain/key normal form, 418 Dynamic entity-relationship scheme,

106 Dynamic equivalence of schemata, 370 Dynamic functional dependency, 265 Dynamic inclusion of schemata, 370 Dynamic integrity constraint, 106

ECA rule, 294 Element-generating constraint, 217 Elementary key normal form, 157 Embedded cross-dependency, 186 Embedded join dependency, 124, 152 Embedded multivalued dependency,

125, 152 Embedded template dependency, 143 Embedded tuple-generating depen-

dency, 143 Encapsulation, 19 Enforcement, 242, 293-308, 506 Entity, 4, 27, 30, 34, 66 Entity class, 30 Entity deletion, 224 Entity introduction, 224 Entity set, 30 Entity type, 4, 30, 34, 56, 65 - Strong entity type, 34 - Weak entity type, 34-38, 46, 84 Entity type representation, 30 Entity-relationship diagram, 73 Entity-relationship scheme, 105 Environment, 299 Equality constraint, 154 Equality-generating dependency, 141 Equivalence of schemata, 368 ER logic, 114 ER scheme, 105 - Dynamic ER scheme, 106 ERS database, 105 Essay query, 254 Event, 470 Event nonseparation approach, 323,

327, 504

622 Index

Event separation approach, 323, 327, 504

Excluded functional constraint, 153 Exclusion dependence, 260 Exclusion dependency, 126 Exclusive referential constraint, 298 Execution model, 260 Existence constraint, 120, 131 Existence query, 254 Expansion, 228 Exploitation layer, 464 Extended transitive dependency, 152 Extemal level, 350 Extemal view, 251

Faimess, 293 Fan-in referential constraint, 298 Fan-out referential constraint, 298 Filtration, 357 Finite implication problem, 116 First normal form, 157 First-order hierarchical dependency,

152 First-order predicate logics, 112 Flat transaction, 258 Folding function, 355 Foreign key, 296 Formal semantics, 290 Formal system, 117 -Axiom, 117 - Complete formal system, 118 - Hilbert-type system, 117 - Inference rule, 117 - - Conclusion, 117 -- Premise, 117 - K-ary formal system, 118 - Sound formal system, 117 Frame problem, 283 Frame transaction approach, 272 Full expansion, 228 Functional abstraction, 19 Functional cardinality constraint, 174 Functional database model, 98 Functional dependency, 42, 140, 265 Functionality query, 255

General cardinality constraint, 172 General dependency, 152 General embedded implicational

dependency, 142 General key, 66, 322 General linkage constraint, 201 Generalization, 19, 326, 505

Generalized cardinality constraint, 168 Generalized functional dependency,

141, 148 Generalized Is-A relationship type, 325 Generalized second-order hierarchical

dependency, 152 Generalized transitive dependency, 152 Generic operation, 30, 186, 242 Get formula, 251 Global cardinality constraint, 200 Global normalization, 402 Global view cooperation problem, 348 Granularity, 61, 62, 302 Graph dependency, 139 Graph grammar, 439 Greatest consistent specialization, 308 Grouping, 382

Hard constraint, 309 Has-Effect-Of relationship type, 325 Has-Function-Of relationship type, 325 HERM, 2, 55 - Extensions beyond ER, 56 HERM algebra, 223 HERM normal form, 415 HERM/LC, 251 HERM/QBE, 245 HERM/SQL, 229 Heuristics, 483 Hiding, 19 Hierarchical dependency, 140 Hierarchical model, 541 Hierarchical schema, 307 Hierarchy, 504 Higher-order entity-relationship model,

see HERM Higher-order logics, 100 Homonym, 131 Horizontal decomposition, 394 Horizontal normal form, 405 Hypergraph, 158

Identification, 31, 314, 317 - Automorphism-based, 32 - Bisimulation-based, 32 - Homomorphism-based, 32 - Logics-based, 32 - Query-based, 32 - Value-based, 32 Identification structure, 319 Identifier, 27, 31, 85, 322 Identifier-based database, 27 Identifying owner, 314 Identifying relationship, 314

IFO model, 437 Implementation abstraction, 19 Implementation inheritance, 332 Implementation layer, 462 Implication - K-ary implication, 117 Implication problem, 116 Inclusion dependency, 125, 433 Inclusion inheritance, 332 Inclusion of schemata, 368 Inclusive referential constraint, 298 Incompleteness, 213 Inconsistent data, 392 Independent unit, 203 Indeterminateness, 213 Induction, 288, 446 Inductive learning, 288 Inequality constraint, 216 Inference rule, 117 Information container, 355 Information engineering, 425 Information query, 255 Information service, 355 Information unit, 355 Inherent constraint, 506 Inheritance, 332 Input-stable class, 211 Input-unstable class, 211 Insert, 241 Inside-out design, 444 Instability, 392 Instance constraint, 102 Instantiation, 18 Integrity constraint, 56 - Dynamic integrity constraint, 106 -- Temporal formula, 107 -- Transition constraint, 107 - Enforcement, 242, 271, 299, 301 - Environment, 110, 299 - Restructuring, 271 - Static integrity constraint, 105 -- Design dependency, 107

Representation dependency, 107 -- Semantic dependency, 107 -- Structural dependency, 107 Integrity enforcement, 271 Integrity restructuring, 271 Interaction, 462 Interaction machine, 467 Interdependency, 152 Interface, 250 Internal level, 350 Internet database, 2

Interpretation, 113 Interpreter, 503

Index 623

Interrelational dependency, 152 Interrelational functional dependency,

154 Intersection, 111 Interval cardinality constraint, 170 Interval value, 62 Invariant, 292 Inverse referential constraint, 298 Is-A relationship type, 323 Is-Homonym-Of relationship type, 325 Is-Kind-Of relationship type, 325 Is-Property-Of relationship type, 325 Is-Subobject-Of relationship type, 325 Is-Synonym-Of relationship type, 325

Join, 112 Join dependency, 124, 142

Kernel object, 432, 433 Key, 27, 43, 65 - Behavior equality, 66 - Deep equality, 66 - Entropy key, 67 - Foreign key, 296 - General key, 66, 322 - Minimal key, 43 - Shallow equality, 66 - Sure key, 155 Key dependency, 43 Key set, 154 Knowledge acquisition, 498 Knowledge base, 99 Kripke model, 310

Label, 69 Layers in databases, 93 Learning, 288 Learning-by-example, 288 Life cycle, 491 Life span, 101 Lifetime constraint, 269 Linkage constraint, 201 List, 64, 508, 509 Liveness, 293 Local normalization, 402 Localization abstraction, 19 Localization inheritance, 332 Logical independence, 334 Logical query language, 251 Look-across constraint, 167, 171 Look-up constraint, 167 Lossless decomposition, 396

624 Index

Lossless join problem, 149 Lossless join property, 123

Many-cardinality constraint, 17 4 Mapping, 19 May-Be relationships type, 326 Message, 258 Methodology, 434, 445 Mining, 214 Mixed design, 445 Modal logics, 264 Model of a formula, 113 Modeling level, 109 Modular design, 450 Modularity, 254 Monitor, 258 Motivation layer, 462 Multi-dimensional modeling, 12 Multidimensional database, 2, 349 Multilist, 543 Multiset, 103 Multiset type, 103 Multivalued dependency, 124, 144, 203,

433

Naming, 19, 96, 506 Nat ural language specification, 4 78 Negation, 232 Nest, 224 Nested relation, 504 Nested transaction, 258 Network model, 98, 534 Network relationship type, 535 Network type, 534 Nominal value, 62 Non-existence constraint, 131 Non-redundant set of dependencies, 43 Nondeterministic inclusion dependency,

126 Normal form, 266 Normalization, 251, 271, 392-424 - Global normalization, 402 - Local normalization, 402 - Overnormalization, 391 Noun, 481 Null value, 61, 92, 154, 505 Numerical dependency, 149 Numerical query, 254 Numerical restricted path, 230

Object - Characteristic object, 27 - Kernel object, 27 Object identifier, 27, 215

Object-oriented database, 27 Object-oriented database model, 98 Object-oriented design, 431 Object-oriented model, 215 Object-role model, 437 Obligation, 310 OlD, see Identifier OLAP, 2, 250, 349-367 OLAP function, 353 Onto constraint, 185 Operation, 56 - Delete, 57 - Insert, 57 - Update, 57 Operational model, 289 Operational specialization, 331 Optimization, 393 Optional attribute, 510 Optional component, 64 Ordering, 61 Ordinal value, 62 Overnormalization, 391

Pair algebra, 197 Parametrization, 19 Paramodulation, 149 Part-Of relationship type, 326 Partial correctness, 290, 293 Participation constraint, 167 Partitioned normal form, 66 Path, 134, 190 - Weight, 190 Path dependency, 134 Pattern, 11, 431 Permission, 310 Physical independence, 334 Pivoting, 205 Possible key, 155 Postcondition, 289 Pragmatics, 426, 481 Precision, 61, 62 Precondition, 289 Predesign layer, 462 Presentation type, 61 Procedural treatment, 506 Process-oriented design, 434 Product, 224 Program logic, 289 Prohibition, 310 Projected cardinality constraint, 170 Projected join dependency, 124, 152 Projection, 112, 224 Protocol, 258

Proximity relationship type, 326

Quality of design, 23 Quantified expression, 240 Quantified path expression, 230 Query form, 253

RADD, see Rapid application and database development

Range, 62 Rank value, 62 Rapid application and database

development, 493 Ratio value, 62 Reduction, 369 Redundancy, 392 Reference model, 425 Referential constraint, 298 Relation schema, 504 Relation scheme, 504 Relational algebra, 111 Relational calculus, 112 Relational database schema, 111, 504 Relational translation, 503 Relationally complete, 253 Relationship, 27, 30, 34, 67, 69 Relationship class, 30 Relationship deletion, 224 Relationship introduction, 224 Relationship set, 30, 34 - First-order relationship set, 34 Relationship type, 30, 34 - 0-order relationship type, 68 - Binary relationship type, 40-47 - Binary relationship type, 324-332 - Existence relationship type, 84 - First-order relationship type, 56, 67 - Higher-order relationship type, 56,

88 - Is-A relationship type, 48, 86 - Many-to-many relationship type, 169 - Many-to-one relationship type, 168 - One-to-many relationship type, 168 - One-to-one relationship type, 168 - Recursive relationship type, 47 - Sole relationship type, 47 - Unary relationship type, 88 Removal of inconsistent subschemata,

374 Rename, 224 Renaming, 112 Repairing action, 272 Requirements analysis layer, 462

Index 625

Resolution, 149 Restricted view cooperation problem,

348 Retrieve formula, 251 Reusability, 254 Reverse engineering, 545-550 Role, 69, 261 Role-of relationship type, 324 Root dependency, 152 Rule triggering, 302

Safe formula, 120 Safety, 293 Satisfiability, 552 Scale, 62 Scaling, 357 Scene diagram, 470 Schema compactification, 373 Schema equivalence, 368 Schema inclusion, 368 Schema redundancy, 378 Schema simplification, 373 Schema switch, 377 Schema transformation, 371 Scope, 244 Scoping, 19 Script, 342 Search strategy, 443 Security, 244 Segment, 281 Selection, 112, 224 Selective access expression, 240 Selector, 240 Semantic specialization, 331 Semantic system, 117

Axiomatizable semantic system, 118 - Finitely axiomatizable semantic

system, 118 - K-ary axiomatizable axiomatic

system, 118 - U-bounded axiomatizable semantic

system, 118 Semantic theory, 117 Semantic unit, 203 Semantics, 426 - Bag semantics, 114 - Declarative semantics, 100 - List semantics, 31 - Pointer semantics, 31 - Reference semantics, 31 - Set semantics, 31, 60 Semiotics, 426 Separation of aspects, 432 Separation of specializations, 432

626 Index

Sequence diagram, 470 Serializability, 293 SERM, 179 Set constraint, 217 Set constructor, 509 Sheffer set, 413 Short expansion, 228 Simple cycle, 190 Simple path functional dependency, 138 Simplification of schemes, 373 Skeleton, 482 Snapshot, 101, 264 Snowflake schema, 351 Soft constraint, 309 Specialization, 19, 295, 326, 432, 505 - Operational specialization, 331 - Semantic specialization, 331 - Strong operational specialization,

331 - Strong semantic specialization, 331 - Structural specialization, 331 - Type specialization, 331 Specialization approach, 272 Specialization inheritance, 332 Specialized transaction approach, 272 Split problem, 145 SQL expression, 96 Stable class, 392 Star schema, 350 Star type, 389 State-dependent transaction approach,

272 Statechart, 474 Static integrity constraint, 105 Statistical constraint, 199 Stratification, 273 Strong ,6-normal form, 419 Strong cardinality constraint, 167 Strong entity type, 34 Strong generalization, 505 Strong operational specialization, 331 Strong semantic specialization, 331 Strong specialization, 505 Strong stratification, 282 Strong transition functional depen-

dency, 265 Strongly satisfiable set, 188 Structural optimization, 393 Structural recursion, 95 Structural specialization, 331 Structure concept abstraction, 18 Structure-oriented design, 434 Structured ER model, 179

Subset dependency, 152 Subset relationship type, 324 Substitution inheritance, 332 Subtype, 324, 329 Summarization, 357 Summarization function, 233 Supertype, 329 Supplementary query, 254 Sure key, 155 Synonym, 131 Synonym-of relationship type, 325 Syntax, 426

Tableau proof, 143 Task, 261 Template, 256 Template dependency, 125, 143 Temporal ER model, 100 Temporal functional dependency, 265 Temporal logics, 267 Term cardinality constraint, 173 Term rewriting, 301 Term rewriting system, 295 Termination, 294 Third normal form, 43 Time frame, 264 Time model, 100 Top-down design, 439 Total BV dependency, 143 Total correctness, 290 Total join dependency, 124 Total transition system, 121 Transaction, 256, 258, 490 - Abort dependence, 260 - Abort/compensation dependence,

260 -ACID, 256 - Commit dependence, 260 - Exclusion dependence, 260 - Flat transaction, 258 - Nested transaction, 258 Transaction approach, 272 Transformation of schemes, 371 Transition constraint, 156, 282 Transition system, 121 - Total transition system, 121 Transitive closure, 232 Transitive dependency, 125, 152 Transitive referential constraint, 298 Translation, 368, 503-528 Tree, 141, 543 Tree dependency, 140 Trigger, 294, 302 Trigger approach, 272, 302

Trigger existence constraint, 218 Tuning, 334, 423 Tuple, 34, 65, 508 Tuple-generating dependency, 142 Type cardinality, 168 Type constraint, 109 Type constructor, 58, 92, 94, 141 Type inheritance, 332 Type specialization, 331 Type system, 94 Typed formula, 113

UML, 41 Unary inclusion dependency, 125 Uni-relational formula, 142 Unified modeling language, 500 Union, 111, 223 Union approach, 323, 328, 505 Union constraint, 153 Union type, 97 Unique flavor assumption, 307 Unique name assumption, 131 Uniqueness constraint, 133, 167 Unit, 355 Unit of measure, 62 Universal relation approach, 323, 328,

505 Unnest, 224 Untyped formula, 114 Update, 242

Value relationship type, 326 Value-based database, 27 Value-oriented database, 27

Index 627

Value-representable database, 27 Value-representable object, 27, 32 Vector, 64 Verb, 481 Vertical decomposition, 394 View, 245, 251, 333-349 - Consistent, 348 - Creation, 233, 247 - Materialized, 333 - OLAP, 350 - Supplement, 339 - Virtual, 333 View cooperation, 342, 345-349 View creation formula, 252 View integration, 19, 341-345 View set, 260 View update translator, 336 Visibility constraint, 176 Visual query language, 250

Warehouse, 2, 250, 350 Weak entity type, 34-38 Weak kernel object, 433 Weak multivalued dependency, 145 Weak reduction, 369 Weak universal relation, 154 Weak universal relation approach, 505 Weakest liberal precondition, 291 Weakest precondition, 291 Workflow, 261 Worst case complexity, 159

X-join dependency, 124