RE: Hashed URIs

> >I assume canonicalizing would *help* interop.  The point after all is
> >have two URIs that are the same evaluate to the same.
> Re-read Appendix A and explain how this will help. Section 4.3 says
> "A possible canonicalization algorithm for hierarchical URIs is given

I will admit that I never read the proposal.  You seem to be arguing
that interop suffers when there is more than one canonical
representation.  I agree, and in fact would argue that canonical in this
case is not the right word.  Maybe the author meant to say "normalize".

> I'm still confused. Who needs to provide metadata without revealing
> their web browsing habits?

Are you saying that you, personally, do not see the utility of this?  Or
are you saying that such utility does not exist?

> >* publish a "1 to 5 rating" of a web page, so that anyone visiting
> >page can see all of the previous visitors' ratings
> This is not useful unless you know what web page is being discussed.

I would hope that anyone visiting the page would know what page they are
visiting!  Upon arriving at a page, the user would calculate the page's
hashed URI, then use the hashed URI to retrieve metadata.  This makes it
easy to find the comments that people have made about a *particular*
page, while making it more difficult to enumerate pages that a
particular *user* has rated.

> >* publish metadata associated with yourself in such a way that
> >spam tools cannot use the metadata to target you
> You can publish metadata about yourself without using your email

Yes.  And a hash is a good way to do this.

Received on Tuesday, 26 November 2002 01:07:21 UTC