Handbook of Data Structures and Applications, Second Edition
- 35h 23m
- Dinesh P. Mehta, Sartaj Sahni (eds)
- CRC Press
- 2018
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.
In this Book
-
Analysis of Algorithms
-
Basic Structures
-
Trees
-
Graphs
-
Leftist Trees
-
Skew Heaps
-
Binomial, Fibonacci, and Pairing Heaps
-
Double-Ended Priority Queues
-
Hash Tables
-
Bloom Filter and Its Variants
-
Balanced Binary Search Trees
-
Finger Search Trees
-
Splay Trees
-
Randomized Dictionary Structures
-
Trees with Minimum Weighted Path Length
-
B Trees
-
Multidimensional Spatial Data Structures
-
Planar Straight Line Graphs
-
Interval, Segment, Range, and Priority Search Trees
-
Quadtrees and Octrees
-
Binary Space Partitioning Trees
-
R-Trees
-
Managing Spatiotemporal Data
-
Kinetic Data Structures
-
Online Dictionary Structures
-
Cuttings
-
Approximate Geometric Query Structures
-
Geometric and Spatial Data Structures in External Memory
-
Tries
-
Suffix Trees and Suffix Arrays
-
String Searching
-
Binary Decision Diagrams
-
Persistent Data Structures
-
Data Structures for Sets
-
Cache-Oblivious Data Structures
-
Dynamic Trees
-
Dynamic Graphs
-
Succinct Representation of Data Structures
-
Randomized Graph Data-Structures for Approximate Shortest Paths
-
Searching and Priority Queues in o(log n) Time
-
Functional Data Structures
-
LEDA, a Platform for Combinatorial and Geometric Computing
-
Data Structures in C++
-
Data Structures in JDSL
-
Data Structure Visualization
-
Drawing Trees
-
Drawing Graphs
-
Concurrent Data Structures
-
IP Router Tables
-
Multi-Dimensional Packet Classification
-
Data Structures in Web Information Retrieva
-
The Web as a Dynamic Graph
-
Layout Data Structures
-
Floorplan Representation in VLSI
-
Computer Graphics
-
Geographic Information Systems
-
Collision Detection
-
Image Data Structures *
-
Computational Biology
-
Data Structures for Cheminformatics
-
Elimination Structures in Scientific Computing
-
Data Structures for Databases
-
Data Structures for Big Data Stores
-
Data Mining
-
Computational Geometry: Fundamental Structures
-
Computational Geometry: Proximity and Location
-
Computational Geometry: Generalized (or Colored) Intersection Searching
