Oracle || Indexes Part-1 by dinesh

[@mallisiva3839]

Thank you sir,i don't have much money to join the courses in Hyderabad so i am using to watch these videos,heart full thanks to dinesh sir and durga soft

[@malavjani2749]

You are so amazing.... You taught all things in details an in easy way.. You are same like IIT professors

[@syedsumamamuhammad267]

Thanks a lot sir, very informative video. These types of teachers are asset of the world.

[@tobiasroehrer]

This video is both incredibly well explained and hilarious. Dinesh explains things in a speed and way so that even I can understand them. He repeats them multiple times and explains in numerous different ways which is really good. On the other hand, his English very funny. It's generally very well understandable, but at times you just burst out laughing. All in all this video get's 5 of 5 stars, it's very informative and just as funny. Thank you Dinesh!

[@vitortx100]

very good class, thank you! Greetings from Brazil.

[@samarthurs8000]

Great content! No doubt he has a sound knowledge of database. Thank you very much for the video :-)

[@dikshaagarwal2036]

thank you so much sir for explaining so briefly and nicely. It makes us so easy to understand.

[@niteshagarwal4934]

Awesome crystal clear explanation sir. Hats Off

[@saidurshamim]

Great Explanation . I really like it. But you create your column with unique constraint then its already consider as unique index like primary key. Oracle 12cR2

[@monicagawade2872]

very nice and clear the concepts of indexes..thanks a lot to dinesh sir

[@nileshdapke1215]

Thanks for share this kind of videos. Learn a lot from it.

[@SanataniHindu5165]

Thanks Dinesh it is very well explained.

[@pavanmadamset]

Excellent Explanation Sir! Thank You Very Much, Dinesh Sir!!! I am learning because of You Sir!!!

[@ranjitkurmi3528]

what a nice explanation sir thanks

[@suman5433]

Thank you Sir. Nicely explained.

[@HansLowell]

not from india and this video helped me

[@johaneltipejo]

Thanks a bunch! I was able to understand your explaination. You know what you are talking about. This helps me a lot with my daily work :D

[@chrajesh05]

Thanks for sharing knowledge

[@Nareshreddy-ot3fc]

excellent explanation

[@akashrathor9863]

Simple and clear. Thanks alot sir

[@AnuragSingh-mb2xl]

nice explanation. Learned a new concept today - 'Egg Nest'. very hepful

[@ravaliakarapu4384]

Very detailed real time explanation. Thanku sir.

[@myself4463]

Very good explained !

[@lakshmidvs3258]

very nice explanation sir ,May I know what is Tree walking in oracle?

[@DurgaSoftwareSolutions]

Hello Lakshmi DVS. Thanks for your valuable feedback. It will boost us to do new things. Please subscribe to get updates about new videos. Plz contact our online team [e-mail] or call us on this number [phone], 7207212427/28

[@miteshjain4549]

hats off to you sir

[@shubhamchaubey2654]

sir i think u should get treatment of your coughing issue or is it your style!!!....>>>>>>

[@sreenivasulareddyankireddy2129]

It's very nice but the bit map index internal mechanism how it works not clear in the video. If it z possible please share another video.

[@DurgaSoftwareSolutions]

Hello Sreenivasula. Plz contact our online team [e-mail] or call us on this number [phone], 7207212427/28

[@amyk1538]

thanks a lot sir for uploading remaining videos

[@AtulyaJockeyAtISM]

16:39 why the cut? that was something which is not explained in other videos.

[@DurgaSoftwareSolutions]

Hello Anand. Plz contact our online team [e-mail] or call us on this number [phone], 7207212427/28

[@sameerahmad7592]

Hi Dinesh, isn't there any video from your side on Cluster. If it's there then kindly help me & provide the link for the Video related to Cluster....... Thanks Sameer Ahmad

[@shivammalviya2749]

There are no. of videos which are turned private do something for that?

[@DurgaSoftwareSolutions]

Hello Shivam. Plz contact our online team [e-mail] or call us on this number [phone], 7207212427/28

[@kalepumanikiran4205]

Please provide tuning concepts

[@DurgaSoftwareSolutions]

Hello Manikiran. Plz contact our online team [e-mail] or call us on this number [phone], 7207212427/28

[@amanagarwal113]

Thanks!

[@yuvaraj575]

More knowledgeable person

[@saurabhy7640]

Thank you Sir ..

[@lokmanhossen7354]

DEAR SIR. Do you have any video about deferring constraints ..

[@balramverma3943]

thanks sir for special guidance

[@AmanUllah-lw7zm]

Thank you so much sir.. hope you keep it up..

[@faisalshaikh2027]

sir missing some portion after 16:40min , please check and update

[@sameerahmad7592]

Ecellent Sir.......Awesome

[@DurgaSoftwareSolutions]

Hi Sameer. Thank you very much for your feedback

[@rohitamit007]

Hi Sir, If need to create index in where clause how can we create it.?

[@vikashsoni3515]

bahut achha

[@dattakor1548]

Nice

[@PriyanjulJohari]

"Suppose all males are mapped to 0 and all females to 1...." why ??? because women are always right !!!! >D >D >D

[@7504045535]

Feminist:girls be ri8 now.

[@AmanGarg95]

Hey, I have a doubt. At 8:20, for finding the first value that fails the constraint *salary < 7000* , we are scanning one by one from top till we make the 4th comparison that fails. Now imagine, the constraint is *salary < 15000*. In this case, according to the said approach, we would still be traversing sequentially until we reach the last element which is still *O(N)* destroying the very purpose of using an index. Shouldn't the condition make use of *Upper bound* function that runs in *logarithmic O(log(n)* time. It would translate as follows: sal < 7000 : upper_bound(idx_sal, 7000 - 1) : index :3 sal < 15000: upper_bound(idx_sal, 15000 -1 ): index 13 -> All rows Let me know what you guys think.

[@paarthsoin3615]

indexes are based on trees. so it still could be faster than general traversing.

[@rakeshmahanty2805]

@@paarthsoin3615 Hi Paarth could you please elaborate your statement with an example

[@paarthsoin3615]

To to question asked my aman, suppose you have an array of a number from 1 to 10 and want to print all numbers, that doesn't mean it has time complexity of O(n). The explaination was not exactly true I agee. Coming to indexing, The indexed values are stored as tree(B-tree/B+ tree) data structures which has time complexity of log(n). Suppose you want to search 7000. You do it in log(n) time and you'll know that all elements as his left childs will be lesser that 7000. NOTE : SEARCH IS NOT SEQUENTIAL IN CASE OF INDEXED VALUES.

[@jagadeeshreddy3620]

explanation is good... thank u sir

[@youkarthiktheking]

great sir thanks

[@norm1124]

Could you link the next part in the description?

[@gomathil4610]

thank you sir very helpful

[@DurgaSoftwareSolutions]

Hi Gomathi. Thank you very much for your feedback

[@ghareesh5586]

Sir please explain force and mview by dinesh sir

[@rebeccanunes2854]

amazingly helpful .

[@naeshnaresh5160]

Example required for index on varchar column

[@naeshnaresh5160]

Tq in advance for the same

[@SatyendraSingh-ul5iq]

Part 2 ?

[@DurgaSoftwareSolutions]

Hello Satyendra. Plz contact our online team [e-mail] or call us on this number [phone], 7207212427/28

[@anthonyokorochukwu3034]

nice explanation. but how do I identify missing indexes?

[@7504045535]

ask your admin.

[@AnilGupta-rt2vl]

Thx

[@maheshwarreddyk1250]

ple the upload the force,metirilized views

[@vikastiwari8935]

Force and Mview..you can get in this link by dinesh sir kzbin.info/www/bejne/oKXcfXaDjayWsM0 check after few min in this video u will get remaining views

[@mohdahasansiddiqui9063]

agnest??

[@aviksengupta4879]

egg-nest :D

[@hemashinde2510]

LOL :D :D

[@Flower_withanshi]

guys instead try to learn concept u understand what he means ...

[@TEXAS2459]

my teacher named vardhini prasad also used to say AGENEST! it just goes to show that all the AGENEST pronouncing people are GREAT TEACHERS XD, SO KEEP UR EARS OPEN FOR THIS PRONOUNCIATION if u hear AGENEST YOU HAVE HIT A JACKPOT IN YOUR HANDs.

[@mohdahasansiddiqui9063]

@@TEXAS2459 means, that if I started teaching and saying eggnest then I would be a great teacher as well. What a logic.

[@an_ugly_girl]

Thanks 🙏