<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: We have OpenSearch, now what?</title>
	<atom:link href="http://www.givp.org/2008/05/02/we-have-opensearch-now-what/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.givp.org/2008/05/02/we-have-opensearch-now-what/</link>
	<description>It's a G thang</description>
	<pubDate>Tue, 06 Jan 2009 10:55:03 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: Giv P</title>
		<link>http://www.givp.org/2008/05/02/we-have-opensearch-now-what/#comment-39</link>
		<dc:creator>Giv P</dc:creator>
		<pubDate>Thu, 30 Oct 2008 23:17:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.givp.org/?p=5#comment-39</guid>
		<description>Hi Jakob. I understand what you mean about the use of "federated" in this context and please feel free to use the material on this blog.</description>
		<content:encoded><![CDATA[<p>Hi Jakob. I understand what you mean about the use of &#8220;federated&#8221; in this context and please feel free to use the material on this blog.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jakob</title>
		<link>http://www.givp.org/2008/05/02/we-have-opensearch-now-what/#comment-38</link>
		<dc:creator>Jakob</dc:creator>
		<pubDate>Thu, 30 Oct 2008 22:22:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.givp.org/?p=5#comment-38</guid>
		<description>Thanks for your inspiring experiment, can I use the image for my slides with reference to this article? The only thing that bothers me is that you call "federated search" what in fact is a meta search with additional result merging. In federated search, all particular sources have agreed on a common standard how to index documents, so you can easily combine the results without re-ranking. In your example there is no federation among the RSS-Feeds. This use of the term "federated search" always confuses people and in the end you have to explain in detail what kind of search you do - because people tend to use trendy terms without common definition.</description>
		<content:encoded><![CDATA[<p>Thanks for your inspiring experiment, can I use the image for my slides with reference to this article? The only thing that bothers me is that you call &#8220;federated search&#8221; what in fact is a meta search with additional result merging. In federated search, all particular sources have agreed on a common standard how to index documents, so you can easily combine the results without re-ranking. In your example there is no federation among the RSS-Feeds. This use of the term &#8220;federated search&#8221; always confuses people and in the end you have to explain in detail what kind of search you do - because people tend to use trendy terms without common definition.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Giv P</title>
		<link>http://www.givp.org/2008/05/02/we-have-opensearch-now-what/#comment-8</link>
		<dc:creator>Giv P</dc:creator>
		<pubDate>Fri, 02 May 2008 17:14:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.givp.org/?p=5#comment-8</guid>
		<description>Thanks, Nate. Yes I realise there is a scalability issue here for doing real-time indexing. In future experiments I will work on doing the indexing separately so the only thing the UI is interacting with is the index and that should be super fast. The main challenge there will be updating the index on a regular basis and speed.</description>
		<content:encoded><![CDATA[<p>Thanks, Nate. Yes I realise there is a scalability issue here for doing real-time indexing. In future experiments I will work on doing the indexing separately so the only thing the UI is interacting with is the index and that should be super fast. The main challenge there will be updating the index on a regular basis and speed.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mike</title>
		<link>http://www.givp.org/2008/05/02/we-have-opensearch-now-what/#comment-7</link>
		<dc:creator>Mike</dc:creator>
		<pubDate>Fri, 02 May 2008 15:10:56 +0000</pubDate>
		<guid isPermaLink="false">http://www.givp.org/?p=5#comment-7</guid>
		<description>Hi Giv

Picked your site up via Nate's blog. I thought you might be interested in the stuff I've put together over on www.mashedmuseum.org.uk - I'm gently encouraging a "community of practice" around museum programmatic data access - lightweight, RESTful, RSS-feedy stuff. There is a very initial list of data sources there plus a Google Group and so on.

tfn

Mike</description>
		<content:encoded><![CDATA[<p>Hi Giv</p>
<p>Picked your site up via Nate&#8217;s blog. I thought you might be interested in the stuff I&#8217;ve put together over on <a href="http://www.mashedmuseum.org.uk" rel="nofollow">http://www.mashedmuseum.org.uk</a> - I&#8217;m gently encouraging a &#8220;community of practice&#8221; around museum programmatic data access - lightweight, RESTful, RSS-feedy stuff. There is a very initial list of data sources there plus a Google Group and so on.</p>
<p>tfn</p>
<p>Mike</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nate Solas</title>
		<link>http://www.givp.org/2008/05/02/we-have-opensearch-now-what/#comment-6</link>
		<dc:creator>Nate Solas</dc:creator>
		<pubDate>Fri, 02 May 2008 15:04:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.givp.org/?p=5#comment-6</guid>
		<description>I applaud the experiment: that's a very clever take on combining and ranking disparate result sets.  I think speed would be an issue for any real-life usage, but overall this sounds similar to what Terry Makewell described for their system - although I don't think they were using Lucene?

I'm in the middle of a project at the Walker that will eventually (soon!) expose an OAI-PMH repository of our collection metadata, I'll be sure to send you a link to play with once it's up.  Hopefully something cool can come out of that!

Great start to the blog!</description>
		<content:encoded><![CDATA[<p>I applaud the experiment: that&#8217;s a very clever take on combining and ranking disparate result sets.  I think speed would be an issue for any real-life usage, but overall this sounds similar to what Terry Makewell described for their system - although I don&#8217;t think they were using Lucene?</p>
<p>I&#8217;m in the middle of a project at the Walker that will eventually (soon!) expose an OAI-PMH repository of our collection metadata, I&#8217;ll be sure to send you a link to play with once it&#8217;s up.  Hopefully something cool can come out of that!</p>
<p>Great start to the blog!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
