View Forum Topic

Author	Message
malamma Posts: 25	Posted 18:01 Mar 20, 2013 \| I think this question is missing information in order to find the solutions: How much is the cost of retrieving all relevant internal nodes of a B+ tree from a root to the wanted leaf nod? What is the size of a page in bytes? Can we assume that 1.2 I/O is needed to use a hash index to find a data entry? Thanks, - Mustafa Last edited by malamma at 18:03 Mar 20, 2013.
hpguo Posts: 139	Posted 19:41 Mar 20, 2013 \| Nothing missing. yes.

Author

Message

malamma

Posts: 25

Posted 18:01 Mar 20, 2013 |

I think this question is missing information in order to find the solutions:

How much is the cost of retrieving all relevant internal nodes of a B+ tree from a root to the wanted leaf nod?

What is the size of a page in bytes?

Can we assume that 1.2 I/O is needed to use a hash index to find a data entry?

Thanks,

- Mustafa

Last edited by malamma at 18:03 Mar 20, 2013.

hpguo

Posts: 139

Posted 19:41 Mar 20, 2013 |

Nothing missing.

yes.