- From: Julian Reschke <julian.reschke@gmx.de>
- Date: Sat, 16 Dec 2006 21:59:04 +0100
- To: www-webdav-dasl@w3.org
Hi everybody. I'm currently looking at what it takes to clean up the current draft (see <http://greenbytes.de/tech/webdav/draft-reschke-webdav-search-latest.htm>) so that it can be submitted to the RFC Editor for publication as Experimental RFC -- it seems to me that would be the right step, there's clearly not sufficient energy to fully complete the work, but there are lots of implementations out there that would benefit from a stable spec. Anyway, one of the issues we probably can't avoid fixing is the issue of string comparisons, that is collation sequences. In this case, two very similar approaches come to mind: (1) Rely on XSLT collations (<http://www.w3.org/TR/xquery-operators/#collations>), requiring support for codepoint-by-codepoint (<http://www.w3.org/2005/xpath-functions/collation/codepoint>), or (2) Rely on <http://www.ietf.org/internet-drafts/draft-newman-i18n-comparator-14.txt>. Both give us roughly the same features, however (2) has the severe drawback that it only defines the collation registry, but not an actual collation we could require (we need at least a basic one that works for non-ASCII characters). Feedback appreciated, Julian
Received on Saturday, 16 December 2006 20:59:14 UTC