Is it possible that what you want is a lookup table with a string index, i.e. attribute-value pairs?
If so, that would be represented as a hash in Perl, or a map in C++. In a database, you could design a very simple schema for it. Or do you just have unclear requirements, as others have suggested? -Will -----Original Message----- From: pgsql-general-ow...@postgresql.org [mailto:pgsql-general-ow...@postgresql.org] On Behalf Of A B Sent: 30 March 2009 14:51 To: pgsql-general@postgresql.org Subject: Re: [GENERAL] [GENEAL] dynamically changing table Well, the requirement is: keep a lot of data stored, don't loose any of it, and you will not know what you will have to store (changing number of fields and of different types) But it is not all that bad, the fields will be integers, or text, or floatingpoint numbers. One option is, put it in a db as a huge text (or in textfiles, one per object) and parse it when you need it. That might also work. -- Sent via pgsql-general mailing list (pgsql-general@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-general
