A Methodology of A Database Schema Design Using The Subschemas
|
|
- Randell Oliver
- 6 years ago
- Views:
Transcription
1 A Methodology of A Database Schema Design Using The Subschemas Ivan Luović University of Novi Sad, Faculty of Technical Sciences Novi Sad, Serbia and Montenegro ivan@iis.ns.ac.yu Sonja Ristić Business College Novi Sad Novi Sad, Serbia and Montenegro sdristic@uns.ns.ac.yu Pavle Mogin Victoria University of Wellington, School of Mathematical and Computing Sciences Wellington, New Zeland pmogin@mcs.vuw.ac.nz Abstract. The initial assumption is that a database schema is produced by the integration of simultaneously and independently designed subschemas. The notion of a subschema is defined using the concepts of the relational data model, according to the appropriate external schema, which is used to express a user view onto a future database, on the conceptual level. The process of simultaneous design of subschemas usually may lead to the collisions in expressing the real system constraints and business rules. If these collisions exist, some of the subschemas are not consistent in a formal sense with the database schema, which is obtained by the integration of a set of subschemas. The programs made over the inconsistent subschemas do not guarantee safe database updates. The aim of the paper is to present a process of a database schema design using the subschemas, that assure the design of the consistent subschemas and formally correct database schema. A common algorithm for checing of the constraint consistency between the database schema and subschemas, on the level of the same constraint type, is presented too. I. INTRODUCTION Some of the main problems of a database schema design are: i) how to define a set of attributes and a set of constraints that faithfully represent a real system and its business rules; ii) how to apply the complex techniques of a database schema design; and iii) how to overcome the limited perception power of a designer, when a real system is too complex. In order to relieve these problems or even overcome them, it is necessary to apply a methodological approach. A methodology of a database schema design using the subschemas is presented in the paper. After the identifying of groups of similar end users business tass, for each of these groups, an external schema is designed, as the first step of a database design process. An external schema is based on a data model, which is convenient for the conceptual design. [2]. It is difficult and sometimes even impossible to formalize the process of integration of external schemas. The quality of the resulting database schema highly depends on the designer's nowledge and sillfulness. On the contrary, a process of the integration of subschemas in the relational data model can be formalized and automated on the basis of the synthesis algorithm [2]. A subschema is defined by means of the concepts of the relational data model. It is designed using the appropriate external schema. By an integration of a set of subschemas, the potential database schema is created. If the collisions in expressing the real system constraints and business rules exist, between some subschemas, some of the subschemas are not consistent with the potential database schema in a formal sense. The subschema is a part of the transaction program specification. It represents a data structure over which a transaction program is executed. Operations of a transaction program should be executed against a database, directly. To allow safe database updates by a program made over the subschema, the subschema itself has to satisfy the conditions of the formal subschema and database schema consistency. The using of programs over the inconsistent subschemas may lead to logically incorrect database updates. One of the aims of the paper is to propose that the presented methodology of a database schema design can assure the design of the mutually consistent subschemas and formally correct database schema. The consistency conditions may be expressed for each type of constraint, separately. The paper also presents a common algorithm for the detection of constraint inconsistencies between the database schema and a subschema, on the level of the same constraint type. Apart from the Introduction and Conclusion, the paper has five sections. Section two formally introduces the notion of a subschema. Section three describes the principles of a database update using subschema concepts. The formal consistency conditions are presented in section four. Section five is concerned with the integration of subschemas, while a common algorithm for the detection of inconsistencies is presented in section six. II. THE NOTION OF A SUBSCHEMA A relational database schema is a pair (S, I), where S is a set of relation schemes and I is a set of interrelation constraints. It is supposed in the paper that the database schema is produced using a well-defined methodological approach. Each relation scheme from S is a named triple: N(R, C, K p (R)), where N is a unique name, R is an attribute set, and C is a specification of constraints. A relation scheme will be often referred simply by its name N. The specification of constraints C is a triple (K, τ (N), Uniq(N)), where K is a set of eys, τ (N) will be called tuple integrity constraint, and Uniq(N) is a (possible empty) set of uniqueness constraints Unique(N, X i ), where X i is a proper subset of R, which does not contain any ey from K. The tuple integrity constraint is a pair τ(n) = ({τ(n, A) A R}, Con(N)), whose first component contains attribute domain constraints τ(n, A) of each attribute A R. Each τ(n, A) is of the form τ(n, A) = (Dom(N, A), Null(N, A)), where Dom(N, A) is a domain constraint of attribute A R and Null(N, A) {, T} is a null-value constraint of A R. The second component of τ(n), Con(N) is a logical expression defined over the attributes from R and their domain
2 values. It must be satisfied by each tuple from an instance over N. A uniqueness constraint Unique(N, X i ) means that each non null value of X i must be unique in a relation over N. More details concerning the specification of constraints C may be found in [1]. K p (R) K denotes the primary ey of the relation scheme N. The interrelation constraint set I may contain various types of constraints, of which frequently used referential integrity constraint is just one. An external schema is a formal and abstract definition of data and constraints that are needed to mae a transaction program aimed at supporting the implementation of the end user business tass. It is based on a conceptual data model, lie ER model or a model based on the form types [3]. The external schemas are designed simultaneously and independently by a number of designers. On the basis of each external schema, the appropriate subschema is designed, using the relational data model. It consists of a set of relation schemas and a set of interrelation constraints. Each relation scheme of a subschema consists of a set of attributes and a set of local constraints. A role and a set of modifiable attributes are also assigned to each relation scheme. Formally, a subschema is a named pair P (S, I ), where P is a subschema name, S is a set of relation schemes, and I is a set of interrelation constraints. The set of relation schemes of a subschema P is S = {N i (R i, C i, K p (R i ), Role(P, N i ), Mod(P, N i )) i {1,..., n}}, where N i is a scheme name, R i is an attribute set, C i is a specification of relation constraints of the form (K i, τ (N i ), Uniq(N i )), where K i is a set of eys, τ (N i ) will be called tuple integrity constraint, and Uniq(N i ) is a (possible empty) set of uniqueness constraints Unique(N i, X i ), where X i is a proper subset of R i, which does not contain any ey from K i. The tuple integrity constraint τ(n i ) is a pair, whose first component contains attribute domain constraints of each attribute A R i. The second component of the pair is a logical expression defined over the attributes from R i and their domain values. K p (R i ) is a primary ey. The brief explanation of the relation constraint specifications is beyond the scope of the paper, and it can be found in [1], [2] and [3]. Role(P, N i ) is a set of relation scheme roles and defines the operations that may be performed on an instance of the relation scheme N i. Only these operations may be built into a transaction program made using the concepts of a subschema P. A set of relation scheme roles is a nonempty set, for which Role(P, N i ) {r, i, m, d} holds, where: r stands for data reading, i.e. referencing, i for insert, m for modification and d for data deleting. A subschema P is intended for database querying only if ( N i S )(Role(P, N i ) = {r}) holds. Otherwise, it is intended for updating, and querying. The set Mod(P, N i ) contains those attributes of the relation scheme N i that may be modified. If m Role(P, N i ), then Mod(P, N i ) must not equal. A subschema is a part of a program specification. The transaction program specification should be designed in a way to provide a development of a functionally correct transaction program. More information concerning the notion and the role of a subschema may be found in [1], [2], [3], [4] and [5]. Example 1. Let subschema P 1 is associated to a business process whose tas is to control domestic orders. It is aimed for entry of domestic orders and shipments within one transaction. In this process, users are not interested in customer data except in customer id. The specification of subschema P 1 follows. S 1 ={Order_d_s(R 1 1, C 1 1,...), Shipment(R 1 2, C 1 2,...)}; R 1 1 = {OrdId, OrDate, CustId, Origin, Total}; C 1 1 = ({{OrdId}}, τ( Order_d_s), ), K p (R 1 1 ) = {OrdId}; R 1 2 = {ShipId, OrdId, ShipDate, ShipTotal}; C 1 2 = ({{ShipId}}, τ(shipment), ); K p (R 1 1 ) = {ShipId}; Role(P 1, Order_d_s) = {i, r}, Role(P 1, Shipment) = {i, r}; Mod(P 1, Order_d_s) = Mod(P 1, Shipment) = ; I 1 = {Shipment[OrdId] Order_d_s [OrdId], Order_d_s [OrdId] Shipment[OrdId]}; The domain for attribute Origin in the relation scheme R 1 1 is dom(origin) = {d}. Its only one value d denotes domestic orders. P 1 also contains an inclusion dependency Order_d_s[OrdId] Shipment[OrdId]. These two constraints denote that the process related to the subschema P 1 deals only with shipped orders issued by a domestic customer. A database schema and a subschema contain the following concepts: A set of database schema attributes: U = U R j ; N S A set of subschema attributes: U = Sets of relation scheme attribute sets: U N i S j R i ; S = {R j j {1,..., t}}, for database schema; and S = {R i i {1,..., n}}, for subschema; and Sets of constraints: t O = I ( j j C ), for database schema; and = 1 n O = I ( C i= 1 i ), for subschema. The sets S and O determine the set of subschema P instances, whereas the sets S and O determine the set of database schema (S, I) instances. In the paper, O + will denote the set of all logical consequences of a set of constraints O and O + X will denote all the constraints from O +, which are defined using only the attributes from X.
3 III. ON THE SAFE DATABASE UPDATES A potential database schema is created by the integration of the designed set of subschemas. It is the relational database schema, which consists of a set of relation schemes and a set of interrelation constraints. The set of relation schemes is generated by the synthesis algorithm. The sets of relational and interrelational constraints are generated using the appropriate sets of subschema constraints. The process of simultaneous and independent design of each subschema may lead to the collisions in expressing the real system constraints and business rules, in the different subschemas. If the collisions between the different subschemas exist, then some of the subschemas are not consistent with the potential database schema in a formal sense. Consequently, the programs made over the inconsistent subschemas do not allow safe database updates, i.e. their using may lead to logically incorrect database updates. Accordingly, such a potential schema must not be considered as a resulting database schema, after the integration of the set of subschemas. The explanation of the notion of a safe database update follows. A subschema is a description of the data of a relatively small part of the database. Each relation scheme of a subschema may be considered as a view on a single database relation scheme. Subschema instances are not materialized. A subschema instance may be obtained as a result of the applying appropriate join, select and project operations on a database instance. A transaction program issues queries and updates that are executed by a database management system (DBMS). Let T be a transaction program based on subschema concepts, and let T be a transaction program that is equivalent to T, but based on database schema concepts. To consider database updates initiated by T as safe updates, the subschema and the database schema should satisfy the following two conditions at the abstraction level of instances. 1. A unique (hypothetical) subschema instance, named the corresponding subschema instance, may be produced by applying the appropriate relational join, project and select operations on a database schema instance; and 2. If an update of a hypothetical subschema instance issued by T would be successful, then T must be committed by DBMS. If a subschema is intended for queries only, it has to satisfy only Condition 1. In the paper, the aforementioned conditions are called the principles of a database update using subschema concepts. Their formal definition at the abstraction level of instances is given in [2] and [12]. A subschema that satisfies these conditions is said to be consistent with the corresponding database schema. Let P be the set of subschemas and let the potential database schema be the result of the integration of subschemas from P. The potential database schema, which is consistent with all of the subschemas from P, may be declared as a database schema. Example 2. Let us consider the subschema P 1 from Example 1, and a potential database schema (S, I). Let S be the result of the integration of P 1 and some other subschemas. The structure of those subschemas is not relevant in the example. S ={ORDER(R 1, C 1,...), SHIPMENT(R 2, C 2,...), CUSTOMER(R 3, C 3,...)}; R 1 = {OrdId, Ordate, CustId, Origin, Total}; C 1 = ({{OrdId}}, τ(order), ); K p (R 1 ) = {OrdId}; R 2 = {ShipId, OrdId, ShipDate, ShipTotal}; C 2 = ({{ShipId}}, τ(shipment), ); K p (R 2 ) = {ShipId}; R 3 = {CustId, CustName, CustAdrr}; C 3 = ({{CustId}}, τ(customer), ); K p (R 3 ) = {CustId}); I = {ORDER[CustId] CUSTOMER[CustId], SHIPMENT[OrdId] ORDER[OrdId], CUSTOMER[CustId] ORDER[CustId]}. P 1 and (S, I) satisfy Condition 1. For each relation scheme N 1 from P 1, there is a corresponding relation scheme N from S, such that R 1 R holds, where R 1 and R are the attribute sets of N 1 and N, respectively. The corresponding relation scheme for Order_d_s is ORDER, and SHIPMENT is the corresponding scheme for Shipment. Let T 1 be a transaction program based on the concepts of subschema P 1, aimed at insertion of tuples into an instance of Order_d_s. Let T be a transaction program that is equivalent to T 1, but based on the database schema concepts. T is aimed at tuple insertion in an instance of OR- DER, that is corresponding to an instance of Order_d_s. T 1 allows the insertion of a tuple with any domain value for the attribute CustId. Suppose that an instance over Order_d_s is successfully updated by T 1, in such a way that the database relation CUSTOMER does not contain a tuple with the given CustId value. However, the set of database constraints contains the referential integrity constraint ORD- ER[CustId] CUSTOMER[CustId]. The transaction program T would reject the equivalent transaction over the database instance. Otherwise, this constraint would be violated. Thus, there is an example of the successful update of a hypothetical subschema instance executed by T 1, which would not be committed by a DBMS. Consequently, P 1 is not consistent with the potential database schema (S, I), and (S, I) cannot be declared as a database schema. IV. THE FORMAL CONSISTENCY A subschema and a database schema are formally consistent if: 1. The set of attributes, for each subschema relation scheme, is a subset of the corresponding relation scheme attribute set; 2. Each set of attributes X with a unique value property (as it is defined in [1] and [2]) in a subschema relation scheme has the same property in the corresponding database relation scheme; and
4 3. All the constraints that can be inferred from the database schema and that are relevant for the subschema are embedded into it. A formalization of the first and the second condition can be found in [2]. Their satisfying is a prerequisite for the validation of the third condition, which can be expressed by the logical implication: (1) O = O r P, where O is the set of all constraints of the subschema P, and O r P is the set of all database schema constraints that are relevant for P. The most important components of the specification of a constraint o O are expressed by a set T(o) in the following way: T(o) = {(N 1, ρ 1, At 1, {(op 1 i 1, act 1 i 1 ) i 1 1}),..., (N m, ρ m, At m, {(op m i m, act m i m ) i m 1})}. In the four-tuple (N j, ρ j, At j, {(op j i j, act j i j ) i j 1}), N j is the name of a relation scheme that is spanned by o, ρ j {referenced, referencing,...} is the role of N j in o, At j is a set or sequence of attributes from R j that are relevant for o, and {(op j i j, act j i j ) i j 1} is a set of pairs (critical operation, activity). An attribute A is relevant for o if o is used to chec values of A. An operation op j i j {insert, delete, update} is a critical if it can violate a constraint and act j i j {NoAction, Cascade, SetDefault, SetNull} is an activity for preserving data consistency in an attempt of its violation. A constraint o should belong to the set of relevant constraints for subschema P (S, I ), if the operation that might violate o is allowed in P. There are two inds of relevant constraints: The inclusive, denoted by Ini(O, P ); and The extensible, denoted by Exi(O, P ). Suppose a constraint o O + is relevant for subschema P. that satisfies Conditions 1. and 2. The constraint o belongs to Ini(O, P ) if it can be expressed by the concepts of subschema P. It means that for each relation scheme N j appearing in T(o) there is a subschema relation scheme N i S, such that R i R j and At j R i hold. A constraint o belongs to Exi(O, P ) if and only if it is relevant for P, and o Ini(O, P ) holds. Definition 1. A subschema P is formally consistent with a database schema if Conditions 1. and 2. hold, and if the following conditions are satisfied: (2) O = Ini(O, P ), (3) Exi(O, P ) =. It is proved in [2] that the formal consistency of a subschema and a database schema is the necessary condition for the satisfaction of the update principles. It leads to the conclusion that a database schema design process should adhere to formal consistency conditions to assure the design of the consistent subschemas and formally correct database schema. V. THE INTEGRATION OF SUBSCHEMAS A general solution of the implicational problem in the presence of different constraint types is very hard to find, if even possible. Testing the satisfaction of the formal consistency may be relaxed by considering the implicational problem for various constraint types separately. We believe that this approach relaxed in that way, may lead to a good database schema design practice. After the potential database schema is created, the automatic detection of the collisions is performed. Then, the designers are directed to redesign formally incorrect external schemas. The process is iterative. It will stop when the collisions do not exist any more. The procedure of the database schema integration is outlined in Figure 1. The set of external schemas The set of subschemas Information requests The specifications (diagrams) of processes and dataflows Potential database schema NO The formal consistecy? Implementation database schema The definition of the database schema and internal schema in DDL The set of conceptual specifications of transaction programs and aplications YES Internal database schema The set of implemention specifications of transaction programs and aplications Figure 1. The elements of the database schema integration VI. AN ALGORITHM FOR THE DETECTION OF INCONSISTENCIES A common algorithm for the detection of constraint inconsistencies between the subschema and the database schema on the level of the same constraint type, named DCI algorithm, is presented in Figure 2. Ini(O, T, P ) denotes the set of inclusive relevant constraints, of the specified constraint type T, for subschema P, while Exi(O, T, P ) denotes the set of extensible relevant constraints of the type T, for P. Ini(O, T, P ) contains database constraints that can be expressed by the concepts of subschema P. To each o Ini(O, T, P ), the function tc(o, P ) associates a corresponding constraint, expressed by means of the concepts of the subschema P.
5 THE ALGORITHM FOR THE DETECTION OF CONSTRAINT INCONSISTENCES Input: T, A constraint type {O T P P}, O T - a set of globally valid constraints of the subschema P of a given type T; P - a set of all subschemas. O T A set of database schema constraints, of a given type T Output: Po, a set of potentially inconsistent constraints Psh, a set of triples (P, o, A) P - potentially inconsistent subschema, o - the database schema constraint, causing P being potentially inconsistent, A {T, }, T if P contains o; - if P does not contain o Error, a Boolean indicator, T the process of the design has to be stopped; the process is going on BEGIN PROCESS consistency_checing Po Psh DO subschema_checing ( P P) DO ini_constraint_checing ( o Ini(O, T, P )) IF tc(o, P ) (O T ) + THEN Po Po {o} Psh Psh {(P, o, )} END DO ini_constraint_checing DO exi_constraint_checing ( o Exi(O, T, P )) Po Po {o} Psh Psh {(P, o, )} END DO exi_constraint_checing END DO subschema_checing IF Po = THEN Error ELSE DO if_inconsistent_subschema ( P P) DO for_constraint ( o Po \ {o Po (P, o, ) Psh}) IF o O T S THEN IF tc(o, P ) (O T ) + THEN Psh Psh {(P, o, T)} END DO for_constraint END DO if_inconsistent_subschema Error T END PROCESS consistency_checing Figure 2. The pseudo code of DCI Algorithm A subschema P is potentially inconsistent with the database schema if: (4) ( o Ini(O T, T, P ))( (O T = o)); or (5) Exi(O T, T, P ). A database constraint o for which o Ini(O T, T, P ) and (O T = o) holds, or o Exi(O T, T, P ) holds, for any subschema P, is potentially inconsistent. For each potentially inconsistent constraint, the designer has to decide if it should be embodied into the database schema. If the decision is positive, the potentially inconsistent constraint must be embodied into all the subschemas, for which it is relevant. Otherwise, a potentially inconsistent constraint must not be embodied into the set of database constraints. It must be emphasized that subschema constraints may be stronger, but not weaer than the corresponding database constraints. Consequently, some of the subschema constraints may not be embodied into the database schema. A subschema constraint is considered as locally valid if it is embodied into the subschema, but it must not be embodied into a database schema. Subschema constraints that are embodied into a database schema are considered as globally valid. Let us consider a potentially inconsistent constraint and the subschema into which it has already been embodied as a relevant one. There are two possible solutions: the potentially inconsistent constraint may be excluded from the subschema; or it may be pronounced as a locally valid constraint for the subschema. In the first step of the integration process, all subschema constraints are pronounced as globally valid. In the subsequent iterations some of them may be pronounced as locally valid. Finally, it can be concluded that there are three possible inds of relationships between a subschema P and a potentially inconsistent database constraint o. A potentially inconsistent constraint o is not relevant for P, and consequently, P is not potentially inconsistent with a database schema, with respect to o. The designer need not redesign the subschema P, but probably need redesign some other subschema. A potentially inconsistent constraint o is relevant for P, but it is not embodied into the set of subschema constraints of P. P is potentially inconsistent and the designer may redesign it by embedding o into its set of constraints. A potentially inconsistent constraint o is relevant for P and it is embodied into the set of subschema constraints of P, but there is some other P l, for which o is also potentially inconsistent, but not embodied into it. P has "carried" o into the set of database constraints. Accordingly, P is potentially inconsistent. A designer may redesign it by excluding o from its set of constraints or by pronouncing o as a locally valid constraint for the subschema P. VII. CONCLUSION The most important advantages of the presented concept of a database schema design using the subschemas are: A set of user requests is divided into the groups of similar end users business tass to reduce the complexity of
6 real system and to overcome the limited perception power of designers; For each of those tas groups, an external schema is designed using a data model convenient for conceptual design, to relieve the problem of the defining a set of attributes and a set of constraints that faithfully represent a real system and its business rules; A subschema is defined using the concepts of the relational data model, according to the appropriate external schema. The potential database schema is created by the integration of the designed set of subschemas. Relational data model enables the automatization of the process of subschema integration. Consequently, the designers should concentrate on the semantics concerning the design of the external schemas, rather than on formal problems and complex techniques of the design of an integrated database schema. The relationship between a database schema and a subschema is formalized by the notion of database update principles and the formal consistency of a subschema and the database schema. The formal consistency is a necessary condition for the database update principles. A subschema is a component of the transaction program specification. Thus, the process of its design should adhere to the formal consistency conditions. One of the consequences is that the set of subschema constraints must imply all those database schema constraints that might be violated by the allowed update operations of the subschema. Checing the formal consistency is relaxed by considering the implicational problem for each constraint type separately. The common algorithm for the detection of constraint inconsistencies between the database schema and a subschema, presented in the paper, operates on the level of the same constraint type. A future wor should lead towards: the sufficient conditions that will imply the database update principles; and some specific algorithms for different constraint types based on the common algorithm, presented in the paper. VIII. REFERENCES [1] Luović I., Mogin P., Govedarica M., Ristić S., "The Structure of A Subschema and Its XML Specification", in Proceedings of the XIII International Conference on Information and Intelligent Systems, Varaždin, Croatia, September 2002, pp [2] Ristić S., A Research of Subschema Consolidation Problem, PhD Thesis, University of Novi Sad, Faculty of Economics, Subotica, Yugoslavia, [3] Mogin P., Luović I., Govedarica M., Database Design Principles, University of Novi Sad, Faculty of Technical Sciences & MP "Stylos", Novi Sad, Yugoslavia, [4] Luović I., Mogin P., "On The Role of Subschema as A Component of The Implementation Specification of A Program", in Proceedings of the VI Symposium on Computer Science and Information Technologies YUINFO, Kopaoni, Yugoslavia, March 2000, on CD ROM. [5] Mogin P., Luović I., "An Approach to Database Design", International Journal of INDUSTRIAL SYS- TEMS, Vol. 1, No. 2, Novi Sad, Yugoslavia, December 1999, pp [6] Codd E. F., The Relational Model for Database Management Version 2, Addison-Wesley-Publishing- Company, USA, [7] Langera R., "View Updates in Relational Databases with An Independent Scheme", ACM Transactions on Database Systems, Vol. 15, No. 1, 1990, pp [8] Dayal U., Bernstein P., "On the Correct Translation of Updates on the Relational Views", ACM Transactions on Database Systems, Vol. 8, No. 3, 1988, pp [9] Bancilhon F., Spyratos N., "Update Semantics of Relational Views", ACM Transactions on Database Systems, Vol. 6, No. 4, 1981, pp [10] Luović I., Mogin P., Ristić S., "A Database Schema Design Using The Subschemas", in Proceedings of the XII International Conference Industrial Systems IS 2002, November 22-23, 2002, Vrnjaca Banja, Yugoslavia, pp [11] Ristić S., Luović I., Mogin P., "The Detection of Database Constraint Inconsistencies", in Proceedings of the XII International Conference Industrial Systems IS 2002, November 22-23, 2002, Vrnjaca Banja, Yugoslavia, pp [12] Ristić S., Mogin P., Luović I., "Specifying Database Updates Using A Subschema", in Proceedings of the VII International Conference On Intelligent Engineering Systems INES 2003, March 4-6, 2003, Assiut- Luxor, Egypt, pp
On The Formal Specification of Database Schema Constraints
On The Formal Specification of Database Schema Constraints Ivan Luković University of Novi Sad, Faculty of Technical Sciences Novi Sad, Serbia and Montenegro ivan@uns.ns.ac.yu Sonja Ristić Higher Business
More informationRESOLVING DATABASE CONSTRAINT COLLISIONS USING IIS*CASE TOOL
UDK 004.651 Original scientific paper RESOLVING DATABASE CONSTRAINT COLLISIONS USING IIS*CASE TOOL 1, 2, 3, 4 Pavle Mogin 1,2 University of Novi Sad, Faculty of Technical Sciences, Serbia {ivan, sdristic}@uns.ns.ac.yu
More informationA Generator of SQL Schema Specifications
A Generator of SQL Schema Specifications Slavica Aleksić 1, Ivan Luković 1, Pavle Mogin 2, Miro Govedarica 1 1 University of Novi Sad, Faculty of Technical Sciences, 21000 Novi Sad, Trg Dositeja Obradovića
More informationAn approach to developing complex database schemas using form types
SOFTWARE PRACTICE AND EXPERIENCE Published online 29 May 2007 in Wiley InterScience (www.interscience.wiley.com)..820 An approach to developing complex database schemas using form types Ivan Luković 1,,,
More informationExtended Tuple Constraint Type as a Complex Integrity Constraint Type in XML Data Model Definition and Enforcement *
Computer Science and Information Systems 15(3):821 843 https://doi.org/10.2298/csis180324029v Extended Tuple Constraint Type as a Complex Integrity Constraint Type in XML Data Model Definition and Enforcement
More informationAn Approach to Generating Server Implementation of the Inverse Referential Integrity Constraints Slavica Aleksić #1, Sonja Ristić *2, Ivan Luković #3
An Approach to Generating Server Implementation of the Inverse Referential Integrity Constraints Slavica Aleksić #1, Sonja Ristić *2, Ivan Luković #3 # University of Novi Sad, Faculty of Technical Sciences,
More informationINCONSISTENT DATABASES
INCONSISTENT DATABASES Leopoldo Bertossi Carleton University, http://www.scs.carleton.ca/ bertossi SYNONYMS None DEFINITION An inconsistent database is a database instance that does not satisfy those integrity
More informationRelational Model, Relational Algebra, and SQL
Relational Model, Relational Algebra, and SQL August 29, 2007 1 Relational Model Data model. constraints. Set of conceptual tools for describing of data, data semantics, data relationships, and data integrity
More informationCREATING CUSTOMIZED DATABASE VIEWS WITH USER-DEFINED NON- CONSISTENCY REQUIREMENTS
CREATING CUSTOMIZED DATABASE VIEWS WITH USER-DEFINED NON- CONSISTENCY REQUIREMENTS David Chao, San Francisco State University, dchao@sfsu.edu Robert C. Nickerson, San Francisco State University, RNick@sfsu.edu
More informationDatabase Management System 9
Database Management System 9 School of Computer Engineering, KIIT University 9.1 Relational data model is the primary data model for commercial data- processing applications A relational database consists
More informationUpdates through Views
1 of 6 15 giu 2010 00:16 Encyclopedia of Database Systems Springer Science+Business Media, LLC 2009 10.1007/978-0-387-39940-9_847 LING LIU and M. TAMER ÖZSU Updates through Views Yannis Velegrakis 1 (1)
More information"Relations for Relationships"
M359 An explanation from Hugh Darwen "Relations for Relationships" This note might help those who have struggled with M359's so-called "relation for relationship" method of representing, in a relational
More informationQuery Rewriting Using Views in the Presence of Inclusion Dependencies
Query Rewriting Using Views in the Presence of Inclusion Dependencies Qingyuan Bai Jun Hong Michael F. McTear School of Computing and Mathematics, University of Ulster at Jordanstown, Newtownabbey, Co.
More informationComputational Complexity of Multi-way, Dataflow Constraint Problems
Computational Complexity of Multi-way, Dataflow Constraint Problems Gilles Trombettoni and Bertrand Neveu Projet Contraintes, CERMICS/INRIA, 2004 route des lucioles, 06902 Sophia-Antipolis Cedex, B.P.
More informationSpecifying Database Updates Using A Subschema
Specfyng Database Updates Usng A Subschema Sona Rstć, Pavle Mogn 2, Ivan Luovć 3 Busness College, V. Perća 4, 2000 Nov Sad, Yugoslava sdrstc@uns.ns.ac.yu 2 Vctora Unversty of Wellngton, School of Mathematcal
More informationARELAY network consists of a pair of source and destination
158 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 55, NO 1, JANUARY 2009 Parity Forwarding for Multiple-Relay Networks Peyman Razaghi, Student Member, IEEE, Wei Yu, Senior Member, IEEE Abstract This paper
More information6. Relational Algebra (Part II)
6. Relational Algebra (Part II) 6.1. Introduction In the previous chapter, we introduced relational algebra as a fundamental model of relational database manipulation. In particular, we defined and discussed
More informationAn Architecture for Semantic Enterprise Application Integration Standards
An Architecture for Semantic Enterprise Application Integration Standards Nenad Anicic 1, 2, Nenad Ivezic 1, Albert Jones 1 1 National Institute of Standards and Technology, 100 Bureau Drive Gaithersburg,
More informationDesigning Views to Answer Queries under Set, Bag,and BagSet Semantics
Designing Views to Answer Queries under Set, Bag,and BagSet Semantics Rada Chirkova Department of Computer Science, North Carolina State University Raleigh, NC 27695-7535 chirkova@csc.ncsu.edu Foto Afrati
More informationThe Basic (Flat) Relational Model. Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
The Basic (Flat) Relational Model Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 3 Outline The Relational Data Model and Relational Database Constraints Relational
More informationITCS 3160 DATA BASE DESIGN AND IMPLEMENTATION
ITCS 3160 DATA BASE DESIGN AND IMPLEMENTATION JING YANG 2010 FALL Class 3: The Relational Data Model and Relational Database Constraints Outline 2 The Relational Data Model and Relational Database Constraints
More informationFigure 1.1: This is an illustration of a generic set and its elements.
Chapter 1 Mathematical Review et theory is now generally accepted as the foundation of modern mathematics, and it plays an instrumental role in the treatment of probability. Unfortunately, a simple description
More informationFORM-DRIVEN APPLICATION DEVELOPMENT
Acta Electrotechnica et Informatica, Vol. 12, No. 1, 2012, 9 16, DOI: 10.2478/v10198-012-0002-x 9 FORM-DRIVEN APPLICATION DEVELOPMENT Sonja RISTIC *, Slavica ALEKSIC *, Ivan LUKOVIC *, Jelena BANOVIC **
More informationRelational Design: Characteristics of Well-designed DB
1. Minimal duplication Relational Design: Characteristics of Well-designed DB Consider table newfaculty (Result of F aculty T each Course) Id Lname Off Bldg Phone Salary Numb Dept Lvl MaxSz 20000 Cotts
More informationThe Data Organization
C V I T F E P A O TM The Data Organization 1251 Yosemite Way Hayward, CA 94545 (510) 303-8868 info@thedataorg.com By Rainer Schoenrank Data Warehouse Consultant May 2017 Copyright 2017 Rainer Schoenrank.
More informationBIRKBECK (University of London)
BIRKBECK (University of London) BSc Examination for Internal Students School of Computer Science and Information Systems Database Management COIY028U - Course Unit Value: 1/2 May 2006 : Afternoon 14.30
More informationAlgorithms for the Construction of Digital Convex Fuzzy Hulls
lgorithms for the Construction of Digital Convex Fuzzy Hulls Nebojša M. Ralević Faculty of Engineering, University of Novi Sad Trg Dositeja Obradovića 6, 000 Novi Sad, Serbia nralevic@uns.ns.ac.yu Lidija
More informationDatabase Management Systems Paper Solution
Database Management Systems Paper Solution Following questions have been asked in GATE CS exam. 1. Given the relations employee (name, salary, deptno) and department (deptno, deptname, address) Which of
More informationDatabase Management System Prof. Partha Pratim Das Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur
Database Management System Prof. Partha Pratim Das Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture - 19 Relational Database Design (Contd.) Welcome to module
More informationIntroduction to Databases, Fall 2005 IT University of Copenhagen. Lecture 2: Relations and SQL. September 5, Lecturer: Rasmus Pagh
Introduction to Databases, Fall 2005 IT University of Copenhagen Lecture 2: Relations and SQL September 5, 2005 Lecturer: Rasmus Pagh Today s lecture What, exactly, is the relational data model? What are
More informationJustification for Inclusion Dependency Normal Form
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 12, NO. 2, MARCH/APRIL 2000 281 Justification for Inclusion Dependency Normal Form Mark Levene and Millist W. Vincent AbstractÐFunctional dependencies
More informationDatabase Systems Relational Model. A.R. Hurson 323 CS Building
Relational Model A.R. Hurson 323 CS Building Relational data model Database is represented by a set of tables (relations), in which a row (tuple) represents an entity (object, record) and a column corresponds
More informationByzantine Consensus in Directed Graphs
Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory
More informationA Semi-group of Hashing Functions & Hash Tables
A Semi-group of Hashing Functions & Hash Tables Arthur Hughes University of Dublin, Trinity College, Dublin, Ireland e-mail: Arthur.P.Hughes@cs.tcd.ie January 19, 1997 Abstract A model of a hash table
More informationLecture : Topological Space
Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous
More informationRough Connected Topologized. Approximation Spaces
International Journal o Mathematical Analysis Vol. 8 04 no. 53 69-68 HIARI Ltd www.m-hikari.com http://dx.doi.org/0.988/ijma.04.4038 Rough Connected Topologized Approximation Spaces M. J. Iqelan Department
More informationRelational Model Concepts
Relational Model Relational Model Concepts The relational model of data is based on the concept of a Relation. A relation is a mathematical concept based on the idea of sets. Relational Model The model
More informationLecture 8. Database Management and Queries
Lecture 8 Database Management and Queries Lecture 8: Outline I. Database Components II. Database Structures A. Conceptual, Logical, and Physical Components III. Non-Relational Databases A. Flat File B.
More informationThe Structure of A Subschema and Its XML Specification
The Structure of A Subschema and Its XML Specfcaton Ivan Lukovć Unversty of Nov Sad, Yugoslava Faculty of Techncal Scences, Nov Sad van@s.ns.ac.yu Pavle Mogn Vctora Unversty of Wellngton, New Zeland School
More informationFunctional Dependency: Design and Implementation of a Minimal Cover Algorithm
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 19, Issue 5, Ver. I (Sep.- Oct. 2017), PP 77-81 www.iosrjournals.org Functional Dependency: Design and Implementation
More informationTowards a Logical Reconstruction of Relational Database Theory
Towards a Logical Reconstruction of Relational Database Theory On Conceptual Modelling, Lecture Notes in Computer Science. 1984 Raymond Reiter Summary by C. Rey November 27, 2008-1 / 63 Foreword DB: 2
More informationCS 377 Database Systems
CS 377 Database Systems Relational Data Model Li Xiong Department of Mathematics and Computer Science Emory University 1 Outline Relational Model Concepts Relational Model Constraints Relational Database
More informationis easing the creation of new ontologies by promoting the reuse of existing ones and automating, as much as possible, the entire ontology
Preface The idea of improving software quality through reuse is not new. After all, if software works and is needed, just reuse it. What is new and evolving is the idea of relative validation through testing
More informationA Framework for Enforcing Constrained RBAC Policies
A Framework for Enforcing Constrained RBAC Policies Jason Crampton Information Security Group Royal Holloway, University of London jason.crampton@rhul.ac.uk Hemanth Khambhammettu Information Security Group
More informationRelational Databases
Relational Databases Jan Chomicki University at Buffalo Jan Chomicki () Relational databases 1 / 49 Plan of the course 1 Relational databases 2 Relational database design 3 Conceptual database design 4
More informationRelational Data Model
Relational Data Model 1. Relational data model Information models try to put the real-world information complexity in a framework that can be easily understood. Data models must capture data structure
More informationDatabase Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No.
Database Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No. # 3 Relational Model Hello everyone, we have been looking into
More information8) A top-to-bottom relationship among the items in a database is established by a
MULTIPLE CHOICE QUESTIONS IN DBMS (unit-1 to unit-4) 1) ER model is used in phase a) conceptual database b) schema refinement c) physical refinement d) applications and security 2) The ER model is relevant
More informationIMPROVING THE RELEVANCY OF DOCUMENT SEARCH USING THE MULTI-TERM ADJACENCY KEYWORD-ORDER MODEL
IMPROVING THE RELEVANCY OF DOCUMENT SEARCH USING THE MULTI-TERM ADJACENCY KEYWORD-ORDER MODEL Lim Bee Huang 1, Vimala Balakrishnan 2, Ram Gopal Raj 3 1,2 Department of Information System, 3 Department
More informationAutomatic flow analysis using symbolic execution and path enumeration
Automatic flow analysis using symbolic execution path enumeration D. Kebbal Institut de Recherche en Informatique de Toulouse 8 route de Narbonne - F-62 Toulouse Cedex 9 France Djemai.Kebbal@iut-tarbes.fr
More informationChapter 6: RELATIONAL DATA MODEL AND RELATIONAL ALGEBRA
Chapter 6: Relational Data Model and Relational Algebra 1 Chapter 6: RELATIONAL DATA MODEL AND RELATIONAL ALGEBRA RELATIONAL MODEL CONCEPTS The relational model represents the database as a collection
More informationSQL: A COMMERCIAL DATABASE LANGUAGE. Complex Constraints
SQL: A COMMERCIAL DATABASE LANGUAGE Complex Constraints Outline 1. Introduction 2. Data Definition, Basic Constraints, and Schema Changes 3. Basic Queries 4. More complex Queries 5. Aggregate Functions
More informationDatabase Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No.
Database Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No. # 13 Constraints & Triggers Hello and welcome to another session
More informationCS530 Database Architecture Models. Database Model. Prof. Ian HORROCKS. Dr. Robert STEVENS. and Design The Relational
02 - The Relational Database Model CS530 Database Architecture Models and Design Prof. Ian HORROCKS Dr. Robert STEVENS In this Section Topics Covered The basics of the relational model in the context of
More information2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes
2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or
More informationRelational model continued. Understanding how to use the relational model. Summary of board example: with Copies as weak entity
COS 597A: Principles of Database and Information Systems Relational model continued Understanding how to use the relational model 1 with as weak entity folded into folded into branches: (br_, librarian,
More information"Charting the Course... Agile Database Design Techniques Course Summary
Course Summary Description This course provides students with the skills necessary to design databases using Agile design techniques. It is based on the Scott Ambler book Agile Database Techniques: Effective
More informationDatabases. Jörg Endrullis. VU University Amsterdam
Databases Jörg Endrullis VU University Amsterdam The Relational Model Overview 1. Relational Model Concepts: Schema, State 2. Null Values 3. Constraints: General Remarks 4. Key Constraints 5. Foreign Key
More informationCS275 Intro to Databases
CS275 Intro to Databases The Relational Data Model Chap. 3 How Is Data Retrieved and Manipulated? Queries Data manipulation language (DML) Retrieval Add Delete Update An Example UNIVERSITY database Information
More informationSchema Refinement: Dependencies and Normal Forms
Schema Refinement: Dependencies and Normal Forms Grant Weddell Cheriton School of Computer Science University of Waterloo CS 348 Introduction to Database Management Spring 2016 CS 348 (Intro to DB Mgmt)
More informationLAB 3 Notes. Codd proposed the relational model in 70 Main advantage of Relational Model : Simple representation (relationstables(row,
LAB 3 Notes The Relational Model Chapter 3 In the previous lab we discussed the Conceptual Database Design Phase and the ER Diagram. Today we will mainly discuss how to convert an ER model into the Relational
More informationMOLAP Data Warehouse of a Software Products Servicing Call Center
MOLAP Data Warehouse of a Software Products Servicing Call Center Z. Kazi, B. Radulovic, D. Radovanovic and Lj. Kazi Technical faculty "Mihajlo Pupin" University of Novi Sad Complete Address: Technical
More informationThe Relational Model
The Relational Model UVic C SC 370, Fall 2002 Daniel M. German Department of Computer Science University of Victoria 3 1 The Relational Model CSC 370 dmgerman@uvic.ca Overview How is data represented in
More informationA Novel Method for the Comparison of Graphical Data Models
3RD INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS DEVELOPMENT (ISD01 CROATIA) A Novel Method for the Comparison of Graphical Data Models Katarina Tomičić-Pupek University of Zagreb, Faculty of Organization
More informationVerbalizing Business Rules: Part 9
Verbalizing Business Rules: Part 9 Terry Halpin Northface University Business rules should be validated by business domain experts, and hence specified using concepts and languages easily understood by
More informationThe Relational Data Model and Relational Database Constraints
CHAPTER 5 The Relational Data Model and Relational Database Constraints Copyright 2017 Ramez Elmasri and Shamkant B. Navathe Slide 1-2 Chapter Outline Relational Model Concepts Relational Model Constraints
More informationWhere Are We? Next Few Lectures. Integrity Constraints Motivation. Constraints in E/R Diagrams. Keys in E/R Diagrams
Where Are We? Introduction to Data Management CSE 344 Lecture 15: Constraints We know quite a bit about using a DBMS Start with real-world problem, design ER diagram From ER diagram to relations -> conceptual
More information2. An implementation-ready data model needn't necessarily contain enforceable rules to guarantee the integrity of the data.
Test bank for Database Systems Design Implementation and Management 11th Edition by Carlos Coronel,Steven Morris Link full download test bank: http://testbankcollection.com/download/test-bank-for-database-systemsdesign-implementation-and-management-11th-edition-by-coronelmorris/
More informationSQL DATA DEFINITION LANGUAGE
SQL DATA DEFINITION LANGUAGE DATABASE SCHEMAS IN SQL SQL is primarily a query language, for getting information from a database. DML: Data Manipulation Language SFWR ENG 3DB3 FALL 2016 MICHAEL LIUT (LIUTM@MCMASTER.CA)
More informationSchema Refinement: Dependencies and Normal Forms
Schema Refinement: Dependencies and Normal Forms M. Tamer Özsu David R. Cheriton School of Computer Science University of Waterloo CS 348 Introduction to Database Management Fall 2012 CS 348 Schema Refinement
More informationDomain Constraints Referential Integrity Assertions Triggers. Authorization Authorization in SQL
Chapter 6: Integrity and Security Domain Constraints Referential Integrity Assertions Triggers Security Authorization Authorization in SQL 6.1 Domain Constraints Integrity constraints guard against accidental
More informationIntroduction to Database Systems (1)
Introduction to Database Systems (1) SWEN 304 Trimester 1, 2018 Lecturer: Dr Hui Ma Engineering and Computer Science slides by: Pavle Mogin & Hui Ma Outline Fundamental assumptions Databases (DB) and data
More informationCSE 444, Winter 2011, Midterm Examination 9 February 2011
Name: CSE 444, Winter 2011, Midterm Examination 9 February 2011 Rules: Open books and open notes. No laptops or other mobile devices. Please write clearly. Relax! You are here to learn. An extra page is
More informationThe Relational Model
The Relational Model UVic C SC 370, Fall 2002 Daniel M. German Department of Computer Science University of Victoria September 25, 2002 Version: 1.03 3 1 The Relational Model (1.03) CSC 370 dmgerman@uvic.ca
More informationCHAPTER 6 DATABASE MANAGEMENT SYSTEMS
CHAPTER 6 DATABASE MANAGEMENT SYSTEMS Management Information Systems, 10 th edition, By Raymond McLeod, Jr. and George P. Schell 2007, Prentice Hall, Inc. 1 Learning Objectives Understand the hierarchy
More informationUNIT I. Introduction
UNIT I Introduction Objective To know the need for database system. To study about various data models. To understand the architecture of database system. To introduce Relational database system. Introduction
More informationThe Relational Data Model. Data Model
The Relational Data Model Davood Rafiei *Disclaimer: The slides used in the course may contain some of the slides provided by the authors of the adopted textbook (present and past) and those used in previous
More informationJoint Entity Resolution
Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute
More informationIllustrative Example of Logical Database Creation
Illustrative Example of Logical Database Creation A small RAQUEL DB is created to illustrate what is involved as regards the logical schemas of a RAQUEL DB. Create a Database or ExampleDB
More informationSQL DATA DEFINITION LANGUAGE
9/27/16 DATABASE SCHEMAS IN SQL SQL DATA DEFINITION LANGUAGE SQL is primarily a query language, for getting information from a database. SFWR ENG 3DB3 FALL 2016 But SQL also includes a data-definition
More informationLecture 03. Spring 2018 Borough of Manhattan Community College
Lecture 03 Spring 2018 Borough of Manhattan Community College 1 2 Outline 1. Brief History of the Relational Model 2. Terminology 3. Integrity Constraints 4. Views 3 History of the Relational Model The
More informationE-R Model. Hi! Here in this lecture we are going to discuss about the E-R Model.
E-R Model Hi! Here in this lecture we are going to discuss about the E-R Model. What is Entity-Relationship Model? The entity-relationship model is useful because, as we will soon see, it facilitates communication
More informationCOSC344 Database Theory and Applications. σ a= c (P) Lecture 3 The Relational Data. Model. π A, COSC344 Lecture 3 1
COSC344 Database Theory and Applications σ a= c (P) S P Lecture 3 The Relational Data π A, C (H) Model COSC344 Lecture 3 1 Overview Last Lecture Database design ER modelling This Lecture Relational model
More informationIntroduction to Information Systems
Table of Contents 1... 2 1.1 Introduction... 2 1.2 Architecture of Information systems... 2 1.3 Classification of Data Models... 4 1.4 Relational Data Model (Overview)... 8 1.5 Conclusion... 12 1 1.1 Introduction
More informationAnalysis of Query Processing and Optimization
Analysis of Query Processing and Optimization Nimra Memon, Muhammad Saleem Vighio, Shah Zaman Nizamani, Niaz Ahmed Memon, Adeel Riaz Memon, Umair Ramzan Shaikh Abstract Modern database management systems
More informationRelational Theory and Data Independence: Unfinished Business. Logical Data Independence and the CREATE VIEW Statement.
Relational Theory and Data Independence: Unfinished Business. Dr. Tom Johnston Much has been made of the data independence that relational technology is said to provide. And indeed, much has been accomplished
More informationThe Relational Model. Chapter 3. Comp 521 Files and Databases Fall
The Relational Model Chapter 3 Comp 521 Files and Databases Fall 2012 1 Why Study the Relational Model? Most widely used model by industry. IBM, Informix, Microsoft, Oracle, Sybase, etc. It is simple,
More informationThe Relational Model
The Relational Model What is the Relational Model Relations Domain Constraints SQL Integrity Constraints Translating an ER diagram to the Relational Model and SQL Views A relational database consists
More informationIllustrative Example of Logical Database Creation
Illustrative Example of Logical Database Creation A small RAQUEL DB is created to illustrate what is involved as regards the logical schemas of a RAQUEL DB. Create a Database or ExampleDB
More informationCHAPTER 2: DATA MODELS
CHAPTER 2: DATA MODELS 1. A data model is usually graphical. PTS: 1 DIF: Difficulty: Easy REF: p.36 2. An implementation-ready data model needn't necessarily contain enforceable rules to guarantee the
More informationCopyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Chapter 6 Outline. Unary Relational Operations: SELECT and
Chapter 6 The Relational Algebra and Relational Calculus Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 6 Outline Unary Relational Operations: SELECT and PROJECT Relational
More informationRevision of Inconsistent Orthographic Views
Journal for Geometry and Graphics Volume 2 (1998), No. 1, 45 53 Revision of Inconsistent Orthographic Views Takashi Watanabe School of Informatics and Sciences, Nagoya University, Nagoya 464-8601, Japan
More informationTowards the Preservation of Referential Constraints in XML Data Transformation for Integration
Towards the Preservation of Referential Constraints in XML Data Transformation for Integration Md. Sumon Shahriar and Jixue Liu Data and Web Engineering Lab School of Computer and Information Science University
More informationA Mechanism for Sequential Consistency in a Distributed Objects System
A Mechanism for Sequential Consistency in a Distributed Objects System Cristian Ţăpuş, Aleksey Nogin, Jason Hickey, and Jerome White California Institute of Technology Computer Science Department MC 256-80,
More informationXQuery Optimization Based on Rewriting
XQuery Optimization Based on Rewriting Maxim Grinev Moscow State University Vorob evy Gory, Moscow 119992, Russia maxim@grinev.net Abstract This paper briefly describes major results of the author s dissertation
More informationA Bottom-up Strategy for Query Decomposition
A Bottom-up Strategy for Query Decomposition Le Thi Thu Thuy, Doan Dai Duong, Virendrakumar C. Bhavsar and Harold Boley Faculty of Computer Science, University of New Brunswick Fredericton, New Brunswick,
More informationA Generator of SQL Schema Specifications
A Generator of SQL Schema Specifications Slavica Aleksić 1, Ivan Luković 1, Pavle Mogin 2, Miro Govedarica 1 1 University of Novi Sad, Faculty of Technical Sciences, 21000 Novi Sad, Trg Dositeja Obradovića
More informationOptimized Query Plan Algorithm for the Nested Query
Optimized Query Plan Algorithm for the Nested Query Chittaranjan Pradhan School of Computer Engineering, KIIT University, Bhubaneswar, India Sushree Sangita Jena School of Computer Engineering, KIIT University,
More informationName :. Roll No. :... Invigilator s Signature : DATABASE MANAGEMENT SYSTEM
Name :. Roll No. :..... Invigilator s Signature :.. CS/B.TECH(IT)/SEM-6/IT-604/2011 2011 DATABASE MANAGEMENT SYSTEM Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks.
More informationCHAPTER 2: DATA MODELS
Database Systems Design Implementation and Management 12th Edition Coronel TEST BANK Full download at: https://testbankreal.com/download/database-systems-design-implementation-andmanagement-12th-edition-coronel-test-bank/
More information