Abstract
RBD-tree,a new variant index structure,derived from Ro-tree was introduced in this paper.RBD-tree is an index structure based on node density which is important to measure the node quality.The core idea of RBD-tree is to organize the nodes with similar features together.In reality,the nodes with similar features are often adjacent with each other.Therefore,RBD-tree greatly improves the spatial query efficiency,and optimization of the index structure is independent of storage devices.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
