Retrieving Queries by Applying Join Selectivity along with Various Join Mechanisms Using Soft Computing Approach

Sambit Kumar Mishra^1, , Srikanta Pattnaik² and Dulu Patnaik³

¹Department of Computer Sc.&Engg, Ajay Binay Institute of Technology, Cuttack, Odisha, India

²S.O.A. University, Bhubaneswar, Odisha, India

³Government College of Engineering, Bhawanipatna, Odisha, India

Cite this paper:
Sambit Kumar Mishra, Srikanta Pattnaik and Dulu Patnaik. Retrieving Queries by Applying Join Selectivity along with Various Join Mechanisms Using Soft Computing Approach. Journal of Computer Sciences and Applications. 2015; 3(1):18-22. doi: 10.12691/jcsa-3-1-3

Abstract

In heterogeneous multiple query processing environments, usually the query processors depend upon estimated database cardinalities when evaluating the cost of the query plans. In this paper it is being projected to retrieve query plans along with their costs and fitness values by applying join selectivity techniques for relations used in query processing by applying genetic algorithm techniques. It has also been aimed to see that whether the evaluation of selectivity factor of sub query operation may be feasible and may reduce the total query cost.

Keywords:
query processing query plans cardinalities join selectivity join index tuple chromosome primary key foreign key

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]	Ridhi Kapoor, Dr. R. S. Virk, “Selectivity & Cost Estimates in Query Optimization in Distributed Databases”, International Journal of Enhanced Research in Management & Computer Applications, June2013.
[2]	Carlo Dell‟ Aquilla, Ezio Lefons, Filippo Tangorra, “Analytic-based Estimation of Query Result Sizes”, 2005.
[3]	Fan Yuanyuan, Mi Xifeng. “Distributed database System Query Optimization Algorithm Research”, IEEE, 2010.
[4]	Rajinder Singh, Gurvinder Singh, Varinder Pannu virk. “Optimized Access Strategies for a Distributed Database Design”, IJDE, 2011.
[5]	Faiza Najjar and Yahya slimani. “Cardinality estimation of distributed join queries”. 2002.
[6]	Stratis D. Viglas, Jeffrey F. Naughton. “Rate-Based Query Optimization for Streaming Information”, ACM, 2002.
[7]	Areerat Trongratsameethong, Jarernsri L. Mitrpanont, “Exhaustive Greedy Algorithm for Optimizing Intermediate Result Sizes of JoinQueries”, IEEE, 2009.
[8]	Danh Le-Phuoc1, Josiane Xavier Parreira, Michael Hausenblas, Manfred Hauswirth. “Continuous Query Optimization and Evaluation Over Unified Linked Stream Data and Linked Open Data”, DERI,2010.
[9]	William I. Grosky, Junping Sun, Farshad Fotouhi. “Dynamic selectivity estimation for multidimensional queries”, springer, 1993.