LIS Links

First and Largest Academic Social Network of LIS Professionals in India

Latest Activity

OKE CHANDAN updated their profile
2 hours ago
jai prakash kumar updated their profile
20 hours ago
Rohidas Rathod updated their profile
yesterday
Rohidas Bhimrao Rathod updated their profile
yesterday
Rohidas Bhimrao Rathod updated their profile
yesterday
Vinod Kumar Jain posted a status
"Required Library paid Intern @ 8000 PM for 6 Months for “Indexing Database”- in Delhi, 9818180051"
Monday
Vinod Kumar Jain posted a status
"Required Library Intern for “Indexing Database”- in Delhi"
Monday
Dr.Stephen.G commented on Dr.Stephen.G's event 'International Conference on Digital and Innovative Advancements for Sustainable Library Services'
Sunday
Dr.Stephen.G posted an event

International Conference on Digital and Innovative Advancements for Sustainable Library Services at Bharati Vidyapeeth’s Institute of Computer Applications & Management (BVICAM), New Delhi

August 29, 2025 at 10am to August 31, 2025 at 5pm
Sunday
Dr.Stephen.G posted a discussion
Sunday
Yogesh Kawale updated their profile
Thursday
Peeyush Dwivedi posted a blog post
Thursday
Ravithimmegowda posted a discussion
Thursday
Ashok Singh updated their profile
Jul 2
jai prakash kumar posted a status
"What are you up to?"
Jul 1
Abhisekh Chetry joined Dr. Badan Barman's group
Jul 1
Abhisekh Chetry joined Dr. Badan Barman's group
Jul 1
Sidhartha Batsya joined Dr. Badan Barman's group
Jun 29
Sidhartha Batsya joined Dr. Badan Barman's group
Jun 29
Dr. U. PRAMANATHAN posted blog posts
Jun 27

ratika kapoor

Views: 260

Reply to This

Replies to This Forum

B-Tree is an indexing technique most commonly used in databases and file systems where pointers to data are placed in a balance tree structure so that all references to any data can be accessed in an equal time frame. It is also a tree data structure which keeps data sorted so that searching, inserting and deleting can be done in logarithmic amortized time.

The B-Tree belongs to a group of techniques in computer science known as self-balancing search trees which attempts to automatically keep the number of levels of nodes under the root small at all times. It is the most preferred way to implement sets, associative arrays and other data structures that are used in computer programming languages, relational database management systems and low level data manipulations.

B-Trees

Introduction

A B-tree is a specialized multiway tree designed especially for use on disk. In a B-tree each node may contain a large number of keys. The number of subtrees of each node, then, may also be large. A B-tree is designed to branch out in this large number of directions and to contain a lot of keys in each node so that the height of the tree is relatively small. This means that only a small number of nodes must be read from disk to retrieve an item. The goal is to get fast access to the data, and with disk drives this means reading a very small number of records. Note that a large node size (with lots of keys in the node) also fits with the fact that with a disk drive one can usually read a fair amount of data at once.

Definitions

A multiway tree of order m is an ordered tree where each node has at most m children. For each node, if k is the actual number of children in the node, then k - 1 is the number of keys in the node. If the keys and subtrees are arranged in the fashion of a search tree, then this is called a multiway search tree of order m. For example, the following is a multiway search tree of order 4. Note that the first row in each node shows the keys, while the second row shows the pointers to the child nodes. Of course, in any useful application there would be a record of data associated with each key, so that the first row in each node might be an array of records where each record contains a key and its associated data. Another approach would be to have the first row of each node contain an array of records where each record contains a key and a record number for the associated data record, which is found in another file

RSS

© 2025   Created by Dr. Badan Barman.   Powered by

Badges  |  Report an Issue  |  Terms of Service

Koha Workshop