Results 251 to 260 of about 281,251 (291)
Some of the next articles are maybe not open access.
Optimum combinations of sorting and merging
Journal of the ACM, 1989In 1979, G. K. Manacher showed that the Ford-Johnson sorting algorithm [FJA], acting on t real numbers, can be beaten for an infinite set of values t . These values form a partial cover of constant density not close to 1 over an initial sequence of each band running ...
Glenn K. Manacher +2 more
openaire +1 more source
1997
Information in a computer system is normally kept in a sorted order of some kind. We looked at sorted lists and sorted tables earlier on in the book and in the last two chapters we considered relative and indexed files in which the records are ordered — relative files by record number and indexed files by a record key item(s).
Roger Hutty, Mary Spence
openaire +1 more source
Information in a computer system is normally kept in a sorted order of some kind. We looked at sorted lists and sorted tables earlier on in the book and in the last two chapters we considered relative and indexed files in which the records are ordered — relative files by record number and indexed files by a record key item(s).
Roger Hutty, Mary Spence
openaire +1 more source
Searching, Sorting and Merging
2015In this chapter, we will explain the following: How to search a list using sequential search How to sort a list using selection sort How to sort a list using insertion sort How to sort a list of strings How to sort parallel arrays How to search a sorted list using binary search How to merge two sorted ...
openaire +1 more source
ACM Transactions on Database Systems, 2006
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm called the Sort-Merge-Shrink (SMS) Join for computing the answer to such a query over large, disk-based input tables. The key
Chris Jermaine +4 more
openaire +2 more sources
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm called the Sort-Merge-Shrink (SMS) Join for computing the answer to such a query over large, disk-based input tables. The key
Chris Jermaine +4 more
openaire +2 more sources
Parallel algorithms for merging and sorting
Information Sciences, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deo, Narsingh, Sarkar, Dilip
openaire +4 more sources
Merging and sorting strings in parallel
1992We show that strings of characters, equipped with the usual lexicographical ordering, can be merged and sorted in parallel as efficiently as integers, although with some loss in speed. Specifically, our main results are: Two sorted lists of strings, containing altogether n characters, can be merged with an optimal time-processor product of O(n) in
Hagerup, Torben, Petersson, Ola
openaire +3 more sources
Sorting and/by merging finger trees
1992We describe a sorting algorithm that is optimally adaptive with respect to several important measures of presortedness. In particular, the algorithm requires O(nlog(k/n)) time on sequences with k inversions; O(n+ k log k) time on sequences X that have a longest ascending subsequence of length n−k and for which Rem(X)=k; and O(n log k) time on sequences
Alistair Moffat +2 more
openaire +1 more source
Merging and Sorting By Strip Moves
2003We consider two problems related to the well-studied sorting by transpositions problem: (1) Given a permutation, sort it by moving a minimum number of strips, where a strip is a maximal substring of the permutation which is also a substring of the identity permutation, and (2) Given a set of increasing sequences of distinct elements, merge them into ...
Meena Mahajan +3 more
openaire +2 more sources
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Thomson Leighton +2 more
openaire +4 more sources
Buffer allocation in merge-sorting
Communications of the ACM, 1971A fixed buffer allocation for merge-sorting is presented here which minimizes the number of input-output operations for a given order of merge. When sorting on movable arm disks, the number of seeks is equal to the number of input-output operations, and the seek time usually controls the sort time. First some standard terminology is introduced.
openaire +1 more source