K-th Order Skyline Queries in Bicriteria Networks
We consider the problem of k-th order skyline queries in bicriteria networks.Our proposed k-th order skyline queries consider distance,time preferences thus having two kinds of skyline queries,named Distance/Time Optimal k-th Order Skyline Queries (DO-kOSQ/TOkOSQ).We design algorithms for the two kinds of skyline queries in bicriteria networks based on incremental network expansion method and further develop maximum distance/time restriction strategies to improve the efficiency of the algorithms.Experimental results show efficiency and effectiveness of our proposed methods to answer k-th order skyline queries in real road networks.
Skyline query Bicriteria networks Euclidean distance
Shunqing Jiang Jiping Zheng Jialiang Chen Wei Yu
College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjin College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjin
国际会议
International Asia-Pacific Web Conference(第18届国际亚太互联网大会)
苏州
英文
488-491
2016-09-23(万方平台首次上网日期,不代表论文的发表时间)