Name
Abstract | ||
|---|---|---|
Based on the conventional R*Q-tree study, a novel R*Q-tree spatial database indexing technology is designed in order to solve the shortcoming of the conventional R*Q-tree to insert data into which quard. The novel R*Q-tree is created by adding the parent node VR*-tree and HR*-tree, making the data set of R*Q-tree near by partition forms of narrow-band line shape, the overlapping between the sub-tree of the R*-tree is greatly reduced and the scope of the entire spatial data is divided into narrow-band. There isn't any repeat between the R*-tree and the sub-regions. The experiment shows that the query efficiency of the improved R*Q-tree is significantly enhanced. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICNC.2010.5582974 | ICNC |
Keywords | Field | DocType |
r*q-tree,r*-tree,spatial database index,the novel r*q-tree,tree data structures,visual databases,r-tree,vr*-tree,database indexing,spatial database,hr*-tree,r*q-tree spatial database indexing technology,spatial data query,query processing,indexing,r tree,indexation,shape,spatial data,space technology | Spatial analysis,R-tree,Data mining,Space technology,Computer science,Tree (data structure),Search engine indexing,Database index,Partition (number theory),Spatial database | Conference |
Volume | ISBN | Citations |
2 | 978-1-4244-5958-2 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |