Indoor Top-k Keyword-aware Routing Query

Zijin Feng, Tiantian Liu, Huan Li, Hua Lu, Lidan Shou, Jianliang Xu

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Abstract

People have many activities indoors and there is an increasing demand of keyword-aware route planning for indoor venues. In this paper, we study the indoor top-k keyword-aware routing query (IKRQ). Given two indoor points s and t, an IKRQ returns k s-to-t routes that do not exceed a given distance constraint but have optimal ranking scores integrating keyword relevance and spatial distance. It is challenging to efficiently compute the ranking scores and find the best yet diverse routes in a large indoor space with complex topology. We propose prime routes to diversify top-k routes, devise mapping structures to organize indoor keywords and computing route keyword relevances, and derive pruning rules to reduce search space in routing. With these techniques, we design two search algorithms with different routing expansions. Experiments on synthetic and real data demonstrate the efficiency of our proposals.
OriginalsprogEngelsk
TitelThe 36th IEEE International Conference on Data Engineering (ICDE 2020)
Udgivelses stedUnited States
ForlagIEEE
StatusAccepteret/In press - 2020
Begivenhed36th IEEE International Conference on Data Engineering - Dallas, USA
Varighed: 20 apr. 202024 apr. 2020
Konferencens nummer: 36
https://www.utdallas.edu/icde/

Konference

Konference36th IEEE International Conference on Data Engineering
Nummer36
LandUSA
ByDallas
Periode20/04/202024/04/2020
Internetadresse

Citer dette

Feng, Z., Liu, T., Li, H., Lu, H., Shou, L., & Xu, J. (Accepteret/In press). Indoor Top-k Keyword-aware Routing Query. I The 36th IEEE International Conference on Data Engineering (ICDE 2020) IEEE.