[GENERAL] tables are not listable by \dt

relpages DESC; I get a list of the tables and their sizes. I'm not even sure where to begin looking for the solution and any pointers would be much appreciated. --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CC

Re: [GENERAL] tables are not listable by \dt

On Jul 2, 2007, at 10:04 AM, Rajarshi Guha wrote: Hi, we recently upgraded our Postgres instllation from 7.4 to 8.2 by doing a dump and restore. Howveer after logging into the database (as a user that is not the superuser) and doing \dt I get the error: No relations found But when I do

[GENERAL] count the number of bits set to 1 in a bit string field

Hi, is there a built in function that will give me the number of bits that are set to 1 in a bit string field? Thanks, --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B8

Re: [GENERAL] count the number of bits set to 1 in a bit string field

On Jul 15, 2007, at 7:20 PM, Ragnar wrote: On sun, 2007-07-15 at 15:35 -0400, Rajarshi Guha wrote: Hi, is there a built in function that will give me the number of bits that are set to 1 in a bit string field? no, but it should be trivial to do with pl/pgsql Thanks for the pointer

[GENERAL] using Tsearch2 for chemical text

Or will it be hampered by the fact that the bulk of the rows do not correspond to ordinary English --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F

[GENERAL] speeding up CUBE queries

mproving performance on the 12D case? Or am I stuck? Thanks, --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE --

Re: [GENERAL] speeding up CUBE queries

tions --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE --- Disembowelling takes guts. ---(end of broadcast)--

[GENERAL] keeping an index in memory

strategies do people follow when the index becomes very big? Thanks, --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B8

Re: [GENERAL] keeping an index in memory

On Oct 21, 2007, at 7:36 AM, Bill Moran wrote: Rajarshi Guha <[EMAIL PROTECTED]> wrote: Hi, relating to my previous queries on doing spatial searches on 10M rows, it seems that most of my queries return within 2 minutes. Generally this is not too bad, though faster is always

Re: [GENERAL] keeping an index in memory

er type of query (using cube_distance which by definition must use a seq scan) is only slightly longer. If nothing else, scanning through 14GB of data should be 3 times slower than scanning through 3GB of data. ------- Rajarshi Guha

Re: [GENERAL] keeping an index in memory

On Oct 21, 2007, at 12:56 PM, Gregory Stark wrote: "Rajarshi Guha" <[EMAIL PROTECTED]> writes: The table itself is about 10M rows corresponding to 14GB. Each row is on average 1.4kB ? Yes, though some rows may 10's of Kb Perhaps you should send more details of the

[GENERAL] looping over the rows in a table

side, so that I can loop over all the rows in the table? Thanks, --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE -

[GENERAL] PL/pgsql function handle CUBE values

Any pointers would be appreciated. --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE --- "355/113 -- Not the famous irra

Re: [GENERAL] PL/pgsql function handle CUBE values

On Jan 16, 2008, at 3:41 PM, Colin Wetherbee wrote: Rajarshi Guha wrote: Hi, I am trying to write a PL/pgsql function that will take a CUBE variable (which will be a 1D point) and a double precision variable. If the input CUBE is defined as '(x,y,z)'::cube the function would the

[GENERAL] a SQL query question

. So I'd end up with aid pid nmol - --- --- 323 100 245 3445 478 12 I can easily do the first step, but am struggling to make the SQL for the second step. Any pointers would be appreciated - -

Re: [GENERAL] a SQL query question

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On Jul 28, 2008, at 10:18 PM, Rajarshi Guha wrote: aid pid nmol - --- --- 323 100 245 3445 478 12 I can easily do the first step, but am struggling to make the SQL for the second step. Any pointers would be appreciated

[GENERAL] is a 'pairwise' possible / feasible in SQL?

I could construct a single SQL statement to do this. Any pointers would be appreciated, Thanks, - --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: D070 5427 CC5B 7938 929C DD13 66A1

Re: [GENERAL] is a 'pairwise' possible / feasible in SQL?

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On Aug 4, 2008, at 4:55 PM, Francisco Reyes wrote: On 2:08 pm 08/04/08 Rajarshi Guha <[EMAIL PROTECTED]> wrote: paircount - - 123 & 456 1 667 & 879 2 select a.cid as ac, b.cid as bc, count(*) from

[GENERAL] GiST indices and statistical approximations

arious forms of statistical approximation over large data sets. """ Could anybody provide pointers to papers or online pages that discuss the use of GiST indexes for statistical approximations? Thanks, - --- Rajarshi

[GENERAL] dumping 8M bit fields

sed since I did an equivalent query but selecting varchar field for 6.9M rows which worked fine. The machine is a 4-cpu Opteron machine, 16GB RAM. Does anybody know why this might be the case? Thanks, --- Rajarshi Guha <[EMA

[GENERAL] indexing for query speed - index row size exceeding btree maximum

an be reduced? Thanks, ------- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE --- A method of solution is perfe

[GENERAL] suggestions on improving a query

subset of dockscore_plp, rather than the whole table. Is it possible to restructure the query such that the sort is done on 96K rows rather than 4.6M rows? Thanks, --- Rajar

Re: [GENERAL] suggestions on improving a query

On Tue, 2007-02-13 at 21:44 -0500, Tom Lane wrote: > Rajarshi Guha <[EMAIL PROTECTED]> writes: > > However the clause: > > dock.target = '1YC1' and > > dock.dockid = dockscore_plp.id > > reduces the number of rows from 4.6M to 96K. &g

Re: [GENERAL] suggestions on improving a query

there are 4 more tables like dockscore_plp, and I would have to add a cid column to each of them - which seems redundant. Is it useful to increase redundancy to improve performance? Thanks for the pointers, --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7

Re: [GENERAL] suggestions on improving a query

On Wed, 2007-02-14 at 10:55 -0500, Tom Lane wrote: > Rajarshi Guha <[EMAIL PROTECTED]> writes: > > Clearly a big improvement in performance. > > Huh? It looks like exactly the same plan as before. Any improvement > you're seeing must be coming from cache effect

[GENERAL] passing an array type to a plpython procedure

12.0) ' language plpythonu; Ubuntu 6.10 Postgresql 7.4 Thanks, ------- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87 56EE

[GENERAL] indexing array columns

s I need Manhattan distances. What type of indexing, available in Postgres could be used for my problem? Would it require me to implement my own indexing scheme? Any pointers would be appreciated Thanks, --- Rajarshi Guha <[

[GENERAL] getting around 'out of memory' errors

by row. Any pointers would be greatly appreciated. The machine I'm running on has 16GB of RAM and I'm running PostgreSQL 7.4.13 on RedHat Enterprise Linux Thanks, --- Rajarshi Guha <[EMAIL PROTECTED]> GPG Fingerprint: 0CCA 8EE2 2EEB 25E2 AB04 06F7 1BB9 E634 9B87

Re: [GENERAL] getting around 'out of memory' errors

On Thu, 2006-08-24 at 10:50 -0400, Tom Lane wrote: > Rajarshi Guha <[EMAIL PROTECTED]> writes: > > I have a table, A with 15 fields, out of which I am interested in 2 > > fields, a and b. The table has 8,000,000 rows > > > I have another table, B, which has 3 f

Re: [GENERAL] getting around 'out of memory' errors

On Thu, 2006-08-24 at 14:12 -0400, Tom Lane wrote: > Rajarshi Guha <[EMAIL PROTECTED]> writes: > > On Thu, 2006-08-24 at 10:50 -0400, Tom Lane wrote: > >> I think you are getting burnt by the list of pending trigger actions > >> to check the foreign-key refer