Everything about Comparison of data structures

🧭 Start here: a 6-step reading path

1. Read the overview: Comparison of data structuresA 5-minute orientation
2. Skim a recent paper: Comparative Visualization of Algorithms and Data StructuresInfluential work since 2022
3. Pick up a classic book: Sixteenth census of the United StatesThe most-reprinted book on the subject
4. Read the landmark paper: Genome alignment with graph data structures: a comparisonCited 34 times
5. Go sideways: Pairing heapA closely related topic
6. Go sideways: Heap (data structure)A closely related topic

🏆 Landmark papers (most cited)

• Genome alignment with graph data structures: a comparison

  Birte Kehr, Kathrin Trappe, Manuel Holtgrewe · 2014 · BMC Bioinformatics · 34 citations

• Identifying hidden semantic structures in Instagram data: a topic modelling comparison

  Roman Egger, Joanne Yu · 2021 · Tourism Review · 34 citations

• The silsoe structures building: Comparison of 1 : 100 model-scale data with full-scale data

  G.M. Richardson, P.A. Blackmore · 1995 · Journal of Wind Engineering and Industrial Aerodynamics · 24 citations

• Comparison of multiple crystal structures with NMR data for engrailed homeodomain

  Tomasz L. Religa · 2008 · Journal of Biomolecular NMR · 19 citations

• The Silsoe structures building: Comparison between full-scale and wind-tunnel data

  G.M. Richardson, D. Surry · 1994 · Journal of Wind Engineering and Industrial Aerodynamics · 19 citations

• Comparison of velocimetry techniques for turbulent structures in gas-puff imaging data

  J. M. Sierchio, I. Cziegler, J. L. Terry · 2016 · Review of Scientific Instruments · 18 citations

• A Performance Comparison of Tree Data Structures for N-Body Simulation

  J. Waltz, G.L. Page, S.D. Milder · 2002 · Journal of Computational Physics · 17 citations

• A comparison of data structures for the simulation of polydisperse particle packings

  S. Raschdorf, M. Kolonko · 2010 · International Journal for Numerical Methods in Engineering · 13 citations

🆕 Influential since 2022

• Comparative Visualization of Algorithms and Data Structures

  Filip Vateha, Slavomír Šimoňák · 2025 · Computing and Informatics · 4 citations

• Propensity Score Matching with Cross-Classified Data Structures: A Comparison of Methods

  Yongseok Lee, Walter L. Leite, Audrey J. Leroux · 2023 · The Journal of Experimental Education · 3 citations

• Comparison of six voxel-based data structures via a unified multi-axis milling simulation framework

  Zhengwen Nie, Jiabin Cao, Yiyang Zhao · 2025 · The International Journal of Advanced Manufacturing Technology · 3 citations

• An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs

  Qing Chen, Michael H. Böhlen, Sven Helmer · 2025 · Proceedings of the ACM on Management of Data · 2 citations

• Data Structures Comparison for Element Deletion Including Stack and Queue

  Maja Sarevska · 2024 · WSEAS TRANSACTIONS ON COMMUNICATIONS · 0 citations

📚 Books worth reading

• Sixteenth census of the United StatesUnited States. Bureau of the Census · 1900
• Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000
• HackingJon Erickson, Jon Erickson · 2003
• The Elements of Statistical LearningTrevor Hastie, Robert Tibshirani · 2001
• The Conspirators HierarchyJohn Coleman · 1992
• Qualitative Data AnalysisMatthew B. Miles, A. Michael Huberman · 2013
• Data refinementW.-P. de Roever, Willem-Paul de Roever · 1998
• Anthropological researchPertti J. Pelto · 1970

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Pairing heap A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance, introduced by Michael…
• Heap (data structure) In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node…
• Binomial heap In computer science, a binomial heap is a data structure that acts as a priority queue. It is an example of a mergeable heap (also called meldable heap)…
• Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
• Fibonacci heap In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better…
• Skew binomial heap In computer science, a skew binomial heap (or skew binomial queue) is a data structure for priority queue operations. It is a variant of the binomial heap…
• Brodal queue In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: O(1) for insertion, find-minimum, meld (merge…
• Binary heap A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. The binary…