KU ScholarWorks

  • myKU
  • Email
  • Enroll & Pay
  • KU Directory
    • Login
    View Item 
    •   KU ScholarWorks
    • Engineering
    • Electrical Engineering and Computer Science Scholarly Works
    • View Item
    •   KU ScholarWorks
    • Engineering
    • Electrical Engineering and Computer Science Scholarly Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Efficient Bundle Sorting

    Thumbnail
    View/Open
    Matias_sorting2006.pdf (177.3Kb)
    Issue Date
    2006
    Author
    Matias, Yossi
    Segal, Eran
    Vitter, Jeffrey Scott
    Publisher
    Society for Industrial and Applied Mathematics
    Type
    Article
    Article Version
    Scholarly/refereed, publisher version
    Metadata
    Show full item record
    Abstract
    Many data sets to be sorted consist of a limited number of distinct keys. Sorting such data sets can be thought of as bundling together identical keys and having the bundles placed in order; we therefore denote this as bundle sorting. We describe an efficient algorithm for bundle sorting in external memory, which requires at most c(N/B) logM/Bk disk accesses, where N is the number of keys, M is the size of internal memory, k is the number of distinct keys, B is the transfer block size, and 2 < c < 4. For moderately sized k, this bound circumvents the Theta((N/B) logM/B (N/B)) I/O lower bound known for general sorting. We show that our algorithm is optimal by proving a matching lower bound for bundle sorting. The improved running time of bundle sorting over general sorting can be significant in practice, as demonstrated by experimentation. An important feature of the new algorithm is that it is executed "in-place," requiring no additional disk space.
    Description
    This is the published version. Copyright © 2006 Society for Industrial and Applied Mathematics
    URI
    http://hdl.handle.net/1808/18961
    DOI
    https://doi.org/10.1137/S0097539704446554
    Collections
    • Electrical Engineering and Computer Science Scholarly Works [252]
    Citation
    Matias, Yossi, Eran Segal, and Jeffrey Scott Vitter. "Efficient Bundle Sorting." SIAM J. Comput. SIAM Journal on Computing 36.2 (2006): 394-410. http://dx.doi.org/10.1137/S0097539704446554

    Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.


    We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.


    Contact KU ScholarWorks
    785-864-8983
    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    785-864-8983

    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    Image Credits
     

     

    Browse

    All of KU ScholarWorksCommunities & CollectionsThis Collection

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    Contact KU ScholarWorks
    785-864-8983
    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    785-864-8983

    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    Image Credits
     

     

      Contact KU ScholarWorks
    Lawrence, KS | Maps
     
    • Academics
    • Admission
    • Alumni
    • Athletics
    • Campuses
    • Giving
    • Jobs

    The University of Kansas prohibits discrimination on the basis of race, color, ethnicity, religion, sex, national origin, age, ancestry, disability, status as a veteran, sexual orientation, marital status, parental status, gender identity, gender expression and genetic information in the University’s programs and activities. The following person has been designated to handle inquiries regarding the non-discrimination policies: Director of the Office of Institutional Opportunity and Access, IOA@ku.edu, 1246 W. Campus Road, Room 153A, Lawrence, KS, 66045, (785)864-6414, 711 TTY.

     Contact KU
    Lawrence, KS | Maps