This article is
- freely available
Skyline Query Processing in Sensor Network Based on Data Centric Storage
Department of Computer Engineering, Chungju National University, 72 Daehak-ro, Chungju-si, Chungbuk 380-702, Korea
School of Media Engineering, Dong-Ah Institute of Media and Arts, Dong-Ah yedae Rd. 47 Samjuk-myeon, Anseong-si, Gyeonggi-do 456-717, Korea
* Author to whom correspondence should be addressed.
Received: 1 October 2011; in revised form: 27 October 2011 / Accepted: 28 October 2011 / Published: 28 October 2011
Abstract: Data centric storages for sensor networks have been proposed to efficiently process multi-dimensional range queries as well as exact matches. Usually, a sensor network does not process only one type of the query, but processes various types of queries such as range queries, exact matches and skyline queries. Therefore, a sensor network based on a data centric storage for range queries and exact matches should process skyline queries efficiently. However, existing algorithms for skyline queries have not considered the features of data centric storages. Some of the data centric storages store similar data in sensor nodes that are placed on geographically similar locations. Consequently, all data are ordered in a sensor network. In this paper, we propose a new skyline query processing algorithm that exploits the above features of data centric storages.
Keywords: skyline query; sensor network; data centric storage
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Song, S.; Kwak, Y.; Lee, S. Skyline Query Processing in Sensor Network Based on Data Centric Storage. Sensors 2011, 11, 10283-10292.
Song S, Kwak Y, Lee S. Skyline Query Processing in Sensor Network Based on Data Centric Storage. Sensors. 2011; 11(11):10283-10292.
Song, Seokil; Kwak, Yunsik; Lee, Seokhee. 2011. "Skyline Query Processing in Sensor Network Based on Data Centric Storage." Sensors 11, no. 11: 10283-10292.