From: Ofir Carny <Ofir_at_vidius.co.il>
Date: Sun, 27 Jul 2003 20:10:42 +0300

Did you consider using a treelike structure?
Tt could dispose of the limitation while maintaining a logarithmic search time (a bit more complex though).
-----Original Message-----
From: Owen Sebastian Hofmann [mailto:oshofmann_at_amherst.edu]
Sent: Thursday, July 24, 2003 1:07 AM
To: rockbox_at_cool.haxx.se
Subject: Re: Flash Games question...


Björn Stenberg wrote:
>
> Feature request #613544 describes an ID3 database, which is precisely what is necessary for browsing tags. It has raised priority to indicate this is an issue we (core developers) feel would be valuable.
>
> The trick is to design a database/file format that is quickly searchable while requiring a minimum of ram used. (I.e. waste disk space if it saves ram use and/or increases speed.)
>
I was toying with something like this a while ago. By imposing the
limitation that all database entries are the same size, the file on the
disk can be binary searched without any buffering and with relatively
little disk access. I kinda lost interest, having got it to the point
where it found stuff, but didn't actually do anything with it.

**********************************************************************
This email and attachments have been scanned for
potential proprietary or sensitive information leakage.

PortAuthority(TM) Server
Keeping Information Inside
Vidius, Inc.
www.vidius.com
**********************************************************************
Received on 2003-07-27