K-th Order Skyline Queries in Bicriteria Networks

详细信息    查看全文

• 关键词：Skyline query ; Bicriteria networks ; Euclidean distance
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9932
• 期：1
• 页码：488-491
• 全文大小：214 KB
• 参考文献：1.Börzsöny, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421–430 (2001)
  2.Costa, C.F., Nascimento, M.A., Macêdo, J.A.F.D., Machado, J.: A*-based solutions for knn queries with operating time constraints in time-dependent road networks. In: MDM, pp. 23–32 (2014)
  3.Huang, X., Jensen, C.S.: In-route skyline querying for location-based services. In: Kwon, Y.-J., Bouju, A., Claramunt, C. (eds.) W2GIS 2004. LNCS, vol. 3428, pp. 120–135. Springer, Heidelberg (2005)CrossRef
  4.Mouratidis, K., Lin, Y., Yiu, M.L.: Preference queries in large multi-cost transportation networks. In: ICDE, pp. 533–544 (2010)
  5.Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802–813. VLDB Endowment (2003)
  
• 作者单位：Shunqing Jiang (17)
  Jiping Zheng (17) (18)
  Jialiang Chen (17)
  Wei Yu (17)
  
  17. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
  18. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia
  
• 丛书名：Web Technologies and Applications
• ISBN：978-3-319-45817-5
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9932

文摘

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/TO-kOSQ). 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.