ICTACT Journal on Soft Computing

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Improved Skyline Query Retrieval using Particle Swarm Optimization Based Sweep Line Operator Over Real Time Datasets


Affiliations
1 Department of Computer Science and Engineering, Thirumalai Engineering College, India
     

   Subscribe/Renew Journal


In this paper initially clusters the search area’s slopes, i.e. it is shaped into settings according to its behavior in the search area, both past and present. In this study, these points were identified using a PSO control unit that works in a multi-dimensional search space. A PSO controller is employed to find the points in the search area under the new framework suggested in the paper. It contains several pre-processing methods for clearing incomplete or uncertain data in the area of unsafe data. Various preprocessing operations include: sort, fusion, filter and intercluster predominance in dimensional sets. The dominance between local points occurs at the nearest distance from each other. The points are of a global rank and sent in order to provide a rank according to the specific query to the PID controller. Moreover, the system proposed removes the point non-skyline in the search area by means of 2 new algorithms: Dynamic Pivot Sweep Line (DPSL), which can reduce the reaction time for a particular query. DPSL provides an ideal mechanism for searching the search area with skyline points, providing the best comparison. The DPSL algorithm is combined with real-life and synthetic preprocessing and PSO data sets for reducing storage and removal of redundant data in multi-dimensional search spaces. The whole controlled processing uses the values of the past and the present lines to predict future instances. This results in the dynamic query operation of the skyline and gets the whole data according to the specific query. In addition, PSO controller reduces response time, which saves more time than standard methods.

Keywords

In this paper initially clusters the search area’s slopes, i.e. it is shaped into settings according to its behavior in the search area, both past and present. In this study, these points were identified using a PSO control unit that works in a multi-dimensional search space. A PSO controller is employed to find the points in the search area under the new framework suggested in the paper. It contains several pre-processing methods for clearing incomplete or uncertain data in the area of unsafe data. Various preprocessing operations include: sort, fusion, filter and intercluster predominance in dimensional sets. The dominance between local points occurs at the nearest distance from each other. The points are of a global rank and sent in order to provide a rank according to the specific query to the PID controller. Moreover, the system proposed
Subscription Login to verify subscription
User
Notifications
Font Size

  • L. Antova, C. Koch and D. Olteanu, “MayBMS: Managing Incomplete Information with Probabilistic World-Set Decompositions”, Proceedings of IEEE International Conference on Data Engineering, 1479-1480, 2007.

  • D. Burdick, P.M. Deshpande, T.S. Jayram, R. Ramakrishnan and S. Vaithyanathan, “OLAP over Uncertain and Imprecise Data”, International Journal on Very Large Data Bases, Vol. 16, No. 1, pp. 123-144, 2007.

  • T.J. Green and V. Tannen, “Models for Incomplete and Probabilistic Information”, Proceedings of International Conference on Extending Database Technology, pp. 278-296, 2006.

  • P. Sen and A. Deshpande, “Representing and Querying Correlated Tuples in Probabilistic Databases”, Proceedings of IEEE International Conference on Data Engineering, pp. 596-605, 2007.

  • X. Dai, M.L. Yiu, N. Mamoulis, Y. Tao and M. Vaitis, “Probabilistic Spatial Queries on Existentially Uncertain Data”, Proceedings of International Symposium on Spatial and Temporal Databases, pp. 400-417, 2005.

  • X. Lin, Y. Zhang, W. Zhang and M.A. Cheema, “Stochastic Skyline Operator”, Proceedings of IEEE International Conference on Data Engineering, pp. 721-732, 2011.

  • K. Benouaret, D. Benslimane and A. Hadjali, “Selecting Skyline Web Services from Uncertain QoS”, Proceedings of IEEE International Conference on Services Computing, pp. 523-530, 2012.

  • A. Hadjali, S. Kaci and H. Prade, “Database Preferences Queries–A Possibilistic Logic Approach with Symbolic Priorities”, Proceedings of International Symposium on Foundations of Information and Knowledge Systems, pp. 291-310, 2008.

  • J. Lee, G.W. You and S.W. Hwang, “Personalized Top-K Skyline Queries in High-Dimensional Space”, Information Systems, Vol. 34, No. 1, pp. 45-61, 2009.

  • H. Jung, H. Han, H.Y. Yeom and S. Kang, “A Fast and Progressive Algorithm for Skyline Queries with Totally and Partially-Ordered Domains”, Journal of Systems and Software, Vol. 83, No. 3, pp. 429-445, 2010.

  • L. Chen, B. Cui and H. Lu, “Constrained Skyline Query Processing Against Distributed Data Sites”, IEEE Transactions on Knowledge and Data Engineering, Vol. 23, No. 2, pp. 204-217, 2011.

  • J. Lee, J. Kim and S.W. Hwang, “Supporting Efficient Distributed Skyline Computation using Skyline Views”, Information Sciences, Vol. 194, pp. 24-37, 2012.

  • Y.W. Lee, K.Y. Lee and M.H. Kim, “Efficient Processing of Multiple Continuous Skyline Queries Over a Data Stream”, Information Sciences, Vol. 221, pp. 316-337, 2013.

  • X. Li, Y. Wang, X. Li and J. Yu, “GDPS: An Efficient Approach for Skyline Queries over Distributed Uncertain Data”, Big Data Research, Vol. 1, No. 2, pp. 23-36, 2014.

  • N.H.M. Saad, H. Ibrahim, A.A. Alwan, F. Sidi and R. Yaakob, “A Framework for Evaluating Skyline Query over Uncertain Autonomous Databases”, Procedia Computer Science, Vol. 29, pp. 1546-1556, 2014.

  • D. Pertesis and C. Doulkeridis, “Efficient Skyline Query Processing in Spatial Hadoop”, Information Systems, Vol. 54, pp. 325-335, 2015.

  • J. Zhang, Z. Lin, B. Li, W. Wang and D. Meng, “Efficient Skyline Query over Multiple Relations”, Procedia Computer Science, Vol. 80, pp. 2211-2215, 2016.

  • J.L. Koh, C.C. Chen, C.Y. Chan and A.L. Chen, “MapReduce Skyline Query Processing with Partitioning and Distributed Dominance Tests”, Information Sciences, Vol. 375, pp. 114-137, 2017.

  • A. Abidi, S. Elmi, M.A.B. Tobji, A. HadjAli and B.B. Yaghlane, “Skyline Queries over Possibilistic RDF Data”, International Journal of Approximate Reasoning, Vol. 93, pp. 277-289, 2018.


