Journal of Applied Mathematics

  • J. Appl. Math.
  • Volume 2014, Special Issue (2014), Article ID 401618, 10 pages.

Grid-PPPS: A Skyline Method for Efficiently Handling Top-k Queries in Internet of Things

Sun-Young Ihm, Aziz Nasridinov, and Young-Ho Park

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


A rapid development in wireless communication and radio frequency technology has enabled the Internet of Things (IoT) to enter every aspect of our life. However, as more and more sensors get connected to the Internet, they generate huge amounts of data. Thus, widespread deployment of IoT requires development of solutions for analyzing the potentially huge amounts of data they generate. A top-k query processing can be applied to facilitate this task. The top-k queries retrieve k tuples with the lowest or the highest scores among all of the tuples in the database. There are many methods to answer top-k queries, where skyline methods are efficient when considering all attribute values of tuples. The representative skyline methods are soft-filter-skyline (SFS) algorithm, angle-based space partitioning (ABSP), and plane-project-parallel-skyline (PPPS). Among them, PPPS improves ABSP by partitioning data space into a number of spaces using hyperplane projection. However, PPPS has a high index building time in high-dimensional databases. In this paper, we propose a new skyline method (called Grid-PPPS) for efficiently handling top-k queries in IoT applications. The proposed method first performs grid-based partitioning on data space and then partitions it once again using hyperplane projection. Experimental results show that our method improves the index building time compared to the existing state-of-the-art methods.

Article information

J. Appl. Math., Volume 2014, Special Issue (2014), Article ID 401618, 10 pages.

First available in Project Euclid: 1 October 2014

Permanent link to this document

Digital Object Identifier


Ihm, Sun-Young; Nasridinov, Aziz; Park, Young-Ho. Grid-PPPS: A Skyline Method for Efficiently Handling Top- $k$ Queries in Internet of Things. J. Appl. Math. 2014, Special Issue (2014), Article ID 401618, 10 pages. doi:10.1155/2014/401618.

Export citation


  • C. Perera, A. Zaslavsky, C. H. Liu, M. Compton, P. Christen, and D. Georgakopoulos, “Sensor search techniques for sensing as a service architecture for the internet of things,” IEEE Sensors Journal, vol. 14, no. 2, pp. 406–420, 2014.
  • C. Zhu, Q. Zhu, C. Zuzarte, and W. Ma, “Developing a dynamic materialized view index for efficiently discovering usable views for progressive queries,” Journal of Information Processing Systems, vol. 9, no. 4, pp. 511–537, 2013.
  • Y. Park, K. Whang, B. S. Lee, and W. Han, “Efficient evaluation of partial match queries for XML documents using information retrieval techniques,” in Proceedings of the Database Systems for Advanced Applications (DASFAA '05), pp. 95–112, April 2005.
  • R. M. Hwang, S. K. Kim, S. An, and D. W. Park, “The architectural pattern of a highly extensible system for the asynchronous processing of a large amount of data,” Journal of Information Processing Systems, vol. 9, no. 4, pp. 511–537, 2013.
  • J. Heo, J. Cho, and K. Whang, “The hybrid-layer index: a synergic approach to answering Top-k queries in arbitrary subspaces,” in Proceedings of the 26th international Conference on Data Engineering, pp. 445–448, March 2010.
  • J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, “Skyline with presorting,” in Proceedings of the 19th International Conference on Data Engineering, pp. 717–719, March 2003.
  • A. Vlachou, C. Doulkeridis, and Y. Kotidis, “Angle-based space partitioning for efficient parallel skyline computation,” in Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 227–238, June 2008.
  • H. Köhler, J. Yang, and X. Zhou, “Efficient parallel skyline processing using hyperplane projections,” in Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 85–94, June 2011.
  • Y. Ma, J. Rao, W. Hu et al., “An efficient index for massive IOT data in cloud environment,” in Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12), pp. 2129–2133, 2012.
  • Z. Huang, Y. Xiang, D. Wang, and B. Zhang, “Efficient dynamic SKYCUBE computation in the internet of things,” in Proceedings of the International Conference on Computer and Communication Technologies in Agriculture Engineering (CCTAE '10), pp. 308–311, June 2010.
  • M. A. Elkheir, M. Hayajneh, and N. A. Ali, “Data management for the internet of things: design primitives and solution,” Sensors, vol. 13, no. 11, pp. 15582–15612, 2013.
  • C. W. Tsai, C. F. Lai, M. C. Chiang, and L. T. Yang, “Data mining for internet of things: a survey,” IEEE Communications Surveys and Tutorials, vol. 16, no. 1, pp. 77–97, 2014.
  • S. Börzsönyi, D. Kossmann, and K. Stocker, “The skyline operator,” in Proceedings of the 17th International Conference on Data Engineering, pp. 421–430, April 2001.
  • P. Godfrey, R. Shipley, and J. Gryz, “Maximal vector computation in large data sets,” in Proceedings of the 31st International Conference on Very Large Data Bases, pp. 229–240, September 2005.
  • K. Hose, C. Lemke, and K.-U. Sattler, “Processing relaxed skylines in PDMS using distributed data summaries,” in Proceedings of the 2006 Conference on Information and Knowledge Management, pp. 425–434, November 2006.
  • S. Wang, B. C. Ooi, A. K. H. Tung, and L. Xu, “Efficient skyline query processing on peer-to-peer networks,” in Proceedings of the 2007 International Conference on Data Engineering, pp. 1126–1135, April 2007.
  • A. Cosgaya-Lozano, A. Rau-Chaplin, and N. Zeh, “Parallel computation of skyline queries,” in Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications, pp. 1–7, May 2007.
  • P. Wu, C. Zhang, Y. Feng, B. Y. Zhao, D. Agrawal, and A. E. Abbadi, “Parallelizing skyline queries for scalable distribution,” in Proceedings of the 2006 Conference on Extending Database Technology, pp. 112–130, 2006.
  • Y. C. Chang, L. Bergman, V. Castelli, C. S. Li, M. L. Lo, and J. R. Smith, “The onion technique: indexing for linear optimization queries,” in Proceedings of the 2000 ACM SIGMOD International Conference on Management of data, pp. 391–402, 2000.
  • S. Y. Ihm, K. E. Lee, A. Nasridinov, J. S. Heo, and Y. H. Park, “Approximate convex skyline: a partitioned layer-based index for efficient processing top-k queries,” Knowledge-Based Systems, vol. 61, pp. 13–28, 2014.
  • S. Y. Ihm, A. Nasridinov, and Y. H. Park, “An efficient index building algorithm for selection of aggregator node in wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 2014, Article ID 520428, 8 pages, 2014.
  • J. W. K. Gnanaraj, K. Ezra, and E. B. Rajsingh, “Smart card based time efficient authentication scheme for global grid computing,” Human-Centric Computing and Information Sciences, vol. 3, no. 16, pp. 1–14, 2013.
  • S. Hong and J. Chang, “A new k-NN query processing algorithm based on multicasting-based cell expansion in location-based services,” Journal of Convergence, vol. 4, no. 4, pp. 1–6, 2013.
  • H. I. Kim, Y. K. Kim, and J. W. Chang, “A grid-based cloaking area creation scheme for continuous LBS queries in distributed systems,” Journal of Convergence, vol. 4, no. 1, pp. 23–30, 2013. \endinput