Skip to main content

SQL Server Components with Details: Introduction to SQL Server

SQL Server contains a number of components, provides specific services and support to the clients connected to the server. The following figure depicts the components of SQL Server

SQL Server Components with Details: Introduction to SQL Server

As shown in the preceding figure, SQL Server consists of the following core components, described in this article:

  • Database Engine
  • Integration Services
  • Analysis Services
  • Reporting Services

Database Engine

It provides support to store, query, process, and secure data on the database server. The database engine contains databases and database objects, such as tables and procedures. This database engine allows you to create and manage database objects.

Services provided by database engine:

  • Service Broker: Provides support for asynchronous communication between clients and the database server, enabling reliable query processing. The client application sends a request to the database server and continues to work. The requests sent by the client are queued up at the server, in case the server is not available to process the request immediately. Server Broker ensures that the request is processed whenever the server is available.
  • Replication: Allows you to copy and distribute data and database objects from one database server to another. After replicating data, the SQL Server allows you to synchronize different databases to maintain data located at different locations around the world. All the servers store common data.
  • Full-text search: To implement fast and intelligent search in large database by allowing you to search records containing certain words and phrases. You can search for different forms of a specific word, such as ‘produce’, ‘produces’, or ‘production’. In addition, you can search for synonyms of a given word, such as ‘garment’, ‘cloth’, or ‘fabric’.
  • Notification services: Allows you to generate and send notification messages to the users or administrators about any event. For example, the database administrator should be notified when a database object is created or deleted. The notification messages can be sent to a variety of devices, such as computers of mobile devices.

Integration Services

Integration services allow you to gather and integrate data from various disparate data sources available in an organization. You can store the data in a consistent format in a common database called the data warehouse.
For example, data in your organization might be stored in different databases, such as Microsoft Access, FoxPro, or text files. You might need to consolidate data from all these sources and save the data in a common set tables on a database server.

The integration services provide a set of tasks that help the developer create data integration projects with minimum lines of code. Data integration allows collation of data from all the data sources in a common format to enable accurate analysis of data.

Analysis Services

Analysis services help in data analysis in a BI application. These applications are built on a data warehouse that contains data consolidated from various data sources. These services provide data mining solutions that are built on data integrated in the data warehouse. Data mining solutions allow the users to query and present data in reports that enable business forecasts, such as expected sales or profit estimates in the next financial year.

Reporting Services

Reporting services provide support to generate comprehensive reports on data in the database engine or in the data warehouse. These services provide a set of tools that help in creating and managing different types of reports in different formats. Using these services, you can create centralized reports that can be saved to a common server and provide secure and restricted access to these reports.


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 …