Skip to main content

Sql Server Features with About SQL: Introduction to SQL

The components of SQL Server help to improve the database management and developer productivity. These benefits are provided by the following features:
  • Built-in support for XML data: Allow you to store and manage XML data in variables or columns of the XML data type. The XML data is stored in a structured format that can be used across different platforms and applications.
  • CLR integration: Allows you to implement programming logic in any language supported.
  • Scalability: Allow portioning of database table to help in parallel processing of queries. This makes the database scalable and improves the performance of queries.
  • Service-oriented architecture: Provides a distributed, asynchronous application Framework for large-scale applications. This allows the database clients to send requests to the database server even if the server is not available to process the request immediately.
  • Support for Web services: Allows you to provide direct access to the data from the Web services by implementing the HTTP endpoints.
  • High level of security: implements high security by enforcing policies for log on passwords. Administrators can also manage permissions granted to different users to access the database objects.
  • High availability: ensures that the database server is available to all users at all times. This reduces the downtime of the server. High availability in SQL Server is implemented with the help of database mirroring, failover clustering, and database snapshots.
  • Support for data migration and analysis: provides tools to migrate data from disparate data sources to a common database. In addition, it allows building the data warehouse on this that can support BI applications for data analysis and decision-making

SQL

Database developer need to manage the database to store, access, and modify data. SQL is the core language used to perform these operations on the data. SQL, pronounced as “sequel”, is a language that is used to manage data in an RDBMS. This language was developed by IBM in the 1970s and follows the international Organization for Standardization (ISO) and American National Standards Institute (ANSI) standards.

Most database systems have created customized versions of the SQL language. For example, transact-SQL (T-SQL) is a scripting language used on the SQL Server for programming. Alternatively, PL-SQL is used for programming in Oracle. T-SQL confirms to the ANSI SQL-92 standard published by ANSI and ISO in the year 1992.

Here're the categorization of SQL statements:


  • Data Definition Language (DDL): is used by to define the database, data types, structures, and constraints on the data. Some of the DDL commands are create, alter and drop etc.
  • Data manipulation language (DML): is used to manipulate the data in the database objects. Some of the DML commands are insert, update and delete.
  • Data Control Language (DCL): is used to control the data access in the database Some of the DCL commands are grant and revoke.
  • Data Query Language (DQL): is used to query data from the database objects. Select is the DQL command that is used to select data from the database in different ways and formats.

SQL is not a case-sensitive statement. Therefore, you can write the commands is any case, lowercase or uppercase. For example, you can use the SELECT statement in lowercase as 'select' or in title case as 'Select'.

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 …