ON OPTIMAL SPATIAL DOMINANCE

MPhil Thesis Defence


Title: "ON OPTIMAL SPATIAL DOMINANCE"

By

Mr. Bin Zhang


Abstract

Speeding up spatial methods using hyperspheres as a core component is very 
important in the literature. For example, many indexing techniques such as 
an M-tree and a VP-tree and many uncertain database methods involves 
hyperspheres as one of the core components for answering many important 
spatial queries such as similarity search queries. These techniques 
heavily depends on an important operator called a spatial dominance for 
pruning in order to speed up spatial queries. In the thesis, we study the 
dominance problem which has a variety of applications. Given two 
hyperspheres S_a and S_b and a query hypersphere S_q, we want to determine 
whether S_a dominates (or is closer than) S_b with respect to S_q.

There are many existing methods relying on this operator. Unfortunately, 
the well-known conventional pruning technique which makes use of the 
maximum distance and the minimum distance is insufficient for the 
dominance problem. Motivated by this, we propose a novel method which is 
optimal and efficient for the problem. In addition, we give a list of 
existing applications which can benefit from this operator. Finally, we 
show the effectiveness and efficiency of our proposed method on real 
datasets.


Date:			Wednesday, 6 March 2013

Time:			2:00pm - 4:30pm

Venue:			Room 3301A
 			Lifts 17-18

Committee Members:	Dr. Raymond C W Wong (Supervisor)
 			Dr. Wilfred S H Ng (Chairperson)
 			Dr. Lei Chen



**** ALL are Welcome ****