This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 6 months ago.

  • Author
    Posts
  • #1428095 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    A B+ tree index is to be built on the name attribute of the relation ‘student’. Assume that all the students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 14 bytes. Given this scenario that would be the best choice of the degree (no. Of pointers per node) of the b+ tree?

    Options :-

      Post your Training /Course Enquiry
      Are You looking institutes / coaching center for
      • IIT-JEE, NEET, CAT
      • Bank PO, SSC, Railways
      • Study Abroad
      Select your Training / Study category
    Reply To: A B+ tree index is to be built on the name attribute of the relation ‘student’. Assume that all ….
    Your information:




    Verify Yourself




    Log in with your credentials

    or    

    Forgot your details?

    Create Account