Within this Book Full site



Filter my results

ISBN of the Book

Material or Process Book or Chapter Title Author or Editor Publication dates

Handbook of Data Structures and Applications

Edited by: Dinesh P. Mehta , Sartaj Sahni

Print publication date:  March  2018
Online publication date:  February  2018

Print ISBN: 9781498701853
eBook ISBN: 9781315119335
Adobe ISBN:

 Cite  Marc Record

Book description

The Handbook of Data Structures and Applications was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly as other areas of computer science, the book aims to update those areas that have seen advances.

Retaining the seven-part structure of the first edition, the handbook begins with a review of introductory material, followed by a discussion of well-known classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. The editors next analyze miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination of the applications of data structures.

Four new chapters have been added on Bloom Filters, Binary Decision Diagrams, Data Structures for Cheminformatics, and Data Structures for Big Data Stores, and updates have been made to other chapters that appeared in the first edition.

The Handbook is invaluable for suggesting new ideas for research in data structures, and for revealing application contexts in which they can be deployed. Practitioners devising algorithms will gain insight into organizing data, allowing them to solve algorithmic problems more efficiently.

Table of contents

Prelims Download PDF
Chapter  1:  Analysis of Algorithms  Download PDF
Chapter  2:  Basic Structures  Download PDF
Chapter  3:  Trees  Download PDF
Chapter  4:  Graphs  Download PDF
Chapter  5:  Leftist Trees  Download PDF
Chapter  6:  Skew Heaps  Download PDF
Chapter  7:  Binomial, Fibonacci, and Pairing Heaps Download PDF
Chapter  8:  Double-Ended Priority Queues  Download PDF
Chapter  9:  Hash Tables  Download PDF
Chapter  10:  Bloom Filter and Its Variants Download PDF
Chapter  11:  Balanced Binary Search Trees  Download PDF
Chapter  12:  Finger Search Trees  Download PDF
Chapter  13:  Splay Trees Download PDF
Chapter  14:  Randomized Dictionary Structures  Download PDF
Chapter  15:  Trees with Minimum Weighted Path Length Download PDF
Chapter  16:  B Trees  Download PDF
Chapter  17:  Multidimensional Spatial Data Structures Download PDF
Chapter  18:  Planar Straight Line Graphs  Download PDF
Chapter  19:  Interval, Segment, Range, and Priority Search Trees Download PDF
Chapter  20:  Quadtrees and Octrees  Download PDF
Chapter  21:  Binary Space Partitioning Trees  Download PDF
Chapter  22:  R-Trees  Download PDF
Chapter  23:  Managing Spatiotemporal Data Download PDF
Chapter  24:  Kinetic Data Structures  Download PDF
Chapter  25:  Online Dictionary Structures Download PDF
Chapter  26:  Cuttings  Download PDF
Chapter  27:  Approximate Geometric Query Structures  Download PDF
Chapter  28:  Geometric and Spatial Data Structures in External Memory Download PDF
Chapter  29:  Tries  Download PDF
Chapter  30:  Suffix Trees and Suffix Arrays  Download PDF
Chapter  31:  String Searching Download PDF
Chapter  32:  Binary Decision Diagrams Download PDF
Chapter  33:  Persistent Data Structures  Download PDF
Chapter  34:  Data Structures for Sets  Download PDF
Chapter  35:  Cache-Oblivious Data Structures  Download PDF
Chapter  36:  Dynamic Trees  Download PDF
Chapter  37:  Dynamic Graphs  Download PDF
Chapter  38:  Succinct Representation of Data Structures  Download PDF
Chapter  39:  Randomized Graph Data-Structures for Approximate Shortest Paths  Download PDF
Chapter  40:  Searching and Priority Queues in o(log n) Time  Download PDF
Chapter  41:  Functional Data Structures  Download PDF
Chapter  42:  LEDA, a Platform for Combinatorial and Geometric Computing  Download PDF
Chapter  43:  Data Structures in C++ Download PDF
Chapter  44:  Data Structures in JDSL  Download PDF
Chapter  45:  Data Structure Visualization  Download PDF
Chapter  46:  Drawing Trees  Download PDF
Chapter  47:  Drawing Graphs  Download PDF
Chapter  48:  Concurrent Data Structures  Download PDF
Chapter  49:  IP Router Tables  Download PDF
Chapter  50:  Multi-Dimensional Packet Classification  Download PDF
Chapter  51:  Data Structures in Web Information Retrieval  Download PDF
Chapter  52:  The Web as a Dynamic Graph  Download PDF
Chapter  53:  Layout Data Structures  Download PDF
Chapter  54:  Floorplan Representation in VLSI  Download PDF
Chapter  55:  Computer Graphics  Download PDF
Chapter  56:  Geographic Information Systems Download PDF
Chapter  57:  Collision Detection  Download PDF
Chapter  58:  Image Data Structures  Download PDF
Chapter  59:  Computational Biology Download PDF
Chapter  60:  Data Structures for Cheminformatics Download PDF
Chapter  61:  Elimination Structures in Scientific Computing  Download PDF
Chapter  62:  Data Structures for Databases  Download PDF
Chapter  63:  Data Structures for Big Data Stores Download PDF
Chapter  64:  Data Mining  Download PDF
Chapter  65:  Computational Geometry: Fundamental Structures  Download PDF
Chapter  66:  Computational Geometry: Proximity and Location  Download PDF
Chapter  67:  Computational Geometry: Generalized (or Colored) Intersection Searching Download PDF
Index Download PDF
Search for more...

Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.