Abstract Views: 267

PDF Views: 0




  • Improved Skyline Query Retrieval using Particle Swarm Optimization Based Sweep Line Operator Over Real Time Datasets

Abstract Views: 267  |  PDF Views: 0

Authors

A. Sairam
Department of Computer Science and Engineering, Thirumalai Engineering College, India
Seenuvasan Arumugam
Department of Computer Science and Engineering, Thirumalai Engineering College, India

Abstract


In this paper initially clusters the search area’s slopes, i.e. it is shaped into settings according to its behavior in the search area, both past and present. In this study, these points were identified using a PSO control unit that works in a multi-dimensional search space. A PSO controller is employed to find the points in the search area under the new framework suggested in the paper. It contains several pre-processing methods for clearing incomplete or uncertain data in the area of unsafe data. Various preprocessing operations include: sort, fusion, filter and intercluster predominance in dimensional sets. The dominance between local points occurs at the nearest distance from each other. The points are of a global rank and sent in order to provide a rank according to the specific query to the PID controller. Moreover, the system proposed removes the point non-skyline in the search area by means of 2 new algorithms: Dynamic Pivot Sweep Line (DPSL), which can reduce the reaction time for a particular query. DPSL provides an ideal mechanism for searching the search area with skyline points, providing the best comparison. The DPSL algorithm is combined with real-life and synthetic preprocessing and PSO data sets for reducing storage and removal of redundant data in multi-dimensional search spaces. The whole controlled processing uses the values of the past and the present lines to predict future instances. This results in the dynamic query operation of the skyline and gets the whole data according to the specific query. In addition, PSO controller reduces response time, which saves more time than standard methods.

Keywords


In this paper initially clusters the search area’s slopes, i.e. it is shaped into settings according to its behavior in the search area, both past and present. In this study, these points were identified using a PSO control unit that works in a multi-dimensional search space. A PSO controller is employed to find the points in the search area under the new framework suggested in the paper. It contains several pre-processing methods for clearing incomplete or uncertain data in the area of unsafe data. Various preprocessing operations include: sort, fusion, filter and intercluster predominance in dimensional sets. The dominance between local points occurs at the nearest distance from each other. The points are of a global rank and sent in order to provide a rank according to the specific query to the PID controller. Moreover, the system proposed

References