Author: Wayde Beasley
Date: 17:45:46 01/17/01
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? Thanks.
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.