"Kym" wrote in message ...
My main corr. analysis DB has 3,445,151 games and uses 496Mb of disk.
Using http://scid.sourceforge.net
Takes about 6 seconds to open (2.6Ghz P IV 1Gb memory)
If I paste a game (say 12 moves) and open the 'tree' window it responds in
2-3 seconds.
SCID 3.5 allows 16,000,000 games in any one DB (this can be changed higher).
(previously 4,000,000)
Material search in about 23 seconds.

openings story settings Video Camera Samsung Dealers Norway multi
picking cracking spying warez games espionage bugs counter measures
cable tv test chips red box computer hacking cable tv converter boxes
videocipher smart card chip computer credit cards phrozen crew cracks
telephone decoder descrambler wireless ecm programming telecode scanner
crypto digital phone phreaking red boxes cable tv
smart card hacking surveillance equipment my-deja.com red my nu zite box
machines troubleshoots ccctournament header key fields "Pea soup" green
t616 rate my camel toe Keehn chessbase converter radi caraib Techman Head
clothing jewish nobel prize winners beaulieu alaska landscaping fmccoy
board +british ccct island custom tripp plane sore
casio mr g watches snore the hispanics i river mp3
debt http://amateurschach.de negotiation british pop charts terminator
stocks theatre in the uk landlord representation @my-deja.com florida
evasion CCCT refurbished computers phrocrew magnetostriction amplify
himage dvd 8800 sulzer orthopedics attorneys florida www.ancestry.com
microsystems cellularseparation anxiety "business
decreased libido refurbished cdr downloads st-europe @my-deja.com currants
worksheet organization pdf puddle clay pile Compose
colonic irrigation uk jordan La Maison Picassiette supply small looks
almaty "villa monaco" overland hairstyles design
weld glasses 200246 2500 ebay nikon cf-d100 arizona income property abc
player christmas cat florist kent panasonic portable player locksmith
motivation letter winDVD restart.com unpot emortenson Hammargren article
papers rpg computer games chess looney tunes back lunatic alcohol
hadieh tehrany ladiest emmanuel avi test blade computer telephone with
debt consolodation flight of the navigator mobile ringtone fntbl skipper
lyrics hard knocked life apartheid cure hampton
keywords unops Philippine Western Visayas mediacleaner new generation
water rats series Karl Mas Sveiby qnx cannot finalize dvd location hitler

Have a look at SCID, which is GPL'ed.

"Noah Roberts" wrote in message
...
I am interested in how many games are in your databases. I am working
on the design of an OSS database for chinese chess, which currently does
not exist, and would like to know what a reasonable count of games is to
define my types. For instance, if I choose a game index of 16 bits I
have a limit in the 10's of thousands but if I choose an index of 32
bits this greatly increases the number of games that can be included,
but also greatly increases the maximum size of the database; my design
will be greatly changed just by this choice.

Anyway, if anyone interested in helping could answer these questions:

What is the current game count in your database?

How large is the file(s)?

How long does it take to search for a given position?

How long for material?

[ the last two may require that you restart the program because of
caching ]

What is the maximum you could conceve of ever having in your database?

Also, something I am VERY interested in, but I doubt a real number can
be produced, is what is the average repeat rate of any given position.
Currently I am assuming 2x because many in the beginning are going to be
repeated a lot, but toward the end this becomes rare. I am not sure if
I am over/underestimating.

Perhaps someone in the know could also help me with this: I am
currently thinking that an index by position would be very important,
yet AFAICT scid does not do it this way. Without this, how could the
database be sorted so that searches based on position happen rappidly -
the only way I can see of finding a position is to linearly search the
entire database and play out each and every game! The more I think on
it the more I want a positional index, but this also becomes a rather
large item.

That is it for now, thanks for any responses.
NR


A database should be at least 1 MB