TY - JOUR
T1 - Continuous distance-based skyline queries in road networks
AU - Huang, Yuan Ko
AU - Chang, Chia Heng
AU - Lee, Chiang
N1 - Funding Information:
This work was supported by National Science Council of Taiwan (ROC) under Grant nos. NSC100-2221-E-244-018 and NSC100-2221-E-006-249-MY3 .
PY - 2012/11
Y1 - 2012/11
N2 - In recent years, the research community has introduced various methods for processing skyline queries in road networks. A skyline query retrieves the skyline points that are not dominated by others in terms of static and dynamic attributes (i.e., the road distance). This paper addresses the issue of efficiently processing continuous skyline queries in road networks. Two novel and important distance-based skyline queries are presented, namely, the continuous dε-skyline query (Cdε-SQ) and the continuous k nearest neighbor-skyline query (Cknn-SQ). A grid index is first designed to effectively manage the information of data objects and then two algorithms are proposed, the Cdε-SQ algorithm and the Cdε-SQ algorithm, which are combined with the grid index to answer the Cdε-SQ. Similarly, the Cknn-SQ algorithm and the Cknn-SQ algorithm are developed to efficiently process the Cknn-SQ. Extensive experiments using real road network datasets demonstrate the effectiveness and the efficiency of the proposed algorithms.
AB - In recent years, the research community has introduced various methods for processing skyline queries in road networks. A skyline query retrieves the skyline points that are not dominated by others in terms of static and dynamic attributes (i.e., the road distance). This paper addresses the issue of efficiently processing continuous skyline queries in road networks. Two novel and important distance-based skyline queries are presented, namely, the continuous dε-skyline query (Cdε-SQ) and the continuous k nearest neighbor-skyline query (Cknn-SQ). A grid index is first designed to effectively manage the information of data objects and then two algorithms are proposed, the Cdε-SQ algorithm and the Cdε-SQ algorithm, which are combined with the grid index to answer the Cdε-SQ. Similarly, the Cknn-SQ algorithm and the Cknn-SQ algorithm are developed to efficiently process the Cknn-SQ. Extensive experiments using real road network datasets demonstrate the effectiveness and the efficiency of the proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=84862827073&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84862827073&partnerID=8YFLogxK
U2 - 10.1016/j.is.2012.02.003
DO - 10.1016/j.is.2012.02.003
M3 - Article
AN - SCOPUS:84862827073
SN - 0306-4379
VL - 37
SP - 611
EP - 633
JO - Information Systems
JF - Information Systems
IS - 7
ER -