[Nfd-dev] Index-based NDN Repository Doubt

[Junxiao Shi]

Hi Navdeep

All query algorithms are designed to find the best match among stored Data in a repository that satisfy the Interest.
A Data satisfy an Interest if the Interest Name is a prefix of the Data fullName, and the Data fullName does violate any selector other than ChildSelector.
A Data is the best match among stored Data in a repository or cache if it satisfies the rules of ChildSelector.

The Data ndn:/ndn/edu/videos/vid1/A/1998123123…. does not satisfy an Interest ndn:/A, so the query algorithm will not return this Data.

Yours, Junxiao


From: Navdeep Uniyal
Sent: Tuesday, August 4, 2015 01:35
To: shijunxiao at email.arizona.edu
Subject: Index-based NDN Repository Doubt


Hi Junxiao,

I was going through your ppt named “Index-based NDN Repository”, I have a doubt on “Query Algorithm – rightmost, alternate”. I understood it start iterating from the left and returns the match. My doubt is does it return if the full match is found or partial match. 

Actually, I was searching for some inbuilt functions so that I can match a part of the Interest name, for e.g. if the interest name is /ndn/edu/videos/vid1/A/1998123123…. So my aim to check if the interest name contains ‘/A/’ in particular or not. Please let me know if there is some function available and how I can achieve this.



Best Regards,
Navdeep Uniyal



-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/nfd-dev/attachments/20150805/bea17872/attachment.html>