Re: [SQL] apt.postgresql.org vs. Pitti PPA - install error

n in precise. But I'm no pro, so I have no real insider look; That's why I'll have to wait. Regards, Rawi -- View this message in context: http://postgresql.1045698.n5.nabble.com/apt-postgresql-org-vs-Pitti-PPA-install-error-tp5759622p5770447.html Sent from the PostgreSQL -

Re: [SQL] apt.postgresql.org vs. Pitti PPA - install error

release -c Codename: raring Same fault: The following packages have unmet dependencies: postgresql-common : Breaks: logrotate (>= 3.8) but 3.8.3-3ubuntu2 is installed So, how to install the 9.3 precise-version on raring? Thanks in advance! Regards Rawi -- View this message in c

[SQL] Re: Index Usage and Running Times by FullTextSearch with prefix matching

Tom Lane-2 wrote > rawi < > only4com@ > > writes: >> And querying: FTS with prefix matching: > >> SELECT count(a) >> FROM t1 >> WHERE a_tsvector @@ to_tsquery('aaa:* & b:* & c:* & d:*') > >> (RESULT: count: 619) >>

[SQL] Re: Index Usage and Running Times by FullTextSearch with prefix matching

rawi wrote > > Tom Lane-2 wrote >> FWIW, I get fairly decent performance for cases like this in HEAD >> (at least with a GIN index; GIST seems much less able to do well with >> short prefixes). What PG version are you testing? > Thank you Tom, > > I'm t

Re: [SQL] apt.postgresql.org vs. Pitti PPA - install error

so I took then the precise one... Thank you! Regards, Rawi -- View this message in context: http://postgresql.1045698.n5.nabble.com/apt-postgresql-org-vs-Pitti-PPA-install-error-tp5759622p5759636.html Sent from the PostgreSQL - sql mailing list archive at Nabble.com. -- Sent via pgsql-s

[SQL] apt.postgresql.org vs. Pitti PPA - install error

pendencies: postgresql-common : Breaks: logrotate (>= 3.8) but 3.8.3-3ubuntu2 is installed. Going back to the Pitti PPA I could install pg-9.2 without problems (there will be no 9.3 in there) Regards Rawi -- View this message in context: http://postgresql.1045698.n5.nabble.com/apt-post

[SQL] Re: Index Usage and Running Times by FullTextSearch with prefix matching

Index Cond: (a_tsvector @@ to_tsquery('a:* & b:* & c:* & d:*'::text))" Kind Regards Rawi -- View this message in context: http://postgresql.1045698.n5.nabble.com/Index-Usage-and-Running-Times-by-FullTextSearch-with-prefix-matching-tp57590

[SQL] Re: Index Usage and Running Times by FullTextSearch with prefix matching

27;ll update to 9.2 the next days and try again. Kind Regards Rawi -- View this message in context: http://postgresql.1045698.n5.nabble.com/Index-Usage-and-Running-Times-by-FullTextSearch-with-prefix-matching-tp5759021p5759045.html Sent from the PostgreSQL - sql mailing list archive at Nabble.

[SQL] Index Usage and Running Times by FullTextSearch with prefix matching

