Talk:List of data structures
From Wikipedia, the free encyclopedia
I was wondering if this page could be extended to become a more comprehensive listing of data structures. The idea would be to create a standard format of the form
Name
Operations
Efficiency
lower bounds
refs
cross refs to other structures etc.
That may not be appropriate for the list page, but each page could have a table, like most language, country, and taxonomic classification pages have, that has a standard format with common information. --G Gordon Worley III 22:50, 23 Sep 2004 (UTC)
---
An associative array is a Abstract Data Type, not a Data Structure. Should it be on here?
---
Shouldn't BSP trees get their own link? It has it's own article already..
[edit] Organization
The way this page is currently layed out is inconsistent and rather confusing. Many of the data structures listed could fit easily in more than one place. For example, heaps are a type of priority queue, and binary search trees are a type of associative array. I suggest this page be reorganized so that the top-level heading are abstract data types and underneath are all of the concrete data structures that implement the abstract data type. A "Miscellaneous" top-level category would house any unique concrete data structures. Thoughts?
[edit] Columns with strong and weak points of each data structure
I would like to see in this page, data structures in a table with columns saying which advantages they have: For instance, some data structures are useful when data is sparse, while some other behave better when they are complete. Some of them behave very well on parallel environments while some others do better on single threaded. Some others provide very good space usage, while some others give a very good performance while not caring about the space too much. Some have very fast queries while slow updates.
That would make a page like a reference where to find which data structure is suitable for each problem depending on the properties we want.
Just some thoughts.
