Handbook of Data Structures and Applications

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. Part 1: Introduction 1. Analysis of Algorithms (Sartaj Sahni) 2. Basic Structures (Dinesh P. Mehta) 3. Trees (Dinesh P. Mehta) 4. Graphs (Narsingh Deo) Part 2: Priority Queues 5. Leftist Trees (Sartaj Sahni) 6. Skew Heaps (C. Pandu Rangan) 7. Binomial, Fibonacci,and Pairing Heaps (Michael L. Fredman) 8. Double-Ended Priority Queues (Sartaj Sahni) Part 3: Dictionary Structures 9. Hash Tables (Pat Morin) 10. Bloom Filter and Its Variants (Chen and et al.) 11. Balanced Binary Search Trees (Arne Andersson, Rolf Fagerberg, Kim S. Larsen) 12. Finger Search Trees (Gerth Stølting Brodal) 13. Splay Trees (Sanjeev Saxena) 14. Randomized Dictionary Structures (C. Pandu Rangan) 15. Trees with Minimum Weighted Path Length (Wojciech Rytter) 16. B Trees (Donghui Zhang) Part 4: Multidimensional/Spatial Structures 17. Multidimensional Spatial Data Structs (Hanan Samet) 18. Planar Straight Line Graphs (Siu-Wing Cheng) 19. Interval, Segment, Range, and Priority Search Trees (D.T. Lee, Hung-I Yu) 20 Quadtrees and Oct