<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Overlapping ranges: MySQL</title>
	<atom:link href="http://explainextended.com/2009/07/01/overlapping-ranges-mysql/feed/" rel="self" type="application/rss+xml" />
	<link>http://explainextended.com/2009/07/01/overlapping-ranges-mysql/</link>
	<description>How to create fast database queries</description>
	<lastBuildDate>Sun, 15 Apr 2012 12:14:02 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Quora</title>
		<link>http://explainextended.com/2009/07/01/overlapping-ranges-mysql/comment-page-1/#comment-663</link>
		<dc:creator>Quora</dc:creator>
		<pubDate>Mon, 14 Feb 2011 03:21:12 +0000</pubDate>
		<guid isPermaLink="false">http://explainextended.com/?p=1911#comment-663</guid>
		<description>&lt;strong&gt;What is the best way to store time windows and query against them?...&lt;/strong&gt;

One method I&#039;ve seen used is to map the time windows to spatial geometries. Doing so allows you to easily check for intersection in an efficient manner. Explain Extended has an example of this for MySQL you should be able to easily adapt to MS SQL: ht...</description>
		<content:encoded><![CDATA[<p><strong>What is the best way to store time windows and query against them?&#8230;</strong></p>
<p>One method I&#8217;ve seen used is to map the time windows to spatial geometries. Doing so allows you to easily check for intersection in an efficient manner. Explain Extended has an example of this for MySQL you should be able to easily adapt to MS SQL: ht&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>

