Description: R tree, which forms of access to the most common use of a rectangular shape, which is based on heuristic optimization rectangular inherent in all nodes running on a standardized test platform height data, inquiries and the operation of many experiments, we can design the optimal merging of the joint R* Tree region, judging from the various and overlapping rectangular marginal in the directory using our standardized test bed in a detailed performance comparisons, and it results R* tree clearly better than the existing R-tree deformation Guttman's linear and quadratic R-tree and R Green Tree deformation, R* Tree of this advantage at different type of inquiry and operation, such as maps cover. For two and multi-dimensional rectangular in all experiments from a practical point of R* tr
- [Rtree.tar] - Oh, no go, scared to death of me! You ea
- [HnSRTree-2.0beta5a] - SR-tree is an index structure for high-d
- [java-rbtree-project-ok] - R and B-tree tree of mixed tree, in the
- [RTree] - Rtree C language, learning the R-tree fr
- [TSPGACCODE] - traveling salesman problem genetic algor
- [aco2] - Ant colony algorithm in path planning: h
- [RTree] - Spatial database system, the index of we
- [RTreeTemplate] - R tree, with the search, add, delete nod
- [document_rtree] - R-tree Index Data Design and Implementat
- [R_tree] - R-tree Index in the paper related to the
File list (Check if you may need any files):
Download