LEARN BITMAP INDEXES

แชร์
ฝัง
  • เผยแพร่เมื่อ 5 ธ.ค. 2024

ความคิดเห็น • 77

  • @amitpatil746
    @amitpatil746 10 หลายเดือนก่อน +1

    Thank you for very good explaination.

  • @paulo__vieira
    @paulo__vieira หลายเดือนก่อน

    Good explanation, very easy to follow. Thanks!

  • @ramjonchhen5882
    @ramjonchhen5882 2 ปีที่แล้ว

    thank you for explaining the topic in such a simple and effective manner.

  • @singhongchow8968
    @singhongchow8968 2 ปีที่แล้ว

    Thanks from Malaysia. It is really clear.

  • @ghumofiro5661
    @ghumofiro5661 ปีที่แล้ว

    Excellent explaination in a very simpler way,thank you

  • @陈之-l3d
    @陈之-l3d 4 ปีที่แล้ว +1

    good explanation. better than documentations I read before

  • @devenderyadav6209
    @devenderyadav6209 4 ปีที่แล้ว +4

    Great tutorial! Thank for covering variety of topics. It would ge great if you start putting notes, slides, references to a Github repository. In this way, other developers can also contribute.

  • @MarcioBrenerCosta
    @MarcioBrenerCosta ปีที่แล้ว

    Great Job Broo! The way you speak and explain is very clear!

  • @haphamdev
    @haphamdev 2 ปีที่แล้ว

    Thank you for a very good tutorial.

  • @tanuvishu
    @tanuvishu 2 ปีที่แล้ว

    Your videos are amazing

  • @TheHellishFrog
    @TheHellishFrog 2 ปีที่แล้ว

    Excellent explanation! Thank You!

  • @wizardgaming163
    @wizardgaming163 2 ปีที่แล้ว

    U explains things very clearly,love your content

  • @golgottera8205
    @golgottera8205 3 หลายเดือนก่อน

    Nice visualization, thanks!

  • @vaibhavmewada4508
    @vaibhavmewada4508 2 หลายเดือนก่อน

    Good explanation

  • @bhatanand
    @bhatanand 2 ปีที่แล้ว

    Super video. Thanks

  • @Patiencelad
    @Patiencelad 2 ปีที่แล้ว

    Great explanation! Thanks so much!

  • @LovelyCreationsDIY
    @LovelyCreationsDIY 4 ปีที่แล้ว +8

    Hey, it will be great if you also share the reference materials as well. thanks

  • @consciousmi4842
    @consciousmi4842 4 ปีที่แล้ว

    Thanks for sharing. Good material

  • @levelupskills7710
    @levelupskills7710 4 ปีที่แล้ว +6

    waow .. first time I opened this video.. It really made me fall in love with your teaching skills, way of communication and your kind body language ❤❤🔥🔥🔥🔥🔥.. Your are legend sir 👍👍👍

    • @Bruh-jw2ze
      @Bruh-jw2ze 4 ปีที่แล้ว

      Congrats bro , I opened it for the 100th time today
      Will continue opening it everyday till I reach my grave

  • @lolopolos
    @lolopolos 4 ปีที่แล้ว

    Great explanation, Redis provides bitmap data structure.

  • @koderkev42
    @koderkev42 2 ปีที่แล้ว

    Well explained. Thank you!

  • @jennwng
    @jennwng ปีที่แล้ว

    Great video! Simple example to explain complex concept - love it! Thanks. : )

  • @dulanjanaliyanagama3823
    @dulanjanaliyanagama3823 3 ปีที่แล้ว +1

    Thank you, sir! You saved my day! Nice explanation 🙏

  • @MrVitalirapalis
    @MrVitalirapalis ปีที่แล้ว +1

    amazing ;)

  • @priyankabuqrdwaj4964
    @priyankabuqrdwaj4964 4 ปีที่แล้ว

    thank you so much sir your explanation is awesome

  • @lucas.n
    @lucas.n ปีที่แล้ว +4

    question: if you have to go row by row in the bitmap index to find the matches, how is it different than a fullscan?

  • @nandnibachani1765
    @nandnibachani1765 3 ปีที่แล้ว

    Best explaination ever

  • @kottaravindar1
    @kottaravindar1 3 ปีที่แล้ว

    Good One

  • @cristianopassos5257
    @cristianopassos5257 3 ปีที่แล้ว

    Hi, nice vídeo!
    I would like to have it short, but without losing any content.
    Thanks for sharing 👍

  • @mdtalibalam9743
    @mdtalibalam9743 19 วันที่ผ่านมา

    Very insightful video , can you also please tell me the book or document that you referred to understand this

  • @bharath_v
    @bharath_v 4 ปีที่แล้ว

    Good One!

  • @jag188
    @jag188 4 ปีที่แล้ว +1

    Great explanation, thanks for sharing knowledge, My only suggestion is to reduce repetitive statements.

  • @abdulrafay2420
    @abdulrafay2420 10 หลายเดือนก่อน

    Hey, you explained Bitmap indexing concept really well 👍🏻. Do you have one for cluster indexing?

  • @SURESHRAJA-c5x
    @SURESHRAJA-c5x ปีที่แล้ว

    As for as oracle , the definition for cardinality is some what not same as you explained , but your explanation of bitmap is good

  • @YuraZavadenko
    @YuraZavadenko 5 หลายเดือนก่อน

    soo splendid, but what if the capacity (number of rows in the database) grows, so we will have bigger indexes, thus will need to interate through a larger portion of indexes?

  • @Ayush-lj6pq
    @Ayush-lj6pq 3 ปีที่แล้ว

    crystal clear

  • @大盗江南
    @大盗江南 4 ปีที่แล้ว +1

    Thanks for this video!!! Man!!! Could u do a video about an example using bitmap and b-tree together :D Have a nice day!

  • @masthanayapenumadi3855
    @masthanayapenumadi3855 4 ปีที่แล้ว

    Thank u very much

  • @59sharmanalin
    @59sharmanalin 3 ปีที่แล้ว +1

    Even if we find all 1st in bitwise array, it's O(N) ?

  • @anamigator
    @anamigator 4 ปีที่แล้ว +1

    May be the table needs a better design here. Why not pull out status and stock in their own tables and use the status_id and stock_id as columns in the main table. Integer comparisons are faster.

  • @dinggorden269
    @dinggorden269 4 ปีที่แล้ว

    How about to have a session discussing about the design distributed message queue system?

  • @niyomwungerighad8965
    @niyomwungerighad8965 4 ปีที่แล้ว

    thank you sir. it is really helpful. could you please suggest me a reference paper or book for this?

  • @pabloe1802
    @pabloe1802 4 ปีที่แล้ว

    What do you think of CrimsonDB?

  • @sahilbajaj2190
    @sahilbajaj2190 ปีที่แล้ว

    Question: What if any record from table is deleted ? Just turning that bit to 0 would not work much, as query could be number of users who are not approved, which in turn can include deleted users as well

  • @andreaolla8256
    @andreaolla8256 4 ปีที่แล้ว

    Thanks You!

  • @ranojaan165
    @ranojaan165 4 ปีที่แล้ว

    thanks

  • @大盗江南
    @大盗江南 4 ปีที่แล้ว

    Do some live with us!!!!!

  • @Extjac
    @Extjac 4 ปีที่แล้ว

    hey! can you do a system design for Expidia?

  • @subhrapratimde8016
    @subhrapratimde8016 3 ปีที่แล้ว

    If we create an index like CREATE INDEX index_name ON table_name (column_name). will the database handle it automatically for BITMAP or do I have to do any extra things to use BITMAP indexing for status column?

  • @hitzhangjie
    @hitzhangjie 3 ปีที่แล้ว +1

    Hi, bro, I see you hadn't updated for nearly half a year. Are you OK?

  • @billylee1802
    @billylee1802 3 ปีที่แล้ว

    Good content, but the volume is very low.

  • @wejdanalqhtani8092
    @wejdanalqhtani8092 2 ปีที่แล้ว

    What is the relationship between bitmap indexing and high dimensional indexing problem???

  • @Hmm1298-8
    @Hmm1298-8 4 ปีที่แล้ว

    can you suggest the list of books plz?

  • @YT-yt-yt-3
    @YT-yt-yt-3 3 ปีที่แล้ว

    Isn’t this same as columnar format the parquet uses?

  • @--sql
    @--sql 4 ปีที่แล้ว

    What you described as "Cardinality" is what I learned as "data sparsity". Cardinality refers to the relationship between rows in different tables, e.g. 1 to many (1:M), 1 to 1 (1:1) or many to many (M:N).

    • @romangavrilovich8453
      @romangavrilovich8453 4 ปีที่แล้ว +1

      'cardinality' is the same as 'size'
      en.wikipedia.org/wiki/Cardinal_number
      sparsity describes the number of sparse items (e.g. empty rows in DB)

  • @youchiru1
    @youchiru1 4 ปีที่แล้ว

    Conventional wisdom hulds that bitmap indexes are most appropriate for columns having low distinct values--such as GENDER, MARITAL_STATUS, and RELATION. This assumption is not completely accurate, however. In reality, a bitmap index is always advisable for systems in which data is not frequently updated by many concurrent systems. In fact, as I'll demonstrate here, a bitmap index on a culumn with 100-percent unique values (a culumn candidate for primary key) is as efficient as a B-tree index.
    Usage of bitmap indexes is not in fact cardinality dependent but rather application dependent.
    SRC : www.oracle.com/technical-resources/articles/sharma-indexes.html

  • @anildangol
    @anildangol 4 ปีที่แล้ว +1

    Great Explanation! so you explained it nicely for 6 rows and it has 6 bits but how does it scale for millions of rows. we can't have millions of bits.

    • @devenderyadav6209
      @devenderyadav6209 4 ปีที่แล้ว +3

      Whats' the issues with millions rows. If we you take 1 million rows and 4 cardinality, its just 500KB data.

  • @AmanGarg95
    @AmanGarg95 4 ปีที่แล้ว +1

    Thanks for sharing. However this doesn't answer the following.
    1) How is the bit map index updated when you add a new ID as well as add a new type called "ON HOLD". Is the index resized when it crosses a particular threshold (say 2^n -1 )? Is it a power of 2?
    2) How is the complexity of the query reduced? For e.g select all products where status in ALL except rejected and stock in ALL. In this case, how are we saving on compute because we need to loop through all bitmaps on both columns.
    If that's the case, there's no exploitation of the fact that the cardinality of this column in reduced. For example. why not compute a bitmap for TRUE, FALSE, TRUE || FALSE, TRUE && FALSE and keep it ready as compared to just TRUE , FALSE now. We can afford to do this as the cardinality is less.

    • @romangavrilovich8453
      @romangavrilovich8453 4 ปีที่แล้ว

      actually this video is useless =/

    • @JayChakra
      @JayChakra 4 ปีที่แล้ว

      I too had the same questions in mind.

  • @adithyapuram2541
    @adithyapuram2541 3 ปีที่แล้ว

    Hi, thanks for the video, how will the update work, if I have to update the nth element from 1 to 0, how would I seek that element without having to go through all the numbers. Also having ids in order seem to be one of the biggest requirement for this use-case, which is not possible most times.

  • @maxmuranov8764
    @maxmuranov8764 ปีที่แล้ว +1

    Omg you could explain everything in 5 minutes instead of repeating 100 times each simple idea. And you didn't explain why it's better than seq scan, great!! (no)

  • @mayankrathore7558
    @mayankrathore7558 2 หลายเดือนก่อน

    how we scale this kind of operation lets say on 1M rows

  • @a.yashwanth
    @a.yashwanth 4 ปีที่แล้ว

    Why can't we use 3 numbers for each row. 0 for approved, 1 for pending, 3 for rejected.

    • @TechDummiesNarendraL
      @TechDummiesNarendraL  4 ปีที่แล้ว

      It is a bit, not character/string datatype

    • @jimsmart2522
      @jimsmart2522 4 ปีที่แล้ว

      In theory, yes, there are only 3 distinct values in this column, and yes, that means that one only really needs two bits to hold that info. But if we continue down that route, we now have a column that requires just two bits. How can one generalise that into anything useful? How can it be efficiently stored and indexed? What does one do when someone adds some new statuses? It’s just not practical. Using bitmap indexing where appropriate is a useful and good generalisation.

  • @raniketram
    @raniketram 3 ปีที่แล้ว

    Anyone knows his twitter handle, please let me know

  • @rosendo3219
    @rosendo3219 3 หลายเดือนก่อน

    isn't this ridiculously wrong?
    you don't build bit map index, you build a btree index
    bitmap is index access, the way planner decides to access the btree index.
    dude, wtf, bitmap index access is all about not accessing the same block page

  • @tenminutetokyo2643
    @tenminutetokyo2643 4 ปีที่แล้ว

    Indicies, not indexes. Thought you were all geniuses?

  • @knowledgeguide2003
    @knowledgeguide2003 8 หลายเดือนก่อน

    thanks

  • @OMERHAFEEZ-y7r
    @OMERHAFEEZ-y7r หลายเดือนก่อน

    thanks