James Holderness wrote:
James M Snell wrote:
This could all get rather complicated very quickly. My primary
objective is to address known use cases for ordered feeds (my netflix
queue feed[1] for example), most of which are structured as complete
datasets that are non-incremental in nature.
I realise that this sort of thing sounds like a good idea from a
content provider's point of view, but as an aggregator developer, this
is probably the last thing I would want to support. A feed that is not
incremental is not a feed IMHO. There are just too many special case
complications that an aggregator developer has to deal with that have
nothing to do with regular, honest-to-goodness feeds.
I do believe this falls under the Not-All-Feeds-Should-Be-Aggregated
Category. That said, however, I think the concept of Feed-As-List is
one that generally has a lot of support.
1. It helps us to scope the relevance of an i:rank element within an
entry. For instance, if an entry with an i:rank in the urn:foo domain
is aggregated into a synthetic feed that either a) does not specify a
ranking domain or b) specifies a different ranking domain, consumers
can safely ignore the urn:foo i:rank.
This kind of makes sense, but I'm not convinced it's necessary. If the
feed has various ranks on which it can be sorted, I'd rather leave the
decision on which one to use to the user. If, for whatever reason,
those alternate domains are no longer applicable and the feed
absolutely has to force the use of a particular domain, wouldn't it
make more sense to filter out all those unused ranks rather than
making the user download them?
i:domain is not used as a key of determining which rankings to use; it's
a key that is used to correlate rankings. Regarding filtering, we
should not rely on aggregators filtering out unused ranks. Consider the
case of digitally signed entries; filtering out a rank covered by the
digital signature would invalidate the signature.
2. It helps us to correlate ranks that span multiple feed documents.
For instance, two separate feed documents may specify the same
ranking domain.
This I like.
By the description given, it sounds as if the BBC ranking is more a
ranking of relative importance than a ranking of natural order. That
is, Top Story A has a higher importance that Top Story B, etc. If
that is the case, a "priority" or "importance" ranking scheme can be
used in conjunction with the atom:updated element.
This almost works. As an aggregator, what I would want to do is
automatically sort with the date as the primary key and the priority
as the secondary key. That way, today's high-priority items would
appear at the top of the list, and yesterday's would follow on
afterwards. Any of yesterday's items that were still of some
importance today would need to have their atom:updated element set to
today and their priority adjusted as appropriate.
There are couple of problems though. The atom:updated element has to
be identical for all items on a particular day. Also the atom:updated
element can't be changed when an actual update occurs (say a spelling
correction, or an update on a story) without breaking the ordering.
The problem is we're abusing the atom:updated element so as to use it
for something that's it's not.
The updated elements would not need to be identical. Aggregators can
easily determine whether or not entries with different updated values
occured on the same day / same hour / etc. In other words, I could sort
by Day+Priority, Hour+Priority, Minute+Priority, whatever, without any
difficulty. There is no abuse of atom:updated here.
It would be better if we could add an extra attribute to your rank tag
that specified what date the rank applied to. For someone like the BBC
that reprioritizes feeds on a daily basis they'd set this attribute to
something like say midnight for the date on which the ranking applies.
If you have an item from a previous day that is still important today,
it would keep its original atom:updated value, but the rank-date would
be set to today.
I'll give this some thought, but my initial gut reaction is that it is
not necessary. Let me see if I can convince myself otherwise ;-)
Regards
James
Thanks for the input!
- James