<?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: 5 kinds of data structure and 16 kinds of data access method</title>
	<atom:link href="http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/</link>
	<description>Choices in data management and analysis</description>
	<pubDate>Sun, 20 Jul 2008 01:30:55 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: Jack Orenstein</title>
		<link>http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/#comment-70247</link>
		<dc:creator>Jack Orenstein</dc:creator>
		<pubDate>Fri, 01 Feb 2008 01:59:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/2008/01/31/5-kinds-of-data-structure-and-16-kinds-of-data-access-method/#comment-70247</guid>
		<description>You missed three of my favorites.

1) skip-list: Neat alternative to balanced binary trees.

2) z-order (I did original research on this one): data transformation that turns any data structure supporting random and sequential access into a spatial data structure.

3) linear hashing.</description>
		<content:encoded><![CDATA[<p>You missed three of my favorites.</p>
<p>1) skip-list: Neat alternative to balanced binary trees.</p>
<p>2) z-order (I did original research on this one): data transformation that turns any data structure supporting random and sequential access into a spatial data structure.</p>
<p>3) linear hashing.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
