Google Groups Home
Help | Sign in
comp.databases.object
+ new post
About this group
Subscribe to this group
This is a Usenet group - learn more
How exactly is a BTREE implemented in a DBMS........
Options
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
   1 message - Collapse all
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
Bharath  
View profile
  More options Mar 19, 9:36 am
Newsgroups: comp.databases.object
From: Bharath <msbharath...@gmail.com>
Date: Wed, 19 Mar 2008 06:36:50 -0700 (PDT)
Local: Wed, Mar 19 2008 9:36 am
Subject: How exactly is a BTREE implemented in a DBMS........
Reply to author | Forward | Print | Individual message | Show original | Report this message | Find messages by this author
Hello friends,

I am student having a course on algorithms. I always had this doubt on
how exactly is a B-Tree implemented in a DBMS. B-Tree of course is
used for indexing purposes but, as any techie may be knowing that in a
B-Tree the nodes contains address to blocks in the disk. How does one
access such an address and Is it possible to write a C - program which
tries to mimic a B-Tree which does disk level indexing?


    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »

Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2008 Google