<?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: Improved Carsurvey.org Search</title>
	<atom:link href="http://www.distantparts.com/2006/06/22/49/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.distantparts.com/2006/06/22/49/</link>
	<description>Random thoughts from a far off place</description>
	<pubDate>Tue, 07 Oct 2008 04:47:15 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: Sean Nieuwoudt</title>
		<link>http://www.distantparts.com/2006/06/22/49/#comment-10029</link>
		<dc:creator>Sean Nieuwoudt</dc:creator>
		<pubDate>Fri, 27 Jul 2007 22:59:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.distantparts.com/2006/06/22/49/#comment-10029</guid>
		<description>hi Steven,

Was just curious. Been doing a substantial amount of research into improving fulltext searching. We're busy with a search engine at the moment that will be putting it all to the test.

"everyone has to re-invent the wheel at some point" :)

Sean</description>
		<content:encoded><![CDATA[<p>hi Steven,</p>
<p>Was just curious. Been doing a substantial amount of research into improving fulltext searching. We&#8217;re busy with a search engine at the moment that will be putting it all to the test.</p>
<p>&#8220;everyone has to re-invent the wheel at some point&#8221; <img src='http://www.distantparts.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>Sean</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steven</title>
		<link>http://www.distantparts.com/2006/06/22/49/#comment-8828</link>
		<dc:creator>Steven</dc:creator>
		<pubDate>Wed, 06 Jun 2007 09:36:14 +0000</pubDate>
		<guid isPermaLink="false">http://www.distantparts.com/2006/06/22/49/#comment-8828</guid>
		<description>&lt;p&gt;Hi Sean,&lt;/p&gt;
&lt;p&gt;There's no ordering of the results by the quality of the match, so pagination isn't based on result quality. All matches are treated equally.&lt;/p&gt;
&lt;p&gt;For the pagination, I have a internal parameter for the number of results per page, and I just use a pretty standard quotient / remainder division to split the results into the correct number of pages. I then use the results of that calculation to output the correct rows of the search results on each page.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Hi Sean,</p>
<p>There&#8217;s no ordering of the results by the quality of the match, so pagination isn&#8217;t based on result quality. All matches are treated equally.</p>
<p>For the pagination, I have a internal parameter for the number of results per page, and I just use a pretty standard quotient / remainder division to split the results into the correct number of pages. I then use the results of that calculation to output the correct rows of the search results on each page.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sean Nieuwoudt</title>
		<link>http://www.distantparts.com/2006/06/22/49/#comment-8774</link>
		<dc:creator>Sean Nieuwoudt</dc:creator>
		<pubDate>Tue, 05 Jun 2007 23:12:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.distantparts.com/2006/06/22/49/#comment-8774</guid>
		<description>hi there,

just curious as to how you went about calculating the result pagination after executing a fulltext search?

Sean</description>
		<content:encoded><![CDATA[<p>hi there,</p>
<p>just curious as to how you went about calculating the result pagination after executing a fulltext search?</p>
<p>Sean</p>
]]></content:encoded>
	</item>
</channel>
</rss>
