CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Efficient Approach of Block Nested Loop Algorithm based on Rate of Block Transfer

by Deepak Shukla, Dr. Deepak Arora, Rakesh Kr. Pandey, K. K. Agrawal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 21 - Number 3
Year of Publication: 2011
Authors: Deepak Shukla, Dr. Deepak Arora, Rakesh Kr. Pandey, K. K. Agrawal
10.5120/2491-3365

Deepak Shukla, Dr. Deepak Arora, Rakesh Kr. Pandey, K. K. Agrawal . An Efficient Approach of Block Nested Loop Algorithm based on Rate of Block Transfer. International Journal of Computer Applications. 21, 3 ( May 2011), 24-30. DOI=10.5120/2491-3365

@article{ 10.5120/2491-3365,
author = { Deepak Shukla, Dr. Deepak Arora, Rakesh Kr. Pandey, K. K. Agrawal },
title = { An Efficient Approach of Block Nested Loop Algorithm based on Rate of Block Transfer },
journal = { International Journal of Computer Applications },
issue_date = { May 2011 },
volume = { 21 },
number = { 3 },
month = { May },
year = { 2011 },
issn = { 0975-8887 },
pages = { 24-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume21/number3/2491-3365/ },
doi = { 10.5120/2491-3365 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:07:34.583459+05:30
%A Deepak Shukla
%A Dr. Deepak Arora
%A Rakesh Kr. Pandey
%A K. K. Agrawal
%T An Efficient Approach of Block Nested Loop Algorithm based on Rate of Block Transfer
%J International Journal of Computer Applications
%@ 0975-8887
%V 21
%N 3
%P 24-30
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, an approach has been proposed that makes the processing of join operation in database systems more efficient. In join operation processing relations that take part in the join process are required to be transferred to the main memory (RAM) from hard disk. In join operation processing when block nested loop algorithm is used to perform join between relations and multiple blocks of the relations that take part in the joining process are transferred from hard disk to main memory than in this case the main memory buffer allotted to the blocks of relation. Using this approach, multiple blocks are transferred for the relations that participates in the join operation processing, instead of transferring blocks one by one for each relation (or multiple blocks for one relation) without worrying about the large and small databases size. When this new approach is applied, the rate of block transfer during join operation processing using block nested loop algorithm get minimizes and join query processing become efficient, without loosing the level of complexity of the previous algorithms of block nested loop join(BNLJ).

References
  1. Noh, S.Y. and S.K. Gadia, 2008. Benchmarking temporal database models with interval based and temporal element-based time-stamping. Journal of System software, 81:1931-1943.
  2. Sinha, M. and S.V. Chande, 2010. Query optimization using genetic algorithms. Research Journal of Information Technology, 2:139-144.
  3. Gracfe, G., 1993, Query evaluation techniques for large database. ACM Computer Surveys, 25:73-170.
  4. Soo, M.D., R.T.Snodyrass and C.S. Jensen, 1994. Efficient evaluation of the valid – time natural join. Proceedings of the 10th International conference on data engineering, Feb. 14-18, Washington, DC, USA, PP: 282-292.
  5. Masaya NAKAYAMA, Masaru KITSUREGAWA and Mikio TAKAGI, 1998. Hash Partitioned Join Method Using Dynamic Destaging Strategy. Proceeding of the 14th VLDB Conference Los Angeles, California.
  6. Robert B. Hagmann, 1986. An Observation on Database Buffering Performance Metrices. Proceedings of the 12th International conference on very large Databases, Kyoto.
  7. M. H. Saheb, Oct. 2010. Efficient Algorithm for overlap – join,. Information Technology Journal, 10:201206.
  8. David J. Dewitt, Jeffrey. F. Naughton and Donovan A. Schneider, September, 1991. An Evaluation of Non-Equijoin Algorithms. Proceedings of the 17th International Conference on Very Large Databases, Barcelona.
  9. Philip W. Frey, Romulo Gonalves, Martin Kersten and Jens Teubner, 2009. Cyclo Join: A Join that Spins without Getting Dizzy. In the proceedings of ACM.
  10. Evan P. Haris and Kotagiri Ramamohanarao, 1996. Join Algorithm Costs Revisited Technical Report 93/5.
  11. Laura M. Haas, Michael J. Carey and Miron Livny, 1993. SEEKing the Truth about Ad Hoc Join Costs, May.Technical Report #1148.
  12. Seo-young Noh and Shashi K. Gadia, 2005. Efficient Self Join Algorithm in Interval-based Temporal Data Models. Technical Report, Department of Computer Science, Iowa State University, Ames, Iowa, USA. http://archives.cs.iastate.edu/documents/disk0/00/00/03/86/index.html.
  13. Michael L. Rupley, Jr. 2008. Introduction to Query Processing and Optimization. http://www.cs.iusb.edu/ technical_repots / TR- 20080105-1.pdf
  14. Deepak Shukla, Rakesh Kumar Pandey, Deepak Arora and Ajai Kumar Yadav, 2011. An effective approach for join operation processing. 2nd National conference on Global Trends and Innovations in Computer Application and Informatics, April 9-10th, Meerut, India.
  15. Abraham Silberschatz, Henry F. Korth and S.Sudarshan, 2006. Database System Concepts, 5th Edition, Mc Graw Hill Higher Education. [ISBN: 007-124476-X].
  16. Elmasri. R. and S.B. Navathe, 2009. Fundamentals of Database Systems. 5th Edition, Pearson Education. [ISBN: 978-81-317-1625-0].
  17. Ivan Bayross, 2008. SQL, PL/SQL The Programming Language of Oracle. 3rd Revised Edition, BPB Publications. [ISBN: 81-7656-964-X].
Index Terms

Computer Science
Information Sciences

Keywords

Databases Query Processing Block Nested-Loop Join (BNLJ) RAM Hard Disk.

Powered by PhDFocusTM