algorithm - How to do search in B+tree -


can explain how search done in b+ tree? confusing thing me in comparison b-tree, b+tree doesn't hold data in internal nodes, in leaves. examples have b+-tree index build on list of names. want find name "mary". root key in b+tree 20. how should compare "mary" 20, if 20 holds no data?


Comments

Popular posts from this blog

java - HTTP Status 500 - An exception occurred processing JSP page /second.jsp at line 15 -

php - Using str_replace to translate a MySQL Table in html -

asp.net mvc - Cannot display error message on Editor or EditorFor -