Nearest-neighbour query processing with non-spatial predicates for service allocation in smart space environment

J. Chung, K. H. Jung, Soon Young Jung, S. W. Kang, J. M. Gil

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The extensive capability of sensors let sensors autonomously collect various information on smart objects and store them to the spatial database through the wireless sensor networks. Based on spatial database, location-dependent information services (LDISs) can supply the resources according to the user locations. In LDISs, nearest-neighbour queries which return the closest object around the query location is recognised as the key component for searching the easily accessible services in smart spaces. However, existing works only consider the Euclidean distance. Thus, they have limitations to provide user-centric services that require the consideration for not only the distance but also the status of smart objects. Motivated by the issues of nearest-neighbour queries, this study proposes the new type of query called specified nearest-neighbour (SNN). SNN query considers the status and the locations of smart objects. For the SNN, the authors suggest a novel signature-based R-tree (SR-tree) index structure that handles non-spatial information of objects efficiently. Further, the authors propose an SNN query processing technique. Finally, they evaluate the performance of the proposed algorithm in various circumstances. Performance results indicate that SNN algorithm with SR-tree outperforms the existing works in terms of computational cost and disk input/output (I/O).

Original languageEnglish
Pages (from-to)2470-2481
Number of pages12
JournalIET Communications
Volume5
Issue number17
DOIs
Publication statusPublished - 2011 Nov 25

Fingerprint

Query processing
Information services
Sensors
Wireless sensor networks
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications

Cite this

Nearest-neighbour query processing with non-spatial predicates for service allocation in smart space environment. / Chung, J.; Jung, K. H.; Jung, Soon Young; Kang, S. W.; Gil, J. M.

In: IET Communications, Vol. 5, No. 17, 25.11.2011, p. 2470-2481.

Research output: Contribution to journalArticle

@article{11aadb6d17e84ca39c84de86682790e5,
title = "Nearest-neighbour query processing with non-spatial predicates for service allocation in smart space environment",
abstract = "The extensive capability of sensors let sensors autonomously collect various information on smart objects and store them to the spatial database through the wireless sensor networks. Based on spatial database, location-dependent information services (LDISs) can supply the resources according to the user locations. In LDISs, nearest-neighbour queries which return the closest object around the query location is recognised as the key component for searching the easily accessible services in smart spaces. However, existing works only consider the Euclidean distance. Thus, they have limitations to provide user-centric services that require the consideration for not only the distance but also the status of smart objects. Motivated by the issues of nearest-neighbour queries, this study proposes the new type of query called specified nearest-neighbour (SNN). SNN query considers the status and the locations of smart objects. For the SNN, the authors suggest a novel signature-based R-tree (SR-tree) index structure that handles non-spatial information of objects efficiently. Further, the authors propose an SNN query processing technique. Finally, they evaluate the performance of the proposed algorithm in various circumstances. Performance results indicate that SNN algorithm with SR-tree outperforms the existing works in terms of computational cost and disk input/output (I/O).",
author = "J. Chung and Jung, {K. H.} and Jung, {Soon Young} and Kang, {S. W.} and Gil, {J. M.}",
year = "2011",
month = "11",
day = "25",
doi = "10.1049/iet-com.2010.0928",
language = "English",
volume = "5",
pages = "2470--2481",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology",
number = "17",

}

TY - JOUR

T1 - Nearest-neighbour query processing with non-spatial predicates for service allocation in smart space environment

AU - Chung, J.

AU - Jung, K. H.

AU - Jung, Soon Young

AU - Kang, S. W.

AU - Gil, J. M.

PY - 2011/11/25

Y1 - 2011/11/25

N2 - The extensive capability of sensors let sensors autonomously collect various information on smart objects and store them to the spatial database through the wireless sensor networks. Based on spatial database, location-dependent information services (LDISs) can supply the resources according to the user locations. In LDISs, nearest-neighbour queries which return the closest object around the query location is recognised as the key component for searching the easily accessible services in smart spaces. However, existing works only consider the Euclidean distance. Thus, they have limitations to provide user-centric services that require the consideration for not only the distance but also the status of smart objects. Motivated by the issues of nearest-neighbour queries, this study proposes the new type of query called specified nearest-neighbour (SNN). SNN query considers the status and the locations of smart objects. For the SNN, the authors suggest a novel signature-based R-tree (SR-tree) index structure that handles non-spatial information of objects efficiently. Further, the authors propose an SNN query processing technique. Finally, they evaluate the performance of the proposed algorithm in various circumstances. Performance results indicate that SNN algorithm with SR-tree outperforms the existing works in terms of computational cost and disk input/output (I/O).

AB - The extensive capability of sensors let sensors autonomously collect various information on smart objects and store them to the spatial database through the wireless sensor networks. Based on spatial database, location-dependent information services (LDISs) can supply the resources according to the user locations. In LDISs, nearest-neighbour queries which return the closest object around the query location is recognised as the key component for searching the easily accessible services in smart spaces. However, existing works only consider the Euclidean distance. Thus, they have limitations to provide user-centric services that require the consideration for not only the distance but also the status of smart objects. Motivated by the issues of nearest-neighbour queries, this study proposes the new type of query called specified nearest-neighbour (SNN). SNN query considers the status and the locations of smart objects. For the SNN, the authors suggest a novel signature-based R-tree (SR-tree) index structure that handles non-spatial information of objects efficiently. Further, the authors propose an SNN query processing technique. Finally, they evaluate the performance of the proposed algorithm in various circumstances. Performance results indicate that SNN algorithm with SR-tree outperforms the existing works in terms of computational cost and disk input/output (I/O).

UR - http://www.scopus.com/inward/record.url?scp=84857261074&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84857261074&partnerID=8YFLogxK

U2 - 10.1049/iet-com.2010.0928

DO - 10.1049/iet-com.2010.0928

M3 - Article

AN - SCOPUS:84857261074

VL - 5

SP - 2470

EP - 2481

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 17

ER -