Skip to content
Register Sign in Wishlist

Compact Data Structures
A Practical Approach

$89.99 (P)

  • Date Published: September 2016
  • availability: In stock
  • format: Hardback
  • isbn: 9781107152380

$ 89.99 (P)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Compact data structures help represent data in reduced space while allowing it to be queried, navigated, and operated in compressed form. They are essential tools for efficiently handling massive amounts of data by exploiting the memory hierarchy. They also reduce the resources needed in distributed deployments and make better use of the limited memory in low-end devices. The field has developed rapidly, reaching a level of maturity that allows practitioners and researchers in application areas to benefit from the use of compact data structures. This first comprehensive book on the topic focuses on the structures that are most relevant for practical use. Readers will learn how the structures work, how to choose the right ones for their application scenario, and how to implement them. Researchers and students in the area will find in the book a definitive guide to the state of the art in compact data structures.

    • Focuses on structures that are stable, mature, and proven, or likely to be useful in practice, with many example applications
    • Gives pseudocode for all the relevant procedures
    • Thorough bibliographic discussions at the end of each chapter point readers to recent research, advanced concepts, and the best theoretical results
    Read more

    Reviews & endorsements

    "This is a delightful book on data structures that are both time and space efficient. It will be a key reference and guiding light in the field for years to come."
    J. Ian Munro, University of Waterloo, Ontario, from the Foreword

    'The explanations are clear and accessible, the content substantial and the information level high, the illustrations appropriate and informative, and the subject matter timely and increasingly relevant. This text will provide a good foundation in theory and practical issues and should be a useful introduction to the field for students, researchers, and developers desiring a solid foundational text.' R. M. Malyankar, Computing Reviews

    ‘The book is a real gem! My excitement while reading it was similar to what I felt when learning to program as a child, browsing the bit-level details in a technical manual of an obscure computer architecture. Even though data structures are my main research interest, much of the material was new to me. There is a remarkable attention to detail, pseudocode in the book is written very carefully, with all details explicitly given … In 540 pages, the book discusses a large number of data structuring questions, exploring various designs and tradeoffs, followed by relevant applications. The book is very well-organized, and its concept is compelling (once the reader gets the hang of it), the various results fit together and build upon each other. I imagine that seminars could easily be based on the book; it can also be useful for self-study and reference, even for practitioners.' Laszlo Kozma, SIGACT News

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: September 2016
    • format: Hardback
    • isbn: 9781107152380
    • length: 570 pages
    • dimensions: 260 x 183 x 34 mm
    • weight: 1.19kg
    • contains: 140 b/w illus.
    • availability: In stock
  • Table of Contents

    1. Introduction
    2. Entropy and coding
    3. Arrays
    4. Bitvectors
    5. Permutations
    6. Sequences
    7. Parentheses
    8. Trees
    9. Graphs
    10. Grids
    11. Texts
    12. Dynamic structures
    13. Recent trends.

  • Resources for

    Compact Data Structures

    Gonzalo Navarro

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact lecturers@cambridge.org.

  • Author

    Gonzalo Navarro, Universidad de Chile
    Gonzalo Navarro is Professor of Computer Science at the Universidad de Chile. He has directed or participated in numerous large projects on web research, information retrieval, compressed data structures, and bioinformatics. He is a member of the editorial board of the journals Information Retrieval, ACM Journal of Experimental Algorithmics, and Information Systems. His publications include the book Flexible Pattern Matching in Strings (with G. Raffinot, Cambridge, 2008), 20 book chapters, more than 100 journal papers, and almost 200 conference papers. He has also edited the proceedings of seven international conferences.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×