• Title/Summary/Keyword: Spatial Preference Query

Search Result 1, Processing Time 0.011 seconds

Efficient Processing of Spatial Preference Queries in Spatial Network Databases

  • Cho, Hyung-Ju;Attique, Muhammad
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.2
    • /
    • pp.210-224
    • /
    • 2019
  • Given a positive integer k as input, a spatial preference query finds the k best data objects based on the scores (e.g., qualities) of feature objects in their spatial neighborhoods. Several solutions have been proposed for spatial preference queries in Euclidean space. A few algorithms study spatial preference queries in undirected spatial networks where each edge is undirected and the distance between two points is the length of the shortest path connecting them. However, spatial preference queries have not been thoroughly investigated in directed spatial networks where each edge has a particular orientation that makes the distance between two points noncommutative. Therefore, in this study, we present a new method called ALPS+ for processing spatial preference queries in directed spatial networks. We conduct extensive experiments with different setups to demonstrate the superiority of ALPS+ over conventional solutions.