RE: [SQL] readline ??

Title: RE: [SQL] readline ?? Try the new RPMs: postgresql-7.0.3-2mdk.  They include readline support. Ben > -Original Message- > From: vs [mailto:[EMAIL PROTECTED]] > Sent: 15 December 2000 10:12 > To: [EMAIL PROTECTED]; [EMAIL PROTECTED] > Cc: [EMAIL PROTECTED] > Subject: [SQL] re

[SQL] Best database structure for timely ordered values

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,

Re: [SQL] Subqueries in Non-SELECT Queries

Christof Glaser wrote: [ . . . ] > since the where clause compares just one field for equality. You might > try IN instead of =, ie > > update index set level = 2 where parentid in ( select id from > index where level = 1 ); That was it! Thanks, Frank

Re: [SQL] Best database structure for timely ordered values

Reiner Dassing <[EMAIL PROTECTED]> writes: > 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. Nonsense. btree should work just fine for that. Use a timestamp co

Re: [SQL] Confused by timezones

Tom Lane wrote: > I'm guessing that's not a legal timezone name on your platform. > On my box I have to spell it "PST8PDT" ... note that the displayed > abbreviation is not the same as the name used to set the timezone. I used PST as an example, but it doesn't work with any other zone, including

Re: [SQL] Best database structure for timely ordered values

> Reiner Dassing <[EMAIL PROTECTED]> writes: > > 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. > > Nonsense. btree should work just fine for that. Use

Re: [SQL] Best database structure for timely ordered values

Bruce Momjian wrote: > > > Reiner Dassing <[EMAIL PROTECTED]> writes: > > > 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. > > > > Nonsense. btree

Re: [SQL] Best database structure for timely ordered values

> > I assume the user is concerned about non-balanced btrees. > That is correct! > As I tested an example database with about 7 million entries on PostgreSQL V > 6.5.2 > and the result of > select count(*) from table; > tooks about 3 minutes I have this concern. > May be version 7.0.3 will give

Re: [SQL] Best database structure for timely ordered values

Bruce Momjian wrote: > > The larger problem is that count(*) doesn't use the index at all. It > just does a sequential scan of the heap table. Here is another example, which is even worse: select value from table where id=1 order by epoch desc limit 1; to ask for the last stored value. This re

Re: [SQL] Best database structure for timely ordered values

Reiner Dassing <[EMAIL PROTECTED]> writes: > Here is another example, which is even worse: > select value from table where id=1 order by epoch desc limit 1; > to ask for the last stored value. > This request needs about 5 minutes to complete. Hm. That should produce a decent plan given the right

[SQL] Problem with function...

Hi, I hope my question is appropriate for this list. I'm trying to create a function that calculates the distance between a pair of latitude/longitude points. This is what I have: /* latlon_distance.pgsql * by Jamu Kakar <[EMAIL PROTECTED]>, Dec 18, 2000. * * Calculates the distance between

Re: [SQL] Problem with function...

I don't think you return should have '' around them, i.e. RETURN distance; Michael Fork - CCNA - MCP - A+ Network Support - Toledo Internet Access - Toledo Ohio On Mon, 18 Dec 2000 [EMAIL PROTECTED] wrote: > Hi, > > I hope my question is appropriate for this list. I'm trying to create > a fu

[SQL] Tree structure table normalization problem (do I need a trigger?)

In a recent thread (How to represent a tree-structure in a relational database) I asked how to do a tree structure in SQL, and got lots of suggestions (thanks!), of which I chose the one below: create table Category ( CategoryID int4 not null primary key, ParentCategoryID int4 not null

[SQL] Bounds checking on an alias

Hi, Removing the double single-quotes from the distance function fixed the problem, thanks. I've now encountered another problem... I have the following (ugly) query: SELECT DISTINCT tbl_restaurant.restaurant, tbl_restaurant_location.postal_code, tbl_restaurant_location.latitude AS latitude, t

[SQL] RE: question on SELECT

Best Regards, Howard CIM/MASTEC Tel:(65)8605283 > -Original Message- > From: Howard Hiew > Sent: Tuesday, December 19, 2000 1:46 PM > To: '[EMAIL PROTECTED]' > Subject: question on SELECT > > Hi, > I would like to know what is the sql statement that list all the table

[SQL] question on SELECT

Hi, I would like to know what is the sql statement that list all the tables name. For example in Oracle, 'SELECT TABLE_NAME from ALL_TABLES where owner="Oracle" '; What is the statement for Postgres? Thank you Best Regards, Howard CIM/MASTEC Tel:(65)8605283

Re: [SQL] Problem with function...

Hi, there, modify the code as following. Jie LIANG Internet Products Inc. 10350 Science Center Drive Suite 100, San Diego, CA 92121 Office:(858)320-4873 [EMAIL PROTECTED] www.ipinc.com On Mon, 18 Dec 2000 [EMAIL PROTECTED] wrote: > Hi, > > I hope my question is appropriate for this list.