TY  - JOUR
T1  - A Comparative Study of Online Joining Approaches Based on Memory Flushing Patterns
AU - Chauhan, Raksha AU - Patel, Pratik A. 
JO  - Asian Journal of Information Technology
VL  - 13
IS  - 2
SP  - 53
EP  - 57
PY  - 2014
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2014.53.57
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2014.53.57
KW  - Processors
KW  -data
KW  -main memory
KW  -optimal strategy
KW  -flushing
AB  - Traditional query processors generate full, accurate query 
  results, either in batch or in pipelined fashion. Researchers reviewed that 
  this strict model is too rigid for queries over distributed data sources. For 
  executing such query, space is required in main memory to accommodate the data 
  for query processing. When main memory gets full then some data must be moved 
  to disk for further processing as part of flushing. An optimal strategy should 
  be used to remove the victim data from memory to the disk. Victim data must 
  be selected on the basis of its contribution in future query processing. In 
  this study various join algorithms and flushing techniques used in online environment 
  is reviewed.
ER  - 