1 / 7

Tree Bitmap

Dive into the world of Tree Bitmap with Kuan-Chieh Feng's presentation showcasing various node types and their functionalities in this innovative data structure. Explore the intricacies of internal and external bitmaps, next hop pointers, and more.

csizemore
Download Presentation

Tree Bitmap

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Tree Bitmap Presenter: Kuan-Chieh Feng Date:2016/07/06

  2. A D B E C Tree Bitmap

  3. A D B E C Tree Bitmap Multibit node ( 3-bit stride) • Next hop pointer • Point to children node.

  4. Tree Bitmap • Multibit Node – • Internal Tree bitmap ( 2r-1 bitmap ) • Next hop pointer 0 1 0 0 0 1 0 A D 0100010

  5. Tree Bitmap • Multibit Node – • External Bitmap( 2r bitmap ) • Children pointer A D 1 0 0 1 0 0 0 1 2 3 4 10010001

  6. A D B E C Tree Bitmap 0100010 10010001 0100000 1000000 1000000 00000000 00000000 00000000

  7. A D B E C Search 011 100 Next hop A 111 100 Next hop E 0100010 10010001 0100000 1000000 1000000 00000000 00000000 00000000

More Related