Craig May writes:
> createuser -adq username
>
> returns
>
> invalid option adq
createuser -a -d -q
--
Peter Eisentraut [EMAIL PROTECTED] http://yi.org/peter-e/
Hi members of [EMAIL PROTECTED],
whats the difference between the pg-datatypes polygon and (closed) path?
Is there any information available on that topic?
yours, sincerely
c. hatger
--
Dipl.-Ing. C. Hatger
Hi,
I'm having trouble with the createuser command.
createuser -adq username
returns
invalid option adq
Could someone post an example using these args.
Regards,
Craig May
Enth Dimension
http://www.enthdimension.com.au
Mark Volpe <[EMAIL PROTECTED]> writes:
> someone give me a hint, or point me to the appropriate material on how to get
> "value::text" to work with my new type?
Write a function "text(yourtype) RETURNS text", and the parser will use
it for type coercions from yourtype to text. In general any typ
Hi,
I've created my own datatype for Postgres. I have found it necessary to be
able to convert it to text, so I could match it up with a text column in a
UNION. I figured Postgres would do this for me, but then, I'm naive. Can
someone give me a hint, or point me to the appropriate material on how
"Emils Klotins" <[EMAIL PROTECTED]> writes:
> Sort (cost=171.93..171.93 rows=1 width=56)
> -> Nested Loop (cost=0.00..171.92 rows=1 width=56)
> -> Nested Loop (cost=0.00..169.95 rows=1 width=36)
> -> Seq Scan on articles_groups x (cost=0.00..12.10
> rows=1 width=4)
Title: RE: [SQL] Re: OID Perfomance - Object-Relational databases
Given what we've been discussing over the past day or so, can anybody explain this to me:
dev=# explain select client.address.postcode from client;
NOTICE: QUERY PLAN:
Seq Scan on client (cost=0.00..1.01 rows=1 width=4)
Hi Josh,
I didn't get right tho this, because well.. you asked
the list, i figured i'd give them a chance first. and they've
answered the same as i would have..
> Because it's a very elegant solution to my database structure issues,
> I'm using OID's extensively as referents and foriegn ke
Emils,
There is no index on articles.id (should it not be a primary key?)
Regards,
Grant
Emils Klotins wrote:
> A typical query runs like this:
>
> SELECT a.id,a.title,c.fullpath,c.section FROM articles
> a,articles_groups x,newscategories c WHERE x.articleid=a.id AND
> a.categoryid=c.id AND x
I have the following tables:
**
Table "articles"
Attribute | Type | Modifier
-+-+--
id | integer |
title | text|
authorid| integer |
sourceid| integer |
createddate | date|
createdtime | time|
publ
Title: RE: [SQL] OID Perfomance - Object-Relational databases
I'm a little concerned about all this, because my understanding is that what makes an object database so fast is its ability to directly reference tuples, so that traversing relationships becomes like traversing pointers.
The achi
11 matches
Mail list logo