Skip to main content

How to use LINQ to SQL in ASP.NET


LINQ to SQL is a component of .NET Framework, and is specifically designed for working with SQL server database. It provides a run-time infrastructure for managing relational data as objects. It allows you to write queries to retrieve and manipulate data from the SQL server. LINQ to SQL supports all the key functions that you would expect while developing SQL applications. You can retrieve the data from the database, insert, update, and also delete the information from the table. Your query expression is translated into parameterized SQL code, parameters are created, and the query is executed on the server. LINQ to SQL also supports transactions, views, and stored procedures. It also provides an easy way to integrate data validation and business logic rules into your data model.

LINQ to SQL is an object-relational mapping (ORM) framework that allows the direct 1-1 mapping of a Microsoft SQL Server database to .NET classes, and query of the resulting objects using LINQ. With the help of LINQ to SQL ORM mapping, the classes that match the database table are created automatically from the database itself and you can start using the classes immediately.

Let's take an simple Example

Step-1 : Add a LINQ to SQL class to the application 
Step-2 : Right-click the Solution name in the solution explorer and select Add New Item from The context menu. This will open the Add New Item dialog box.
Step-3 : In the dialog box, select LINQ to SQL Classes and rename the file as my.dbml. Default name for LINQ to SQL class is DataClasses.dbml

LINQ to SQL Class in

Step-4 : Click Add

The object Relational Designer window opens. In this window, you can drag and drop the table from the server Explorer. The action will add the table to your application, and you can retrieve any data from the table. In this case, the products table from the database is added to the object Relational Designer window, 
After you have added the table to the my.dbml file, you can find the code for the .aspx in the listing

Add database table into dbml file

Source code
<form id="form1" runat="server">
        <asp:ListBox ID="ListBox1" runat="server" Height="97px" Width="98px"></asp:ListBox> 
Code Behind Code
protected void Page_Load(object sender, EventArgs e)
        myDataContext dc = new myDataContext();
        var query = dc.usertables;
        foreach (usertable  item in query)
            ListBox1.Items.Add( + " " +;

Code generate the following output

How to use LINQ to SQL in ASP.NET
If your .dbml name is my then your DataContext name is myDataContext. After adding the table into dbml file , your table name look in the dbml file. 


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 …