有向道路网络中增量top-k关键字查询

2018 Eleventh International Conference on Mobile Computing and Ubiquitous Network (ICMU) Pub Date : 2018-10-01 DOI:10.23919/ICMU.2018.8653256

M. Attique, Tae-Sun Chung

{"title":"有向道路网络中增量top-k关键字查询","authors":"M. Attique, Tae-Sun Chung","doi":"10.23919/ICMU.2018.8653256","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the problem of processing and monitoring of incremental top-k spatial keyword queries in directed road networks (TkSK). Unfortunately, the existing solutions focuses on static top-k keyword queries on undirected road networks. We propose a safe-exit based approach to monitor the validity of the results for incremental top-k queries where query points are randomly moving in directed road networks.","PeriodicalId":398108,"journal":{"name":"2018 Eleventh International Conference on Mobile Computing and Ubiquitous Network (ICMU)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Incremental top-k keyword queries in directed road networks\",\"authors\":\"M. Attique, Tae-Sun Chung\",\"doi\":\"10.23919/ICMU.2018.8653256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the problem of processing and monitoring of incremental top-k spatial keyword queries in directed road networks (TkSK). Unfortunately, the existing solutions focuses on static top-k keyword queries on undirected road networks. We propose a safe-exit based approach to monitor the validity of the results for incremental top-k queries where query points are randomly moving in directed road networks.\",\"PeriodicalId\":398108,\"journal\":{\"name\":\"2018 Eleventh International Conference on Mobile Computing and Ubiquitous Network (ICMU)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Eleventh International Conference on Mobile Computing and Ubiquitous Network (ICMU)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ICMU.2018.8653256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference on Mobile Computing and Ubiquitous Network (ICMU)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ICMU.2018.8653256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了有向道路网络(TkSK)中增量top-k空间关键字查询的处理和监控问题。不幸的是，现有的解决方案主要集中在无向道路网络上的静态top-k关键字查询。我们提出了一种基于安全出口的方法来监控增量top-k查询结果的有效性，其中查询点在定向道路网络中随机移动。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Incremental top-k keyword queries in directed road networks

In this paper, we investigate the problem of processing and monitoring of incremental top-k spatial keyword queries in directed road networks (TkSK). Unfortunately, the existing solutions focuses on static top-k keyword queries on undirected road networks. We propose a safe-exit based approach to monitor the validity of the results for incremental top-k queries where query points are randomly moving in directed road networks.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 Eleventh International Conference on Mobile Computing and Ubiquitous Network (ICMU)

自引率

0.00%

发文量