KUKU

KU ScholarWorks

  • myKU
  • Email
  • Enroll & Pay
  • KU Directory
    • Login
    View Item 
    •   KU ScholarWorks
    • Office of the Provost
    • Provost Office Published Articles
    • View Item
    •   KU ScholarWorks
    • Office of the Provost
    • Provost Office Published Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Compressed Data Structures: Dictionaries and the Data-Aware Measures

    Thumbnail
    View/Open
    GHSV06.compresseddictionaries.pdf (147.8Kb)
    Issue Date
    2007-11-22
    Author
    Gupta, Ankur
    Hon, Wing-Kai
    Shah, Rahul
    Vitter, Jeffrey Scott
    Publisher
    Elsevier
    Type
    Article
    Article Version
    Scholarly/refereed, author accepted manuscript
    Metadata
    Show full item record
    Abstract
    We propose measures for compressed data structures, in which space usage is mea- sured in a data-aware manner. In particular, we consider the fundamental dictionary problem on set data, where the task is to construct a data structure to represent a set S of n items out of a universe U = f0; : : : ; u 􀀀 1g and support various queries on S. We use a well-known data-aware measure for set data called gap to bound the space of our data structures. We describe a novel dictionary structure taking gap+O(n log(u=n)= log n)+O(n log log(u=n)) bits. Under the RAM model, our dictionary supports membership, rank, select, and prede- cessor queries in nearly optimal time, matching the time bound of Andersson and Thorup's predecessor structure [AT00], while simultaneously improving upon their space usage. Our dictionary structure uses exactly gap bits in the leading term (i.e., the constant factor is 1) and answers queries in near-optimal time. When seen from the worst case perspective, we present the rst O(n log(u=n))-bit dictionary structure which supports these queries in near- optimal time under RAM model. We also build a dictionary which requires the same space and supports membership, select, and partial rank queries even more quickly in O(log log n) time. To the best of our knowledge, this is the rst of a kind result which achieves data-aware space usage and retains near-optimal time.
    URI
    http://hdl.handle.net/1808/7222
    DOI
    https://doi.org/10.1016/j.tcs.2007.07.042
    Collections
    • Distinguished Professors Scholarly Works [918]
    • Electrical Engineering and Computer Science Scholarly Works [302]
    • Provost Office Published Articles [95]
    Citation
    A. Gupta, W.-K. Hon, R. Shah, and J. S. Vitter. “Compressed Data Structures: Dictionaries and the Data-Aware Measures,” Theoretical Computer Science, 387(3), November 2007, 313–331. An extended abstract appears in Proceedings of the 2006 IEEE Data Compression Conference (DCC ’06), Snowbird, UT, March 2006, 213–222.

    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
     

     

    The University of Kansas
      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