Browse > Article
http://dx.doi.org/10.9717/kmms.2019.22.2.210

Efficient Processing of Spatial Preference Queries in Spatial Network Databases  

Cho, Hyung-Ju (Department of Software, Kyungpook National University)
Attique, Muhammad (Department of Software, Sejong University)
Publication Information
Journal of Korea Multimedia Society / v.22, no.2, 2019 , pp. 210-224 More about this Journal
Abstract
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.
Keywords
Spatial Preference Query; Spatial Network Databases; Range Constraint;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S.Y. Kim and S.M. Cho, "A Haptic Navigation System for Visually Impaired Persons," Journal of Korea Multimedia Society, Vol. 14, No. 1, pp. 133-143, 2011.   DOI
2 W. Park and T. Park, "An Efficient Channel Navigation Scheme Based on Patterns of Watching TV Programs," Journal of Korea Multimedia Society, Vol. 13, No. 9, pp. 1357-1364, 2010.
3 D. Yung, M.L. Yiu, and E. Lo, "A Safe-exit Approach for Efficient Network-based Moving Range Queries," Data and Knowledge Engineering, Vol. 72, pp. 126-147, 2012.   DOI
4 T. Abeywickrama, M.A. Cheema, and D. Taniar, "k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation," The Proceedings of the Very Large Data Bases Endowment, Vol. 9, No. 6, pp. 492-503, 2016.
5 M.L. Yiu, H. Lu, N. Mamoulis, and M. Vaitis, "Ranking Spatial Data by Quality Preferences," IEEE Transactions on Knowledge and Data Engineering, Vol. 23, No. 3, pp. 433-446, 2011.   DOI
6 H.J. Cho, S.J. Kwon, and T.S. Chung, "ALPS: an Efficient Algorithm for Top-k Spatial Preference Search in Road Networks," Knowledge and Information Systems, Vol. 42, No. 3, pp. 599-631, 2015.   DOI
7 L. Chen, J. Xu, X. Lin, C.S. Jensen, and H. Hu, "Answering Why-not Spatial Keyword Topk Queries via Keyword Adaption," Proceedings of International Conference on Data Engineering, pp. 697-708, 2016.
8 L. Guo, J. Shao, H.H. Aung, and K.L. Tan, "Efficient Continuous Top-k Spatial Keyword Queries on Road Networks," GeoInformatica, Vol. 19, No. 1, pp. 29-60, 2015.   DOI
9 J.B. Rocha-Junior and K. Norvag, "Top-k Spatial Keyword Queries on Road Networks," Proceeding of International Conference on Extending Database Technology, pp. 168-179, 2012.
10 N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: an Efficient and Robust Access Method for Points and Rectangles," Proceeding of International Conference on Management of Data, pp. 322-331, 1990.
11 A. Guttman, "R-trees: a Dynamic Index Structure for Spatial Searching," Proceeding of International Conference on Management of Data, pp. 47-57, 1984.
12 R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," Proceeding of Symposium on Principles of Database Systems, pp. 102-113, 2001.
13 Real Datasets for Spatial Databases, https://www.cs.utah.edu/-lifeifei/SpatialDataset.htm (accessed Dec., 20, 2018).
14 J.B. Rocha-Junior, A. Vlachou, C. Doulkeridis, and K. Norvag, "Efficient Processing of Topk Spatial Preference Queries," The Proceedings of the Very Large Data Bases Endowment, Vol. 4, No. 2, pp. 93-104, 2010.
15 K. Mouratidis, M.L. Yiu, D. Papadias, and N. Mamoulis, "Continuous Nearest Neighbor Monitoring in Road Networks," Proceedings of International Conference on Very Large Data Bases, pp. 43-54, 2006.
16 S. Yang, M.A. Cheema, X. Lin, and W. Wang, "Reverse k Nearest Neighbors Query Processing: Experiments and Analysis," The Proceedings of the Very Lare Data Bases Endowment, Vol. 8, No. 5, pp. 605-616, 2015.
17 A.M. Aly, W.G. Aref, and M. Ouzzani, "Spatial Queries with Two kNN Predicates," The Proceedings of the Very Large Data Bases Endowment, Vol. 5, No. 11, pp. 1100-1111, 2012.
18 S. Peng and H. Samet, "Analytical Queries on Road Networks: An Experimental Evaluation of Two System Architectures," Proceedings of International Conference on Advances in Geographic Information Systems, pp. 1:1-1:10, 2015.
19 S. Peng, J. Sankaranarayanan, and H. Samet, "SPDO: High-Throughput Road Distance Computations on Spark Using Distance Oracles," Proceedings of International Conference on Data Engineering, pp. 1239-1250, 2016.
20 M.L. Yiu, X. Dai, N. Mamoulis, and M. Vaitis, "Top-k Spatial Preference Queries," Proceeding of International Conference on Data Engineering, pp. 1076-1085, 2007.
21 D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases," Proceeding of International Conference on Very Large Data Bases, pp. 802-813, 2003.
22 American Hotel and Lodging Association, http://www.ahla.com/ (accessed Dec., 20, 2018).