IDEAS home Printed from https://ideas.repec.org/a/igg/jitwe0/v4y2009i1p31-50.html
   My bibliography  Save this article

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

Author

Listed:
  • Faïza Najjar

    (National School of Comp. Science, Tunisia)

  • Hassenet Slimani

    (Faculty of Sciences, Tunisia)

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.

Suggested Citation

  • Faïza Najjar & Hassenet Slimani, 2009. "A Linked Neighboring Leaves N-Tree to Support Distance Range Search," International Journal of Information Technology and Web Engineering (IJITWE), IGI Global, vol. 4(1), pages 31-50, January.
    • Handle: RePEc:igg:jitwe0:v:4:y:2009:i:1:p:31-50
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jitwe.2009010103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jitwe0:v:4:y:2009:i:1:p:31-50. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.