Author: Dann Corbit
Date: 18:02:42 01/17/01
Go up one level in this thread
On January 17, 2001 at 20:45:46, Wayde Beasley wrote: >A chess game in PGN -- simple. A few fields for the tags, then a glob for the >score. But it ain't that simple, is it? > >Traditional relational databases are fairly simple: links between tables. >LDAP has a tree-like structure. > >Can someone here explain in general terms the strategies and approaches that >have been taken to store massive databases of chess games. How are the indexes >created? Is there a good information resource on this topic hidden on the net >somewhere? Here is one approach: ftp://cap.connx.com/pub/analysis.sql This is really old. You can do a heck of a lot better by using a compressed format for the EPD. I like the format invented by Thomans Mooney III.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.