Search Results

Now showing 1 - 2 of 2
  • Item
    Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
    (2009) Areerat Trongratsameethong; Jarernsri L. Mitrpanont; เจริญศรี มิตรภานนท์; Mahidol University. Faculty of Science. Department of Computer Science; Mahidol University. Faculty of Information and Communication Technology
    . Furthermore, if memory size is not big enough, secondary storage will be needed. This paper proposes the Exhaustive Greedy (EG) algorithm to optimize the intermediate result sizes of join queries. Exhaustive search and greedy algorithm are combined... estimated by the EG algorithm are comparable to the results estimated by the Exhaustive Search algorithm that is modified to update join graphs, we name it ESU algorithm.
  • Publication
    Exhaustive greedy algorithm for optimizing intermediate result sizes of join queries
    (2009-11-10) Areerat Trongratsameethong; Jarernsri L. Mitrpanont; Mahidol University
    , if memory size is not big enough, secondary storage will be needed. This paper proposes the Exhaustive Greedy (EG) algorithm to optimize the intermediate result sizes of join queries. Exhaustive search and greedy algorithm are combined and modified... are comparable to the results estimated by the Exhaustive Search algorithm that is modified to update join graphs, we name it ESU algorithm. © 2009 IEEE.