Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Jiang, S., Zheng, J., Chen, J., & Yu, W. (2016). K-th order skyline queries in bicriteria networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9932 LNCS, pp. 488–491). Springer Verlag. https://doi.org/10.1007/978-3-319-45817-5_52
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
