
[1]W. Dargie and C. Poellabauer, Fundamentals of Wireless Sensor Networks: Theory and Practice. West Sussex: Wiley, 2010. [2]P. Kumar, L. Reddy, and S. Varma, “Distance Measurement and Error Estimation Scheme for RSSI Based Localization in Wireless Sensor Networks,” in Proceedings of the 5th IEEE Conference on Wireless Communication and Sensor Networks (WCSN), 2009, pp. 1–4. [3]D. Papadias, Y. Tao, G. Fu, and B. Seeger, “Progressive skyline computation in database systems,” ACM Trans. Database Syst., vol. 30, no. 1, pp. 41–82, 2005. [4]S. Ranu, “Applications of Top k Representative Queries,” in Proceedings of Semantic Web Information Management on Semantic Web Information Management, 2014, pp. 5–6. [5]M. L. Yiu and N. Mamoulis, “Efficient processing of topk dominating queries on multidimensional data,” in Proceedings of the 33rd international conference on Very large data bases (VLDB ’07 ), 2007, pp. 483–494. [6]I. Ilyas, G. Beskales, and M. Soliman, “A survey of topk query processing techniques in relational database systems,” ACM Comput. Surv., vol. 40, no. 4, pp. 1–58, 2008. [7]E. Tiakas, A. N. Papadopoulos, and Y. Manolopoulos, “Skyline queries: An introduction,” in Proceedings of the 6th International Conference on Information, Intelligence, Systems and Applications, 2016. [8]X. Miao, Y. Gao, G. Chen, H. Li, and B. Zheng, “Top k Dominating Queries on Incomplete Data,” IEEE Trans. Knowl. Data Eng, vol. 28, no. 1, pp. 252–266, 2016. [9]Y. J. Kim and J. Patel, “Performance comparison of the R*tree and the quadtree for kNN and distance join queries,” IEEE Trans. Knowl. Data Eng., vol. 22, no. 7, pp. 1014–1027, 2010. [10]M. L. Yiu and N. Mamoulis, “Multidimensional topk dominating queries,” VLDB J., vol. 18, no. 3, pp. 695–718, 2009. [11]E. Tiakas, G. Valkanas, A. N. Papadopoulos, Y. Manolopoulos, and D. Gunopulos, “Processing Topk Dominating Queries in Metric Spaces,” ACM Trans. Database Syst., vol. 40, no. 4, pp. 23:1–23:38, 2016. [12]X. Han, J. Li, and H. Gao, “TDEP: efficiently processing topk dominating query on massive data,” Knowl. Inf. Syst., vol. 43, no. 3, pp. 689–718, 2015. [13]J. Zhang, N. Mamoulis, D. Papadias, and Y. Tao, “Allnearestneighbors queries in spatial databases,” in Proceedings of the 16th International Conference on Scientific and Statistical Database Management, 2004., 2004, pp. 297–306. [14]P. Ciaccia, M. Patella, and P. Zezula, “Mtree : An Efficient Access Method for Similarity Search in Metric Spaces,” in Proceedings of the 23rd International Conference on Very Large Data Bases, 1997, pp. 426–435. [15]M. L. Yiu and N. Mamoulis, “Efficient processing of topk dominating queries on multidimensional data,” in Proceedings of the 33rd international conference on Very large data bases, 2007, pp. 483–494. [16]L. Chen and X. Lian, “Efficient processing of metric skyline queries,” IEEE Trans. Knowl. Data Eng., vol. 21, no. 3, pp. 351–365, 2009. [17]D. Fuhry, R. Jin, and D. Zhang, “Efficient skyline computation in metric space,” in Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology  EDBT ’09, 2009, p. 1042. [18]J. K. Uhlmann, “Satisfying general proximity / similarity queries with metric trees,” Inf. Process. Lett., vol. 40, no. 4, pp. 175–179, 1991. [19]G. Wang, X. Zhou, B. Wang, B. Qiao, and D. Han, “A hyperplane based indexing technique for highdimensional data,” Inf. Sci., vol. 177, no. 11, pp. 2255–2268, 2007. [20]A. Guttman, “RTrees: A Dynamic Index Structure For Spatial Searching,” in Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, 1984, pp. 47–57. [21]N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest neighbor queries,” in Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data  SIGMOD ’95, 1995, pp. 71–79. [22]K. L. Clarkson, “Nearest neighbor queries in metric spaces,” Discret. Comput. Geom, pp. 609–617, 1997. [23]C.M. Liu and S.Y. Fu, “Effective protocols for kNN search on broadcast multidimensional index trees,” Inf. Syst., vol. 33, no. 1, pp. 18–35, 2008. [24]S. Berchtold, D. A. Keim, H.P. Kriegel, and T. Seidl, “Indexing the solution space: a new technique for nearest neighbor search in highdimensional space,” IEEE Trans. Knowl. Data Eng., vol. 12, no. 1, pp. 45–57, 2000. [25]A. Vlachou, C. Doulkeridis, K. Nørvåg, and M. Vazirgiannis, “On efficient topk query processing in highly distributed environments,” in Proc. ACM SIGMOD Int. Conf. on Management of Data, 2008, pp. 753–764. [26]M. Kontaki, A. N. Papadopoulos, and Y. Manolopoulos, “Continuous topk dominating queries,” IEEE Trans. Knowl. Data Eng., vol. 24, no. 5, pp. 840–853, 2012. [27]E. Tiakas and G. Valkanas, “MetricBased Topk Dominating Queries,” in Proceedings of the 17th Inter national Conference on Extending Database Technology (EDBT), 2014, pp. 415–426. [28]R. Fagin, A. Lotem, and M. Naor, “Optimal aggregation algorithms for middleware,” J. Comput. Syst. Sci., vol. 66, no. 4, pp. 614–656, 2003. [29]S. Borzsony, D. Kossmann, and K. Stocker, “The Skyline operator,” in Proceedings of the 17th International Conference on Data Engineering, 2001, pp. 1–20. [30]D. Papadias, Y. Tao, K. Mouratidis, and C. K. Hui, “Aggregate Nearest Neighbor Queries in Spatial Databases,” ACM Trans. Database Syst., vol. 30, no. 2, pp. 529–576, 2005. [31]C. Zhang, X. Zhou, and C. Gao, “On Improving the Precision of Localization with Gross Error Removal,” in Proceedings of the 28th International Conference on Distributed Computing Systems Workshops, 2008, pp. 144–149. [32]E. Tiakas, “Top k Dominating Queries : a Survey,” in Proceedings of the 17th International Symposium on Programming and Systems (ISPS), 2013, pp. 1–10.