s=1 width=36)" "Recheck Cond: (a_tsvector @@ to_tsquery('aaa:* & b:* & c:* & d:*'::text))" "-> Bitmap Index Scan on a_tsvector_idx (cost=0.00..800.00 rows=1 width=0)" " Index Cond: (a_tsvector @@ to_tsquery('aaa:* &am

Re: [SQL] kind of RULE on SELECT depending on existence of a WHERE condition

Richard Huxton wrote: > > You could write a set-returning function that takes either: > 1. A list of conditions > 2. The text for a WHERE clause > If it gets no conditions or a blank string, it returns nothing. > You will need to create the function with SECURITY DEFINER permissions, > That's

Re: [SQL] kind of RULE on SELECT depending on existence of a WHERE condition

ation out of the user-records and expressed in the WHERE flags. I'll need another approach... Cheers, Rawi -- View this message in context: http://old.nabble.com/kind-of-RULE-on-SELECT-depending-on-existence-of-a-WHERE-condition-tp27741669p27742718.html Sent from the PostgreSQL - sql mailin

[SQL] kind of RULE on SELECT depending on existence of a WHERE condition

le ON SELECT, so a SELECT without WHERE on the flags would return NOTHING. Is there a way to achieve this? Thank you for reading and hoping my problem can be solved. Rawi -- View this message in context: http://old.nabble.com/kind-of-RULE-on-SELECT-depending-on-existence-of-a-WHERE-condition

[SQL] Thank you all for your help...

gnment in the case of parallel access of the database with another application... Sure, I'll have timestamps vor that, but... :) Finally I'll go - certainly - with one sequence per PK. Thanks Kind regards, Rawi -- View this message in context: http://www.nabble.com/Hibernate%2C-web-applicati

Re: [SQL] Hibernate, web application and only one sequence for all primary keys

a source did have the OIDs in the past, as they were standard in each table? I thought they have been also generated by an unique sequence? Regards, Rawi -- View this message in context: http://www.nabble.com/Hibernate%2C-web-application-and-only-one-sequence-for-all-primary-keys-tp254904

Re: [SQL] Hibernate, web application and only one sequence for all primary keys

happen, if I set the cache size of Hibernate's own sequence (after generation) by hand to 1 instead of 50? I wouldn't need tausends of inserts per second... Kind regards, Rawi -- View this message in context: http://www.nabble.com/Hibernate%2C-web-application-and-only-one-sequence-for-all-

Re: [SQL] Hibernate, web application and only one sequence for all primary keys

possibilities :) I could work around this in my app and explicitly ask Hibernate to use my hand made sequences in PostgreSQL. While this asks me for some more definition work, I wanted to know, if this is worth the effort... I know it now, thanks :) Kind regards, Rawi -- View this message in c

Re: [SQL] Hibernate, web application and only one sequence for all primary keys

SORRY for incorrectly posting this here! I couldn't move it to PostgreSQL - performance... afterwards. While I don't want to double-post: It would be perfect, if the mail list admin - please - could correct my mistake... Regards, Rawi -- View this message in context: http://www.

[SQL] Hibernate, web application and only one sequence for all primary keys

an Intel Pentium 2 Duo (2.5-2.8GHz) with 3 GB RAM and SATA hard disk under Ubuntu Server. Thank you very much in advance! Regards Rawi -- View this message in context: http://www.nabble.com/Hibernate%2C-web-application-and-only-one-sequence-for-all-primary-keys-tp25490498p25490498.html Sent from

re[SQL] cursively isolate pedigrees, based only on person_id, mother_id and father_id

y given person.id from the table with many families. After failing to accomplish this with a recursive SQL I found on the web an advice from Celko (???) http://www.eggheadcafe.com/conversation.aspx?messageid=29498840&threadid=29498808 to better keep away form such things... :( Did someone gath

[SQL] hopeless, SQL not resolved yet

Thank you very much for the answer! No, I'm not that good... I got finally a fully kinky SQL, which resolves nothing and runs endless for a couple of test records... I think, it would be better to open for this matter a new thread... Regards Rawi -- View this message in context:

re[SQL] solved: WITH RECURSIVE: ARRAY[id] All column datatypes must be hashable

me again... I figured it out... The Error was caused because I used UNION in place of UNION ALL. I still don't understand why the ARRAY (path) could not be grouped... Bye rawi -- View this message in context: http://www.nabble.com/WITH-RECURSIVE%3A-ARRAY-id--All-column-datatypes-mu

[SQL] WITH RECURSIVE: ARRAY[id] All column datatypes must be hashable

anything on the net about "All column datatypes must be hashable", excepting the postgresql sources... Thanks rawi -- View this message in context: http://www.nabble.com/WITH-RECURSIVE%3A-ARRAY-id--All-column-datatypes-must-be-hashable-tp25167538p25167538.html Sent from the PostgreSQL