moderated, Creating a Database using the STL: Newbie looking for code samples

Hi,

I'm a newbie (student) looking to learn more about creating a database
using the STL.

Some of the requirements include making searching and sorting better
than O(n) complexity (in other words, they need to be fast).

Can anyone point me to some places where I can get some code samples
to help me understand it.

Thanks.

J "the newb" Z

[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]

there are numerous open source databases out there already, feel free to
check out one of those for ideas and direction. postgresql had a C++ project
going on iirc...

peace,
cj




--
===============================================================================
Christopher Jon Miller Drink and dance and laugh and lie
Parallel Systems Engineer Love, the reeling midnight through
For tomorrow we shall die!
(But, alas, we never do.)
-- Dorothy Parker, "The Flaw in Paganism"
===============================================================================

[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]

XXXX@XXXXX.COM (JZapin) wrote

The phrase "database" has more than one meaning. Normally when I hear
it I think of a persistent collection of data, organized for fast
retrieval of random elements. SQL Server, Oracle, even Microsoft Access.
This is the most usual definition of "database" but it normally isn't
handled with the STL at all.

You could also just mean a collection of data in memory; this type of
database starts empty, but populates while the program runs.

The third variation is a fusion of both methods; the database is kept
internally, but when the program exits it first writes out ALL of the
data to a file, and when the program starts up it reads ALL of the data
back in.

For both of the alternative meanings, the STL would be a fine way to
organize data in memory.


Look in to class map or multimap, depending on your data. One of these
should give you what you're after.

Note: With the STL it's important not to mix data types in the same
container. You cannot put an object of type Derived into a container
of type Base. You can create a container of pointers instead, if you
need to mix data types.


[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]

> For both of the alternative meanings, the STL would be a fine way to
> organize data in memory.
>
>> Some of the requirements include making searching and sorting better
>> than O(n) complexity (in other words, they need to be fast).
>
> Look in to class map or multimap, depending on your data. One of these
> should give you what you're after.

What about hash_map and hash_multimap?

I know they're non-standard extensions, which may/may-not get standardized
later on, but most implementations offer them as extensions. Also their
interfaces are pretty much the same, because they are more or less all
HP/SGI derived.


--
Regards,
-Dhruv.

Proud to be a Vegetarian.
http://www.vegetarianstarterkit.com/
http://www.vegkids.com/vegkids/index.html


[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]

You might be interested in looking at Relational Template Library - http://groups.yahoo.com/group/boost/files/tables.zip

--
Maxim Yegorushkin

[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]