There are the various strategies which are considered while designing schema. Most of these strategies follow an incremental approach that is, they must start with some schema constructs derived from the requirements and then they incrementally modify, refine or build on them. Let’s discuss some of these strategies:
- Top-down strategy –
In this strategy, we basically start with a schema that contents high-level of abstraction and then applies successive top-down refinement. Let’s try to understand this with an example, we may specify only a few level entities types and then we specify their attributes split them into lower-level entity types and relationship. The process of specialization to refine an entity type into subclass is also an example of this strategy.
- Bottom-up strategy –
In these type of strategy, we basically start with basic abstraction and then goes on adding to these abstraction. For example, we may start with attributes and group these into entity types and relationships. We can also add a new relationship among entity types as the design go ahead. The basic example is the process of generalizing entity types into the higher-level generalized superclass.
- Inside-Out Strategy –
This is a special case of a bottom-up strategy when attention is basically focused on a central set of concepts that are most evident. Modeling then basically spreads outward by considering new concepts in the vicinity of existing ones. We could specify a few clearly evident entity types in the schema and continue by adding other entity types and relationship that are related to each other.
- Mixed Strategy –
Instead of using any particular strategy throughout the design the requirements are partitioned according to a top-down strategy and part of the schema is designed for each partition according to a bottom-up strategy after that various schema are combined.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Lossless Decomposition in DBMS
- Introduction of Relational Algebra in DBMS
- Need for DBMS
- Commonly asked DBMS interview questions | Set 1
- Normal Forms in DBMS
- View Serializability in DBMS Transactions
- Relational Model in DBMS
- Commonly asked DBMS interview questions | Set 2
- Concurrency Control in DBMS
- Conflict Serializability in DBMS
- Recoverability in DBMS
- Last Minute Notes - DBMS
- ACID Properties in DBMS
- DBMS Architecture 2-Level, 3-Level
- Introduction of DBMS (Database Management System) | Set 1
- Introduction of 3-Tier Architecture in DBMS | Set 2
- Introduction of Relational Model and Codd Rules in DBMS
- Precedence Graph For Testing Conflict Serializability in DBMS
- Canonical Cover of Functional Dependencies in DBMS
- Thomas Write Rule in DBMS
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.