文件列表:

rstree (0, 2006-04-01)
rstree\configSample (72, 2002-08-19)
rstree\dataSample (10000, 2002-08-19)
rstree\querySample (100, 2002-08-19)
rstree\rstree.desc (1669, 2002-08-19)
rstree\rstree_build.c (27416, 2002-08-19)
rstree\rstree_search.c (11494, 2002-08-19)
rstree\rtree.h (1359, 2002-08-19)
rstree\Rstar3.pdf (1143149, 2006-04-01)

==================================== R*-tree (version 1.0) memory-based ==================================== A. File Description ==================== rstree.desc -- This README file rtree.h -- Head file for both rstree_build.c and rstree_search.c rstree_build.c -- R*-tree building part rstree_search.c -- R*-tree searching part: support both kNN and range search Makefile -- Makefile to compile the build and search programs B. Compilation ============== Type: make rstree_build Type: make rstree_search Note: Please compile it under Solaris platform. C. Execution ============ Try the following example: Type: rstree_build You can also type "rstree_build" for more details about the usage. Type: rstree_search <#query> You can also type "rstree_search" for more details about the usage. D. Data File Format ==================== Each line of data file store a single vector for an object (point). Each line consists of the coordinate of the point in each dimension. E. Config. File Format ======================= Content of config. file: Line 1: Minimum branching factor, m. Line 2: Miximum branching factor, M. Line 3: Dimension. Line 4: Reinsert factor. Line 5: Number of points. Line 6: Path of data file. Line 7: Path of query file storing a number of query points. F. Execute Sample =================== Type: rstree_build configSample Type: rstree_search configSample 5 1 G. Reference ============= Title: The R*-tree: an efficient and robust access method for points and rectangles Author: Beckmann, N. and Kriegel, H.P. and Schneider, R. and Seeger, B. Conference: ACM SIGMOD, 1990 H. Programmer ============== Kelvin Kam-wing Chu

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：