2016
DOI: 10.3390/ijgi5100170
|View full text |Cite
|
Sign up to set email alerts
|

Top-k Spatial Preference Queries in Directed Road Networks

Abstract: Top-k spatial preference queries rank objects based on the score of feature objects in their spatial neighborhood. Top-k preference queries are crucial for a wide range of location based services such as hotel browsing and apartment searching. In recent years, a lot of research has been conducted on processing of top-k spatial preference queries in Euclidean space. While few algorithms study top-k preference queries in road networks, they all focus on undirected road networks. In this paper, we investigate the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 29 publications
0
4
0
Order By: Relevance
“…In this method, different parameters that affect a decision need to be identified first and then can be categorized by their priority by comparing weights and scales. The geographical data is also an important part of some problems and could be added as a layer in the AHP method [49][50][51][52]. The weighting system can use simple numbers, fuzzy numbers, or triangular fuzzy numbers [53][54][55][56].…”
Section: Analytic Hierarchy Process (Ahp) Ranking Methodsmentioning
confidence: 99%
“…In this method, different parameters that affect a decision need to be identified first and then can be categorized by their priority by comparing weights and scales. The geographical data is also an important part of some problems and could be added as a layer in the AHP method [49][50][51][52]. The weighting system can use simple numbers, fuzzy numbers, or triangular fuzzy numbers [53][54][55][56].…”
Section: Analytic Hierarchy Process (Ahp) Ranking Methodsmentioning
confidence: 99%
“…Recent studies have investigated several spatial queries, such as nearest neighbor, reverse nearest neighbor, range, and various top-k queries for road networks [15][16][17][18][19]. Rocha et al [7] considered top-k spatial keyword queries for road networks, and proposed an efficient indexing technique and an overlay network to group objects in regions with similar textual description, thereby enabling the computation of upper-bound scores for all objects in the region.…”
Section: Top-k Keyword Queriesmentioning
confidence: 99%
“…On the other hand, GPS-enabled devices, such as smartphones, wireless sensor networks (WSN), and navigation systems, are responsible for generating a massive number of spatial query requests. The most common instances of spatial queries [1] associated with popular LBSs include shortest path queries, range queries [2,3], k-nearest neighbor (k-NN) queries [4,5], reverse k-NN queries [6], and preference queries [7][8][9]. To address the growing demand for such services, a significant amount of research has been conducted over the past few years to monitor and improve the processing of spatial queries.…”
Section: Introductionmentioning
confidence: 99%