Hello friends,
In this and the next few articles, I will try to explain in detail the concept of Index, which is very important for SQL Server Databases. I will also tell you about the Indexes used in SQL Server and their examples with screenshots again. Meaning of Index in terms of database Try to find the record in millions of records in a very short time. Let's take a look at how this is done with sample output. microsoft sql server 2014
The use of Indexes in a SQL Server database occurs most often in environments that require performance, speed, and memory savings. Millions of yards Using a tablade recording index with billions of records, we can read less and search for it in less time. I will now try to use the Index to give you a clearer understanding of the daily rhyme library example.microsoft sql server 2014
Example Scenario: Suppose that there are about 100,000 books in the 3-Story Library of the University. I'm looking for a book, I know the name of the book, but the book shelves and books in the 3-story library are randomly placed. In this case, I have to scan almost the whole library to find the book I'm looking for. In the artificial intelligence field, this is called the blind search method. In database concepts, this method is called Full Table Scan.microsoft sql server 2014
What I'm talking about is that you understand how absurd and tedious this example is. This method is not even called the method and is not used by anyone. Now let's write the opposite of this method and the correct one. The above Scenario is used as an example scenario for databases that do not use Index.microsoft sql server 2014
The Right Scenario should be as follows. All shelves located on the 3rd floor of the library can be sorted by a certain number sequence. According to the order of the letters, we have 29 letters in our alphabet. It will also be very easy to search when 10 letters of each kata are divided according to the number of shelves on that floor.microsoft sql server 2014
When a student wants to search the book of Atatürk's name, the letter N will go directly to the kata. So we sift through 2 layers and we find the N letter book. Then we go to the shelves or shelves where the N letter is found and easily find the book. The logical and correct method I mentioned is the scenario used for Index use in terms of SQL Server databases.microsoft sql server 2014
As we can see from the above scenario, we are searching for millions of records in the index database which is created correctly, and we use the operating system resources efficiently because we can get the record in a very short time and make the caller more convenient while reading less records at the same time. Now let's look at how Index works in a little bit of technical part so that we will be better concept of index logic.microsoft sql server 2014
Indexes Working Pattern
The way that the Indexes work The Tree is one of the most important topics of data structures that are used in programming languages. Although this type of structure is called Tree, we will look at B-Tree (Balanced Tree) where we used SQL Server IN. A sample view for B-Tree is as follows.
In this and the next few articles, I will try to explain in detail the concept of Index, which is very important for SQL Server Databases. I will also tell you about the Indexes used in SQL Server and their examples with screenshots again. Meaning of Index in terms of database Try to find the record in millions of records in a very short time. Let's take a look at how this is done with sample output. microsoft sql server 2014
The use of Indexes in a SQL Server database occurs most often in environments that require performance, speed, and memory savings. Millions of yards Using a tablade recording index with billions of records, we can read less and search for it in less time. I will now try to use the Index to give you a clearer understanding of the daily rhyme library example.microsoft sql server 2014
Example Scenario: Suppose that there are about 100,000 books in the 3-Story Library of the University. I'm looking for a book, I know the name of the book, but the book shelves and books in the 3-story library are randomly placed. In this case, I have to scan almost the whole library to find the book I'm looking for. In the artificial intelligence field, this is called the blind search method. In database concepts, this method is called Full Table Scan.microsoft sql server 2014
What I'm talking about is that you understand how absurd and tedious this example is. This method is not even called the method and is not used by anyone. Now let's write the opposite of this method and the correct one. The above Scenario is used as an example scenario for databases that do not use Index.microsoft sql server 2014
The Right Scenario should be as follows. All shelves located on the 3rd floor of the library can be sorted by a certain number sequence. According to the order of the letters, we have 29 letters in our alphabet. It will also be very easy to search when 10 letters of each kata are divided according to the number of shelves on that floor.microsoft sql server 2014
When a student wants to search the book of Atatürk's name, the letter N will go directly to the kata. So we sift through 2 layers and we find the N letter book. Then we go to the shelves or shelves where the N letter is found and easily find the book. The logical and correct method I mentioned is the scenario used for Index use in terms of SQL Server databases.microsoft sql server 2014
As we can see from the above scenario, we are searching for millions of records in the index database which is created correctly, and we use the operating system resources efficiently because we can get the record in a very short time and make the caller more convenient while reading less records at the same time. Now let's look at how Index works in a little bit of technical part so that we will be better concept of index logic.microsoft sql server 2014
Indexes Working Pattern
The way that the Indexes work The Tree is one of the most important topics of data structures that are used in programming languages. Although this type of structure is called Tree, we will look at B-Tree (Balanced Tree) where we used SQL Server IN. A sample view for B-Tree is as follows.
0 yorum:
Yorum Gönder