A New PR-Tree Index Based on Pyramid Division


Because the number of data objects is large in the spatial database, generally speaking, the cost of spatial database query is larger than that of the relational database, the traditional R-tree index structure allows the overlapping and coverage among the sibling nodes, resulting in the duplicate storage of the spatial objects and multiple query paths, the… (More)

2 Figures and Tables


  • Presentations referencing similar topics