UBICC-submitted 206 206
UBICC-submitted 206 206
UBICC-submitted 206 206
ABSTRACT
The query service for the location of an object is called Location Based Services
(LBSs), and Reverse Nearest Neighbor (RNN) queries are one of them. RNN queries
have diversified applications, such as decision support system, market decision,
query of database document, and biological information. Studies of RNN in the past,
however, focused on inquirers in immobile status without consideration of
continuous demand for RNN queries in moving conditions. In the environment of
wireless network, users often remain in moving conditions, and sending a query
command while moving is a natural behavior. Availability of such service therefore
becomes very important; we refer to this type of issue as Continuous Reverse
Nearest Neighbor (CRNN) queries. Because an inquirers location changes
according to time, RNN queries will return different results according to different
locations. For a CRNN query, executing RNN search for every point of time during a
continuous query period will require a tremendously large price to pay. In this work,
an efficient algorithm is designed to provide precise results of a CRNN query in just
one execution. In addition, a large amount of experiments were conducted to verify
the above-mentioned method, of which results of the experiments showed significant
enhancement in efficiency.
Keywords: Location Based Services, Location-Dependent Query, Continuous
Query, Reverse Nearest Neighbor Query, Continuous Reverse Nearest Neighbor
Query
1
INTRODUCTION
Volume 3 Number 2
Page 114
www.ubicc.org
Volume 3 Number 2
Page 115
RELATED WORK
www.ubicc.org
2.1.1R-Tree
R-Tree is an index structure developed in early
years for spatial database and was used by [10] to
accelerate RNN search processing. All objects are
grouped and then placed on leaf nodes according to
the closeness of their coordinates. That is, objects at
similar coordinates are put in one group. Next, each
group of objects is contained in a smallest possible
rectangle, which is called Minimum Bounding
Rectangle (MBR). Next, MBRs are grouped in
clusters, which are contained inside a larger MBR
until all objects are contained in the same MBR.
What is stored on an internal node of a R-Tree is an
MBR, in which all nodes underneath are contained,
and the root of the R-Tree contains all objects. The
size and range of an MBR is defined by its lower left
coordinate (MlMd) and upper right coordinate (Mr
Mu). Figure 2 is an example of R-Tree. From a to l,
there are total 12 objects; (a b c d) belong to
MBR b1, and (efg) belong to MBR b2. MBR b1
and b2 belong to MBR B1, and MBR R contains all
objects..
Volume 3 Number 2
Page 116
www.ubicc.org
3 Problem Formulation
CRNN query concerns about a period of
continuing time where adjacent points in such period
of time may have the identical RNN. That is, a period
of time may have the same RNN unless the query q
has moved beyond this period of time. Please refer to
Figure 4. When a user executes CRNN query q, the
time segment of the continuous query is [PsPe], and
the query objects are {abcd}. If time point P1
can be identified, and any given point of time in the
time segment from Ps to P1, or [PsP1], has the same
RNN result, then one-time execution of RNN search
is all it needs for the time segment of [Ps P1]. If
points of time, P2, P3, and P4, are also identified, and
any given point of time in the time segment of [P1
P2] has the identical RNN result, while any given
point of time in the time segment of [P2P3] has the
identical result, and any given point of time in the
time segment of [P3P4] has the identical result, then
the entire CRNN query needs only one-time
execution of RNN search at each time segment.
For processing CRNN query, it is not necessary
to execute RNN search for every point of time and
return the RNN of every point of time back to query
Volume 3 Number 2
Page 117
www.ubicc.org
Volume 3 Number 2
Page 118
www.ubicc.org
Volume 3 Number 2
Page 119
www.ubicc.org
the branch all the way to the lead node. All entries
underneath such leaf node are recorded as the
candidate objects for RNN query result. The
collection of these candidate objects is referred to as
RNNCanSet, which means the possible results for
RNN query must exist within this collection, and the
objects outside of RNNCanSet can not possibly be
RNN query results. All that are needed to be
considered when finding segment point of CRNNq of
CRNN search algorithm are the objects inside
RNNCanSet. This will greatly reduce the quantity of
objects needed to be handled and enhance CRNN
search algorithm efficiency.
Figure 3 explains the pruning process. It begins
with root node R. Because D(q R) MaxDnn of R,
child nodes of B1 and B2 must be examined. Because
the MaxDnn of MBR B1 D(qB1), all child nodes
underneath B1 can be pruned. Next, D(q
B2)MaxDnn of B2, so child nodes b3 and b4 of B2
must be examined. D(qb3) is equal to or smaller
than the MaxDnn of b3, which is also a leaf node;
Volume 3 Number 2
Page 120
www.ubicc.org
0.8
0.8
0.8
0.6
0.6
0.6
Y axsi
Y axis
Y axis
0.4
0.4
0.4
0.2
0.2
0.2
0
0
0.2
0.4
0.6
0.8
0.2
0.4
0.6
0.8
X axis
X axis
0.2
0.4
0.6
0.8
X axis
Description
Data distribution
interval
Time interval of
Query
Number of Data
Objects
object-no
Settings
Uniform,
Gaussian, Zipf
1, 2, 5, 8, 10
1, 10. 30, 50 ,
100(k)
Volume 3 Number 2
Page 121
www.ubicc.org
107
107
CRNN without index
CRNN with index
106
106
105
105
10
104
104
3
10
104
103
102
10
10
10
102
10
1K
10K
30K
50K
100K
106
105
Total time (sec).
1
1K
10K
object-no
30K
50K
1K
100K
10K
30K
50K
100K
object-no
object-no
Figure 11: Influences on different types of data distribution from changing object-no
distance of MinD(qline Rect) decreases, causing
pruning efficiency to reduce. On the contrary, when
the interval increases, the number of time
segmentation
by
CRNN
query
increases.
Consequently, the number of RNN searches for every
segment increases, and total cost of CRNN query
increases as well.
105
105
105
104
104
104
CRNN without index
CRNN with index
103
102
10
103
102
10
1
1
10
103
102
10
1
1
Query Interval
5
Query Interval
10
5
Query Interval
10
Volume 3 Number 2
Page 122
www.ubicc.org
Volume 3 Number 2
Page 123
www.ubicc.org
Volume 3 Number 2
Page 124
www.ubicc.org