search

named-data-ndnSIM / ndnSIM

ndnSIM: NS-3 based NDN simulator
GNU General Public License v3.0
107 stars 163 forks source link

New (semi-)generalized tree-like data structure needed #1

Closed cawka closed 12 years ago

lanwang commented 12 years ago

What's the requirement? What's the current data structure?

Have you used Patritria Trie?

Lan On Jul 28, 2012, at 2:28 PM, Alexander Afanasyev wrote:

Reply to this email directly or view it on GitHub: https://github.com/NDN-Routing/ndnSIM/issues/1

cawka commented 12 years ago

I already have implemented something along the lines of Patricia Trie structure. Instead of the underlying binary tree and bit-by-bit lookup, there is a tree structure, each level of the tree represents a name component and can have multiple number of children, where lookup for a child is based on a hash function of a name component. Similar to general trie concept, some tree elements contain payload, some don't.

The issue here is not really an issue, just wanted to highlight the problem and show example of issues on GitHub.