the scenario of multiple URIs for a single Datetime (second granularity,
which I think is all that RFC-822/RFC-1123 format supports) might be a
good candidate for http response "300 Multiple choices":
http://www.w3.org/Protocols/rfc2616/rfc2616-sec10.html#sec10.3.1
the entity sent back with the 300 could be:
1. a TimeMap (read: ORE Resource Map), in Atom, RDF, or whatever (see the
RDF example at:
http://www.mementoweb.org/guide/api/map1.rdf)
2. a custom mediawiki html entity, like a history page with just the
values for that Datetime, that allows the user to browse, compare, &
select the version they desire.
3. a combination of #1 with an XSLT that transforms the XML into an HTML
with the functionality of #2.
4. other ideas?
regards,
Michael
On Fri, 13 Nov 2009, Nikola Smolenski wrote:
Дана Thursday 12 November 2009 16:52:54 Aryeh Gregor
написа:
On Thu, Nov 12, 2009 at 10:43 AM, Nikola
Smolenski <smolensk(a)eunet.rs>
wrote:
I'd
say it is, if sufficiently precise :)
MediaWiki only keeps timestamps to one-second precision, so it's not.
I propose the following heuristics:
1. If appropriate timestamp doesn't exist in the database, use the newest one
older than the requested one.
2. If it exists, and only one revision has the timestamp, use that revision.
3. If more than one revision share the same timestamp, divide the second in
the number of revisions parts, and use the revision that falls in the
requested timestamp.
Suppose that someone asks for Wikipedia as it looked on 2009-11-13
18:53:11.4281. There are foutr revisions that have 2009-11-13 18:53:11
timestamp, revisions 123456, 123457, 123459 and 123460. Each revision gets
its quarter of the second, and since the request falls in the 2nd quarter,
use revision 123457.
_______________________________________________
Wikitech-l mailing list
Wikitech-l(a)lists.wikimedia.org
https://lists.wikimedia.org/mailman/listinfo/wikitech-l
----
Michael L. Nelson mln(a)cs.odu.edu
http://www.cs.odu.edu/~mln/
Dept of Computer Science, Old Dominion University, Norfolk VA 23529
+1 757 683 6393 +1 757 683 4900 (f)