B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B. Vaughan. FastSort: an distributed single-input single-output external sort. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 94--101, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....seek to be incurred from one run to the next for each of these reads. This gives us N S = 4 jRj MPR jSj MPR 2 It should be noted that we are assuming the use of a rather basic sorting scheme for Sort Merge join; the algorithm could be improved by using a better sorting algorithm, e.g. [21, 22]. 7 4.3 Simple Hash Join In Simple Hash Join, relation R is read and reduced repeatedly, as follows. Each time R is read, a hash function is applied to the join attribute(s) of its tuples. Based on the result of applying the hash function, some of the tuples are inserted into an in memory hash ....

B. Salzberg et al, "FastSort: A Distributed Single-Input Single-Output External Sort", Proc. ACM SIGMOD Conf., Atlantic City, NJ, May 1990.

....[1] Later, the hash join [2, 6] and its improvements [21, 25, 30, 37] became alternatives to the merge join. For overviews see [29, 35] and for a comparison between the sort merge and hash joins see [12, 13] A lot of effort has also been spent on parallelizing join algorithms based on sorting [9, 27, 28, 33] and hashing [5, 10, 34] All of these algorithms concentrate on simple join predicates based on the comparison of two atomic values. Predominant is the work on equi joins, i.e. where the join predicate is based on the equality of atomic values. Only a few articles deal with special issues like ....

B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B. Vaughan. FastSort: an distributed single-input single-output external sort. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 94--101, 1990.

....[1] Later, the hash join [2, 7] and its improvements [20, 23, 28, 39] became alternatives to the merge join. For overviews see [27, 37] and for a comparison between the sort merge and hash joins see [13, 14] A lot of effort has also been spent on parallelizing join algorithms based on sorting [10, 25, 26, 34] and hashing [6, 12, 36] Another important research area is the development of index structures that allow to accelerate the evaluation of joins [16, 22, 21, 29, 40, 42] All of these algorithms concentrate on simple join predicates based on the comparison of two atomic values. Predominant is the ....

B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B. Vaughan. FastSort: an distributed single-input single-output external sort. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 94--101, 1990.

....[1] Later, the hash join [2, 7] and its improvements [19, 22, 28, 39] became alternatives to the merge join. For overviews see [27, 37] and for a comparison between the sort merge and hash joins see [13, 14] A lot of effort has also been spent on parallelizing join algorithms based on sorting [10, 25, 26, 34] and hashing [6, 12, 36] Another important research area is the development of index structures that allow to accelerate the evaluation of joins [16, 21, 20, 29, 40, 42] All of these algorithms concentrate on simple join predicates based on the comparison of two atomic values. Predominant is the ....

B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B. Vaughan. FastSort: an distributed single-input single-output external sort. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 94--101, 1990.

....i.e. twice as long as the runs generated with Quicksort. Hence, replacement selection creates only half as many runs as Quicksort. This could significantly shorten the merge phase that follows. A nice discussion of the details involved in implementing replacement selection can be found in [Salz90]. Although using replacement selection instead of Quicksort can shorten the merge phase, replacement selection is not always the preferred choice because it can also lead to a longer split phase [Grae90, DeWi91] With Quicksort, there is a cycle of reading several pages from the source relation, ....

B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, B. Vaughan, "FastSort: A Distributed Single-Input Single-Output External Sort", Proc. of the ACM 1990 SIGMOD Conf., May 1990.

....on the same level. Beck et al. 4] implemented this idea on a number of backend processors. Due to hardware limitations, very small buffers (1Kb) were used. They also studied different layout strategies. However, their findings are heavily influenced by the small buffer size. Salzberg et al. [14] also studied this idea applied to a network of loosely coupled processors where each processor has local disks and a large amount of main memory. They recommend using enough memory and processors so that only one merge pass is needed at each processor. Another idea for parallelizing the merge ....

Salzberg, B., Tsukerman, A., Gray, J., Stewart, M., Uren, S., Vaughan, B,., FastSort: A Distributed Single-Input Single-Output External Sort, Proc. of the 1990 ACM SIGMOD Intl. Conf. on Management of Data, May, 1990, pp. 94-101.

....i.e. twice 51 as long as the runs generated with Quicksort. Hence, replacement selection creates only half as many runs as Quicksort. This could significantly shorten the merge phase that follows. A nice discussion of the details involved in implementing replacement selection can be found in [Salz90]. Although using replacement selection instead of Quicksort can shorten the merge phase, replacement selection is not always the preferred choice because it can also lead to a longer split phase [Grae90, DeWi91] With Quicksort, there is a cycle of reading several pages from the source relation, ....

B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, B. Vaughan, "FastSort: A Distributed Single-Input Single-Output External Sort", Proc. of the ACM SIGMOD Conf., May 1990.

No context found.

B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B. Vaughan. FastSort: an distributed single-input single-output external sort. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 94--101, 1990.

No context found.

B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B. Vaughan. Fastsort: An distributed single-input single-output external sort. In Proc. ACM SIGMOD Conf., page 94, Atlantic City, NJ, May 1990.

No context found.

Betty Salzberg, Alex Tsukerman, Jim Gray, Susan Uern, and Bonnie Vaughan. FastSort: A distributed single-input single-output external sort. In Proceedings of the ACM-SIGMOD International Conference on Management of Data, pages 94--101, Atlantic City, New Jersey, May 1990.

No context found.

Salzberg, B., Tsukerman, A., Gray, J., Uern, S. and Vaughan, B. "FastSort: A distributed singleinput single-output external sort" SIGMOD, May 1990.

No context found.

B. Salzberg, A. Tsukerman, J. Gray, S. Uern, and B. Vaughan. FastSort: A distributed single-input single-output external sort. In Proc. of the ACM-SIGMOD Conference, pages 94--101, Atlantic City, New Jersey, May 1990.

No context found.

B.Salzberg, A.Tsukerman, J.Gray, M.Stewart, S.Uren and B.Vaughan "FastSort - A Distributed Single-Input Single-Output External Sort", SIGMOD 1990, pp 94- 101.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC