Collective keyword search on spatial network databases

Yanhong Li, Guohui Li, Lihchyun Shu

研究成果: Article同行評審

摘要

Spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects, have received a growing number of attention in real life. However, most of the existing SKQ methods are either focused on finding individual objects that each satisfy a query requirement or limited in Euclidean space. The paper takes the first step to address the issue of processing Collective Spatial Keyword Queries in Road Networks (CoSKQRN). Two efficient algorithms called AppM and OptM are proposed. In particular, AppM method is used to get the approximate result set with a relatively low cost, and OptM is to get the optimal query result set with a reasonable cost. Finally, simulation experiments on a real road network and a geo-textual dataset are conducted to demonstrate the performance of our proposed algorithms.

原文English
頁(從 - 到)5489-5497
頁數9
期刊Journal of Computational Information Systems
11
發行號15
DOIs
出版狀態Published - 2015 八月 1

All Science Journal Classification (ASJC) codes

  • 資訊系統
  • 電腦科學應用

指紋

深入研究「Collective keyword search on spatial network databases」主題。共同形成了獨特的指紋。

引用此