Editing
Data Structures
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Creating</span> == Future Frontiers: # '''Probabilistic Data Structures''': Structures like "Bloom Filters" that use very little memory but can tell you with 99% certainty if an item is in a set. # '''Persistent Data Structures''': Structures used in functional programming (like Clojure) that "remember" their previous versions without copying all the data. # '''Succinct Data Structures''': Pushing the mathematical limits to store data in the theoretical minimum amount of space (close to the entropy limit). # '''Neural Data Structures''': Using machine learning to "learn" the optimal index for a specific dataset. [[Category:Computer Science]] [[Category:Programming]] [[Category:Data Structures]] </div>
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information