A Linked Neighboring Leaves N-Tree to Support Distance Range Search

A Linked Neighboring Leaves N-Tree to Support Distance Range Search

Faïza Najjar, Hassenet Slimani
Copyright: © 2009 |Pages: 20
DOI: 10.4018/jitwe.2009010103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Mobile query processing is, actually, a very active research field. Range and nearest neighbor queries are common types of queries in spatial databases and location based services (LBS). In this paper, we focus on finding nearest neighbors of a query point within a certain distance range. An example of query, frequently met in LBS, is “Find all the nearest gas stations within 2 miles neighborhood of his/her current location”. We propose two approaches for answering such queries. Both are based on a recent indexing technique called N-tree. The first one is a branch and bound approach, whereas the second, called ‘neighborhoods scanning’, is based on a variant of N-tree, Leaves-Linked N-tree (LLN-tree). LLN-tree is an index tree structure that avoids visiting multiple paths during range search. Both techniques are presented, illustrated and evaluated. Experiments show that the latter approach outperforms the former in response time and disk access as well.

Complete Article List

Search this Journal:
Reset
Volume 18: 1 Issue (2023)
Volume 17: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing