Abstract
The problem of multiselection arises frequently in databases. Here, given an unordered set S of n records and a sequence of m integers 1 ⩽ q 1 < q 2 < … < q m ⩽ n we are interested in answering queries of the type ‘find the q i th smallest elements in S’, the problem is to answer all these queries as fast as possible. We propose an efficient parallel algorithm for multiselection, running in O( n/p log 2 m) time using p processors with 1 ⩽ p ⩽ [ n/log n log* n], in the EREW-PRAM model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
