Abstract
Given a query location and a set of query keywords, a top-k spatial keyword query rank objects based on the distance to the query location and textual relevance to the query keywords. Several solutions have been proposed for top-k spatial keyword queries in Euclidean space. However, few algorithms study top-k keyword queries in undirected road networks where every road segment is undirected. Even worse, insufficient attention has been given to the processing of keyword queries in directed road networks where each road segment has a particular orientation. Therefore, in this paper, we present an algorithm called eSPAK that can efficiently answer the top-k spatial keyword queries in directed road networks. Our experimental results demonstrate that eSPAK significantly outperforms conventional solution in terms of query processing cost.
| Original language | English |
|---|---|
| Journal | CEUR Workshop Proceedings |
| Volume | 1810 |
| State | Published - 2017 |
| Externally published | Yes |
| Event | 2017 Workshops of the International Conference on Extending Database Technology and the International Conference on Database Theory, EDBT/ICDT 2017 - Venice, Italy Duration: Mar 21 2017 → Mar 24 2017 |
Funding
We thank anonymous reviewers for their valuable comments and suggestions. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education(2016R1D1A1B03934129). Finally, this work was partially supported by Leaders Industry-University Cooperation Project.
Keywords
- Directed road networks
- Location-based services
- Spatial keyword queries
Fingerprint
Dive into the research topics of 'eSPAK: Top-k spatial keyword query processing in directed road networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver