|
Title:
|
N-TREE-BASED NEAREST NEIGHBORS SEARCH WITHIN DISTANCE RANGE QUERIES |
|
Author(s):
|
Hassenet Slimani , Faïza Najjar , Yahya Slimani |
|
ISBN:
|
978-972-8924-62-1 |
|
Editors:
|
Jörg Roth and Jairo Gutiérrez |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Location based services, range search, indexing, Voronoi diagram |
|
Type:
|
Full Paper |
|
First Page:
|
53 |
|
Last Page:
|
60 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Mobile query processing is, actually, a very active research field. Range and nearest neighbors search are two types of
queries which are widely supported by most of classic spatial databases and mobile location based services. In this paper,
we focus on combining both of them. We propose a new execution model for distance range queries based on a recent
indexing technique devised to resolve nearest neighbors queries; in other words our work finds nearest neighbors of a
query point in a certain range of distance . It allows processing of queries like "Find all nearest gas stations situated
between 2 km and 5 km". The execution model is presented, illustrated, discussed and computationally evaluated. |
|
|
|
|
|
|
