Skip to main content

Multi-Tier Architecture & Its Layers: Introduction to SQL

In this architecture of SQL server, it is possible to keep the UI-centric processing on a computer, near the client. In addition, database developer may keep the data-centric processing components on another computer near the database server, so that you get significant performance benefits.

Three-tier architecture is used till the manageable size of business tier. As the business complexities increases, the business tier became larger and unmanageable. This led to the evolution of N-tier architecture, where the business services model was divided into smaller manageable units. N-tier architecture is also called as multi-tier architecture.

The N-tier architecture consists of the following layers:

  • Client tier
  • UI-centric processing components
  • Data-centric processing objects
  • Database server

A banking application, when further expanded, can depict an example of n-tier architecture. The client tier would deal with the user interface, which would include the user interface controls, such as forms, menus, and toolbars. The server tier would comprise data-handling including saving data to the database server.

The business logic would include the rules and guidelines for different types of accounts, Interest rates, fixed deposits, ATMs, and overdrafts. All these would form the middle tier. However, there would be some rules that need to be implemented on the user interface and on the database. You can place these rules either on the UI-centric processing components of data-centric processing components, based on the functionality.

Applications that follow multi-tier architecture can be used across various locations. For Example, in Web applications, the application is stored on the Web server. The clients access the application from any location through a browser software. The clients make requests and receive response from the Web server.


The Web server transfers the request for data to a database server, as shown in the following figure.


Multi-Tier Architecture & Its Layers: Introduction to SQL

In above diagram, all the computers are web clients, remains are specified. Depending on the relevance of the business rules, they can be implemented on any of the tiers, such as the Web clients, Web server, or the database server.

To provide support to applications where users can send requests simultaneously, the database server needs to be a fast, reliable, and secure. SQL Server 2005 is one such comprehensive database platform that provides a fast, reliable, and secure RDBMS. It also helps in data analysis with integrated tools.

Here BI application is an application that is used by the top management of an organization for data analysis to make future decisions. BI tools are the tools that help in creating reports that enable data analysis.

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …