Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

An End-Around Approach for Efficient Join Query Processing

Print
PDF
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 96 - Number 18
Year of Publication: 2014
Authors:
Raksha Chauhan
Pratik A Patel
10.5120/16894-6943

Raksha Chauhan and Pratik A Patel. Article: An End-Around Approach for Efficient Join Query Processing. International Journal of Computer Applications 96(18):16-21, June 2014. Full text available. BibTeX

@article{key:article,
	author = {Raksha Chauhan and Pratik A Patel},
	title = {Article: An End-Around Approach for Efficient Join Query Processing},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {96},
	number = {18},
	pages = {16-21},
	month = {June},
	note = {Full text available}
}

Abstract

This paper introduced a method for producing immediate and result in multi-join query, in homogeneous and heterogeneous environment. In recent years Adaptive or Non Blocking join algorithms have attracted a lot of attention in streaming applications, where data is provided from autonomous data sources in heterogeneous network environments. This algorithms are better as compared to traditional algorithms is that they can generates join results as early as the first input tuples are on hand hence it improves pipelining, smooth out join result production and also masking source or network delays. As response time of the queries places a very important role in adaptive join, the join algorithm like Hash Join, Sort Merge Join are become unacceptable for this environment because they require preprocessing before generating the join result. Hence, in adaptive join technique only possible algorithm is Nested loop join. In Nested Loop Join, every single record of the outer relation is compared with every single record of the inner relation. The no. of comparisons done by the nested loop join can be reduced by making improvement in Block Nested loop Join. In proposed End-Around Block Nested loop join outer and inner table's comparison is done in parallel and whenever a row in first location didn't find a match then row from first location removed and placed at rear end as like in a queue, the matched row removed from inner relation and added to result set. Whenever, New tuple arrive is then pushed into rear end and process is continuing with new incoming tuples in streaming environments.

References

  • Mihaela A. Bornea, Vasilis Vassalos, Yannis Kotidis, Antonios Deligiannakis, "Adaptive Join Operators for Result Rate Optimization on Streaming Inputs", In IEEE Trans. Knowl. Data Eng. 22(8): 1110-1125 (2010).
  • M. F. Mokbel, M. Lu, and W. G. Aref. "Hash-Merge Join: A Non blocking Join Algorithm for Producing Fast and Early Join Results" In ICDE Conf. , 2004. nal conference on very large databases 2003.
  • J. Dittrich, B. Seeger, and D. Taylor. "Progressive merge join: A generic and non-blocking sort-based join algorithm" In Proceedings of VLDB, 2002.
  • Z. G. Ives, D. Florescu, and et al. "An Adaptive Query Execution System for Data Integration" In SIGMOD, 1999.
  • T. Urhan and M. J. Franklin, "Xjoin: A Relatively scheduled pipelined join operator", In IEEE Data Eng. Bull,23920,2000
  • T. Urhan, M. J. Franklin and L. Amsaleg. "Cost Based Query Scrambling for Initial Delays", In ACM SIGMOD Conf. , Seattle, WA, 1998.
  • Deepak Shukla, Dr. Deepak Arora, Rakesh Kr. Pandey, K. K Agarwal, "An Efficient Approach of Block Nested Loop algorithm based on Rate of Block Transfer" In International Journal of Computer Application,Volume-21,No 3,May-2011
  • S. D Viglas,J. F. Naughton and J. Burger, "Maximizing the output rate of multi-way join queries over streaming information sources". In VLDB 2003: proceeding of the 29th international
  • Y. Tao, M. L. Yiu, D. Papadias, M. Hadjieleftheriou, and N. Mamoulis. "RPJ: Producing Fast Join Results on Streams Through Rate-based Optimization"In Proceedings of ACM SIGMOD Conference, 2005.
  • J. Dittrich, B. Seeger, and D. Taylor. "Progressive merge join "On producing join results early", In. ACM SIGMOD, 2003
  • Mihaela A. Bornea, Vasilis Vassalos, Yannis Kotidis, and Antonios Deligiannakis. "Double index nested-loop reactive join for result rate optimization". In Proc. Intl. Conf. onData Engineering (ICDE), pages 481–492, 2009.
  • G. Abdulla, T. Critchlow, and W. Arrighi, "Simulation Data as Data Streams," SIGMOD Record, vol. 33, no. 1, pp. 89–94, 2004.