Re: B-Trees, B+Trees, skiplists, ISAM-files
- Posted by David Gay <moggie at INTERLOG.COM> Sep 05, 1996
- 1985 views
At 10:30 AM 9/5/96 +0100, you wrote: >---------------------- Information from the mail header ----------------------- >Sender: Euphoria Programming for MS-DOS <EUPHORIA at >MIAMIU.ACS.MUOHIO.EDU> >Poster: Marcel Kollenaar <M.Kollenaar at SLO.NL> >Subject: B-Trees, B+Trees, skiplists, ISAM-files >------------------------------------------------------------------------------- Hi Marcell. I came across the same problem when I was writing "A Beginner's Guide To Euphoria", the tutorial program. I wanted to create something that allowed me to index a file randomly. I ended up writing a separate index file that served as a go-between to the program and the target file. Each index record contained the byte position to seek() to randomly address each part of the target file. It's similiar to an access path on an AS/400 physical keyed file. I'm not familiar with B-Trees, B+Trees or ISAM files, but if you want help writing procedures to maintain a relational database similiar to the AS/400 system, please contact me at moggie at interlog.com Thank you David Gay http://www.interlog.com/~moggie/euphoria.htm VISIT "A BEGINNER'S GUIDE TO EUPHORIA"!