[Nfd-dev] NDN Name Tree Implementation

[Lixia Zhang]

1/ there are multiple pieces of previous work related to name tree: 
1.a: CNL (Jeff's paper in ICN2019) talks about how to construct library functions around the name tree.

Xinyu took on that direction to build libraries for Python and GO (still in progress)

1.b earlier, Zhehao Wang in Jeff's group did a project on namespace discovery, 
Below is the latest exchange I had with him on October 2020:

> I recall you had some slides on the visualized namespace, but I can't find them.  Wonder if you still keep those old work? if so would appreciate a copy.
> 
> I tried looking around but didn't think I found decks of slides on it. If it helps, I had a short video demo of what it looked like <https://www.youtube.com/watch?v=FJc8C92PqII>, and the code is in this repository <https://github.com/zhehaowang/namespace-tree>. (NDN consumer logic <https://github.com/zhehaowang/namespace-tree>using JeffT's ndn-js, visualization <https://github.com/zhehaowang/namespace-tree/blob/master/js/tree.js> using d3.js)
> If I recall correctly the NDN consumer logic should be reasonably straightforward: walk name tree as you mentioned with an exclusion filter + get KeyLocator KeyName, and if data by that name is also already fetched, draw a line between the tree nodes to visualize what signed what.

Keep in mind that Zhehao's code used old NDN spec (which still had exclude filters)

2/ if you look for a (stable) storage of names, I dont recall such things existed.

3/ I had long proposed to support such functions, by having each node keep a piece of metadata for the immediate children's names.

Lixia

> On Feb 24, 2022, at 8:15 AM, Suravi Regmi (sregmi1) <sregmi1 at memphis.edu> wrote:
> 
> Hello Everyone,
> 
>  I would really appreciate to know if there exists an implementation for a hierarchical name tree for NDN names. I am looking to implement a way to store and retrieve names (possibly a trie?).
> 
> Each node in the tree (ref:attached) is a name component.
> 
> e.g. : /org/resource/attribute/details
> 
> For the above name we will have node org with child resource with child attribute and so on.
> 
> Few of the features that I want to implement are as follows:
> Traverse along the tree
> Given a node get all its children
> Searching 
> Longest prefix match and so on.
> 
> 
> Best,
> Suravi Regmi
> <Screen Shot 2022-02-22 at 1.48.11 PM.png>_______________________________________________
> Nfd-dev mailing list
> Nfd-dev at lists.cs.ucla.edu <mailto:Nfd-dev at lists.cs.ucla.edu>
> https://www.lists.cs.ucla.edu/mailman/listinfo/nfd-dev <https://www.lists.cs.ucla.edu/mailman/listinfo/nfd-dev>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/nfd-dev/attachments/20220224/6fdf7012/attachment.html>