srtree.h

基于内容的多媒体数据检索算法SR-Tree

#define CONFIG_FILE	"srtree.config"
#define SAVE_SRTREE_FILE "save_srtree_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 srtree data.
*************************************/

int m, M, dim;
int reinsert_p;
int no_histogram;	// number of data points

int extra_level;	// number of levels increased during a new point insertion

typedef struct node { 
		int id;			// ID of data in leaf node or NO_ID for non-leaf
		int attribute;		// ROOT, LEAF, or NODE
		int vacancy;		// number of vacancy
		struct node *parent;	// parent node of this node
		double *a;		// lower bound (NODE) or feature (LEAF) for each dimension
		double *b;		// upper bound (NODE) or feature (LEAF) for each dimension
		struct node **ptr; 	// pointers to children
		double *centroid;
		double radius;
		int total_size;		// total number of points under this node
		//float **child_centroid;	// centroid of covering sphere of the child
		//float *child_radius;	// radius of covering sphere of the child
		//int   *child_size;	// total number of points in subtree rooted by the child
}   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 datafile[FILENAME_MAX]; 	// data file
			char save_tree_file[FILENAME_MAX];
}   config_type;