A Linked Neighboring Leaves N-Tree to Support Distance Range Search
Faïza Najjar and
Hassenet Slimani
Additional contact information
Faïza Najjar: National School of Comp. Science, Tunisia
Hassenet Slimani: Faculty of Sciences, Tunisia
International Journal of Information Technology and Web Engineering (IJITWE), 2009, vol. 4, issue 1, 31-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.
Date: 2009
References: Add references at CitEc
Citations:
Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/jitwe.2009010103 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:igg:jitwe0:v:4:y:2009:i:1:p:31-50
Access Statistics for this article
International Journal of Information Technology and Web Engineering (IJITWE) is currently edited by Ghazi I. Alkhatib
More articles in International Journal of Information Technology and Web Engineering (IJITWE) from IGI Global
Bibliographic data for series maintained by Journal Editor ().