=====================================
SR-tree  (version 1.0)  memory-based
=====================================


A.  File Description
====================
srtree.desc		-- This README file
srtree.h		-- Head file for both srtree_build.c and srtree_search.c
srtree_build.c		-- SR-tree building part
srtree_search.c		-- SR-tree searching part: support both kNN and range search
Makefile		-- Makefile to compile the build and search programs


B. Compilation
==============
Type:   make  srtree_build
Type:   make  srtree_search

Note:  Please compile it under Solaris platform.


C. Execution
============
Try the following example:

Type:    srtree_build  <config file>

	You can also type "srtree_build" for more details about the usage.

Type:    srtree_search <config file> <k: for kNN search> <#query>

	You can also type "srtree_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:   srtree_build  configSample
Type:   srtree_search configSample 5  1


G.  Reference
=============
Title:       The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries
Author:      Katayama, N. and Satoh, S.
Conference:  ACM SIGMOD, 1997

Title:       Similarity Indexing with the SS-tree
Author:      White, David A. and Jain, Ramesh
Conference:  ICDE, 1996

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
==============
Yin-ling Cheung