Zitong Chen, Yubao Liu, A. Fu, R. C. Wong, Genan Dai
{"title":"道路网络中的KOLQ","authors":"Zitong Chen, Yubao Liu, A. Fu, R. C. Wong, Genan Dai","doi":"10.1109/MDM.2019.00-71","DOIUrl":null,"url":null,"abstract":"Optimal location querying (OLQ) in road networks is important for various applications. Existing work assumes no labels for servers and that a client only visits the nearest server. These assumptions are not realistic and it renders the existing work not useful in many cases. In this paper, we introduce the KOLQ problem which considers the k nearest servers of clients and labeled servers. We also proposed algorithms for the problem. Extensive experiments on the real road networks illustrate the efficiency of our proposed solutions.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"KOLQ in a Road Network\",\"authors\":\"Zitong Chen, Yubao Liu, A. Fu, R. C. Wong, Genan Dai\",\"doi\":\"10.1109/MDM.2019.00-71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal location querying (OLQ) in road networks is important for various applications. Existing work assumes no labels for servers and that a client only visits the nearest server. These assumptions are not realistic and it renders the existing work not useful in many cases. In this paper, we introduce the KOLQ problem which considers the k nearest servers of clients and labeled servers. We also proposed algorithms for the problem. Extensive experiments on the real road networks illustrate the efficiency of our proposed solutions.\",\"PeriodicalId\":241426,\"journal\":{\"name\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2019.00-71\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2019.00-71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal location querying (OLQ) in road networks is important for various applications. Existing work assumes no labels for servers and that a client only visits the nearest server. These assumptions are not realistic and it renders the existing work not useful in many cases. In this paper, we introduce the KOLQ problem which considers the k nearest servers of clients and labeled servers. We also proposed algorithms for the problem. Extensive experiments on the real road networks illustrate the efficiency of our proposed solutions.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
