Indexes are used to quickly locate data without having to search every row in a database table every time a database table is accessed. An index is a copy of selected columns of data from a table, called a database key that can be searched very efficiently that also includes a low-level disk block address or direct link to the complete row of data it was copied from.
I use many Flat Files, with fixed-length records, and "text" fields, working in tandem with Perl SDBM binary files of key/value pairs tied to Perl program hash tables. These key/value pairs offer persistent, instantaneous, random access to Flat File records. For random access, the file pointer is first set to a single record location byte offset, where the offset is the number of bytes to seek to from either TOP of file or END of file. Then the record is read into memory. Once in memory, the contents of the record can be changed/modified and written back out to the Flat File, overwriting the existing data stored in that record.
nice video. tomorrow is my exam on web designing, circuit, history of computer technology, programming and database. I didn't know anything about database management. the video really helped. thanks
Thanks for the explanation. The only con I see is that to generate an index you first need to scan the whole thing. But I guess its pro as that you only have to scan once.
What I've understood is that an index is used to find specific records of data quickly. The index is a separate, independent data structure that you can look through regarding a specific value, such as the company number in your example. The index structure for all the company numbers appears to be ordered. This way, someone can go through the values in order so they can quickly find the specific company number they are looking for. Once they've found the number, the index will point to the specific record in the database that it is referring to. The index structure is also nice because you can easily realize when you've exhausted your search for the company number you're looking for because if you stumble upon a different value, that means your search is over.
i think the index is incomplete, it should be a tuple (element, place) no? so the systeme knows where to locate it, like the word for example (word, page, line, column) so the reader will go directly to the word?
It needs to include the element in question and a pointer to the location, yes. The pointing or locating is normally done on the physical (i.e. disk block) level, so it is not exactly correct to think of the index as a tuple, but I can see where it would be useful to think of it as such. In any case, you are certainly correct that it does no good unless it provides a mechanism for going from element to its location in the underlying table.
Create index not give that much fast...in my table i use more trim(SUBSTRING_INDEX(SUBSTRING_INDEX(SUBSTRING_INDEX AS is it slow the execution time ? if this is the pblm give any suggesstion
You can download my example PERL source code here (fully functional GUI application program) in PDF format. Click on the "Original File" link on that page to see the PDF file in a PDF viewer for download. I use Joint Database Technology as the Database (Flat File databases and SDBM databases working in tandem). The binary SDBM databases are used for indexing to the records in the Flat File. en.wikipedia.org/wiki/File:KJV_Bible_SDBM.pdf Also see the wikipedia page: en.wikipedia.org/wiki/Dbm for screen shots of this GUI application DB user-interface I guess this qualifies as a type of ISAM/NoSQL DB Access, and may be considered an Embedded Database?
![กี่หมื่นฟ้า | Your Sky Series EP.1 [2/4]](http://i.ytimg.com/vi/qJbQs_nhjD4/mqdefault.jpg)
Indexes are used to quickly locate data without having to search every row in a database table every
time a database table is accessed. An index is a copy of selected columns of data from a table, called a database key that can be searched very efficiently that also includes a low-level disk block address or direct link to the complete row of data it was copied from.
thanks
To skip the intro go to 2:39.
The analogy helped me a lot to understand and now I don't think I will forget this concept. Thanks a lot!
Thank you Brian, great intro and great description. Very helpful!
Wow that was awsome....explained with such a simple example..thanks a lot
I use many Flat Files, with fixed-length records, and "text" fields, working in tandem with Perl SDBM binary files of key/value pairs tied to Perl program hash tables. These key/value pairs offer persistent, instantaneous, random access to Flat File records. For random access, the file pointer is first set to a single record location byte offset, where the offset is the number of bytes to seek to from either TOP of file or END of file. Then the record is read into memory. Once in memory, the contents of the record can be changed/modified and written back out to the Flat File, overwriting the existing data stored in that record.
This is brilliant. Will keep this approach in mind for the next major project I am having. (Y)
nice video. tomorrow is my exam on web designing, circuit, history of computer technology, programming and database. I didn't know anything about database management. the video really helped.
thanks
Very nice explanation.
thank you so much, I have a test tomorrow and I didn't know why not just sort instead of indexing.. hopefully I'll go good
Great video. Clear and concise!
thank you so much for this valuable helpful video
awsome explanation. Thanks!
Thank you for explaining this 🙏 Helped me
Thanks for the good introduction
Thanks @Brian! A good intro to indexing.
Excellent explanation of Index. Thanks.
excellent explanation 👌 thank you
Very good info, cheers.
Good job Brian!
Thank you for an interesting intoro to the indexing concept.
Thanks for the explanation. The only con I see is that to generate an index you first need to scan the whole thing. But I guess its pro as that you only have to scan once.
Easy to understand. Thanks.
Great explanation, very clear, just what I was looking for right now. Thanks a lot
What I've understood is that an index is used to find specific records of data quickly. The index is a separate, independent data structure that you can look through regarding a specific value, such as the company number in your example. The index structure for all the company numbers appears to be ordered. This way, someone can go through the values in order so they can quickly find the specific company number they are looking for. Once they've found the number, the index will point to the specific record in the database that it is referring to. The index structure is also nice because you can easily realize when you've exhausted your search for the company number you're looking for because if you stumble upon a different value, that means your search is over.
Thank you for the explanation🙂
x1.5 speed is a must for this one. Good video though! thanks man.
Thanks GOAT of index
Very well explained, thank you very much.
Nice video. thank you brother
Thank you, very nice example and explanation
excellent mate!
Excellent explanation! Thank you!
thank u ...good explanation
very helpful
Thank you so much .
It helps a lot. Thanks
How is the index table sorted if it has characters instead of numbers? Great Video!
It can be indexed/sorted alphabetically. My suggestion
Very well explained !
dope explaination
Thanks for the video!! It was very helpful!
i think the index is incomplete, it should be a tuple (element, place) no? so the systeme knows where to locate it, like the word for example (word, page, line, column) so the reader will go directly to the word?
It needs to include the element in question and a pointer to the location, yes. The pointing or locating is normally done on the physical (i.e. disk block) level, so it is not exactly correct to think of the index as a tuple, but I can see where it would be useful to think of it as such. In any case, you are certainly correct that it does no good unless it provides a mechanism for going from element to its location in the underlying table.
Create index not give that much fast...in my table i use more trim(SUBSTRING_INDEX(SUBSTRING_INDEX(SUBSTRING_INDEX
AS is it slow the execution time ? if this is the pblm give any suggesstion
thanks Brian 👍
thanks . very good lecture
Nice video.. Indexing got indexed in my mind :p
well explained!
What data structure is used for index ?
thanks, it was very helpful!
Useful info starts at 4:46.
Great explanation, thanks :)
Thank you, helped a lot
Thanks. Well done!
thank you Brian!
Thank you sir!
Watched this 4 years ago, now a developer came across it again.
Thanks!!!
Thank you
Wait, can't we use ORDER BY column1 DESC, column2 ? Kind of confused...
Yes. The point is that ordering a huge database takes a lot of time. By having it already ordered (with indexes) you speed things up!
Perfect
Thanks good video on dbms indexing but very long.
Warning!! You might need to use 1.5x speed.
Great! and Thanks!
really helpful, thanks!!
Thank you.
You can download my example PERL source code here (fully functional GUI application program) in PDF format. Click on the "Original File" link on that page to see the PDF file in a PDF viewer for download. I use Joint Database Technology as the Database (Flat File databases and SDBM databases working in tandem). The binary SDBM
databases are used for indexing to the records in the Flat File.
en.wikipedia.org/wiki/File:KJV_Bible_SDBM.pdf
Also see the wikipedia page: en.wikipedia.org/wiki/Dbm
for screen shots of this GUI application DB user-interface
I guess this qualifies as a type of ISAM/NoSQL DB Access, and may be considered an Embedded Database?
Thanks, helpful
jump to 3:45
Hey :) I need your help with these 3 topics :) Sequential Access Method, Indeks Sequential Access Method, Direct Access Method.
search, youtube, whats a database index
gooood
5:49 i am looking for a girlfriend
Very well explained. Thank you
thank you very much!