rtree.h

基于内容的多媒体数据库检索算法： 用于最近邻搜索的R*-tree算法

#define CONFIG_FILE	"rtree.config"
#define SAVE_RTREE_FILE "save_rtree_file"

#define FALSE    	0
#define TRUE     	1

#define RANGE_SEARCH 0
#define kNN_SEARCH 1
#define CHOICE kNN_SEARCH

#define ASC_NUM  	48
#define NO_ID	 	-1
#define FOUND		1
#define NOT_FOUND 	0

#define ROOT  0   
#define LEAF  1
#define NODE  2

#define INFINITY  FLT_MAX
#define UNDEFINED -3  // for id of entries in PR


/* Global variable ******************
m: min. number entries of each node;
M: max. number entries of each node;
dim: dimension of the rtree data.
*************************************/

int m, M, dim, reinsert_p, no_histogram;

int extra_level;

typedef struct node { float *a;
                      float *b;
		      int id;
                      int attribute;
                      int vacancy;
                      struct node *parent;
                      struct node **ptr; }   node_type;

typedef struct NN {	double dist;
			int oid;
			struct node *pointer; 
			struct NN *next; } NN_type;

typedef struct BranchArray {	double min;
				node_type *node;} ABL;


typedef struct config { int dim;
			int m;
			int M;
			int reinsert_p;
			int no_histogram;
			//char nodefile[FILENAME_MAX];
			//char rootfile[FILENAME_MAX];
			char queryfile[FILENAME_MAX];
			char positionfile[FILENAME_MAX]; 
			char save_tree_file[FILENAME_MAX]; 
}   config_type;