
A merging technique for relational schemas consisting of relation-schemes, key dependencies, referential integrity constraints, and null constraints is presented. The author examines the conditions required for using this technique with relational database management systems that provide different mechanisms for maintaining null and referential integrity constraints. For relational schemas developed using an extended entity-relationship (EER) oriented design methodology, it is shown that a relation-scheme can be used for representing multiple object-sets not only for the standard binary many-to-one relationship-set structure, but for more complex structures as well. >
Data Base Management, And Information Science, Information Handling, Computing, Modifications, Mathematical Logic 990300* -- Information Handling, 99 General And Miscellaneous//Mathematics, Algorithms, Algorithms 990300, Management
Data Base Management, And Information Science, Information Handling, Computing, Modifications, Mathematical Logic 990300* -- Information Handling, 99 General And Miscellaneous//Mathematics, Algorithms, Algorithms 990300, Management
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
