Received: from tom.wettzell.ifag.de (tom.wettzell.ifag.de [193.174.166.191]) by mail.postgresql.org (8.11.1/8.11.1) with ESMTP id eBI9pA672196 for ; Mon, 18 Dec 2000 04:51:10 -0500 (EST) (envelope-from dassing@wettzell.ifag.de) Received: from wettzell.ifag.de (john.wettzell.ifag.de [193.174.166.33]) by tom.wettzell.ifag.de (8.9.3/8.9.3) with ESMTP id JAA01156; Mon, 18 Dec 2000 09:51:15 GMT Message-ID: <3A3DDE12.AD1278D9@wettzell.ifag.de> Date: Mon, 18 Dec 2000 10:51:14 +0100 From: Reiner Dassing Organization: BKG-Wettzell X-Mailer: Mozilla 4.75 [en] (WinNT; U) X-Accept-Language: de,en MIME-Version: 1.0 To: pgsql-sql@postgresql.org Subject: Best database structure for timely ordered values Content-Type: text/plain; charset=iso-8859-2 Content-Transfer-Encoding: 7bit X-Archive-Number: 200012/192 X-Sequence-Number: 526 Hi! I am thinking about the best structure of a database to describe timely ordered values. The timely ordered values are the results of different sensors measuring environmental parameters like temperatur, pressure, humidity. The database has to define the kind of measurements, kind of sensors, place of them, ie., more or less static information. The main part will be the measurement values ordered by the time or epoch due to UTC. The primary index must be the epoch. As there will be no deletion from this data I fear - due to the internal representation of B-trees - the performance will degrade very soon. The expected number of measurements will easily reach some millions. Any comments or ideas? Reiner