Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!mit-eddie!bu-cs!snorkelwacker!usc!cs.utexas.edu!widman
From: widman@cs.utexas.edu (Lawrence Widman)
Newsgroups: comp.databases
Subject: dBase III+ Indexing Algorithms
Message-ID: <7284@cs.utexas.edu>
Date: 4 Dec 89 04:22:35 GMT
Distribution: usa
Organization: U. Texas CS Dept., Austin, Texas
Lines: 18

This is posted for a friend who does not have news access, but can receive
internet mail.  Please direct replies to freedman@euclid.math.temple.edu.

"I have a question about indexing in the dBase and clone series of databases
for the PC.  I remember reading about some sort of variant of b-trees 
(b+-trees, maybe) in a dBase III+ implementation book.  I also know that
clones such as Clipper and FoxBase+ have their own indexing methods
which are supposedly one reason why they are faster than dBase (in addition
to preparsing/compiling, cacheing, ...).  Can anyone give my information
about what algorithms dBase III+ (and the clones, perhaps) use to do indexing?

"If there is any interest in this topic, I will post a summary of the 
replies to the network."


				Thank you in advance,
					Avi Freedman
					(freedman@euclid.math.temple.edu)


Brought to you by Super Global Mega Corp .com