who
would let us "play" with a couple of systems to see what would be an
applicable purchase?
Thanks!
--
Anthony
--
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance
Hmm ... I'm guessing you'd do it with a shortcut, and then rename the
ShortCut from "Shortcut to pg_xlog" to "pg_xlog".
Haven't done it with PostgreSQL, but it works with a few other programs
I've had to do that with.
--
Anthony Presley
Resolution Softw
and i
wasn't supprised to find that at least 6 of the 8 processors were idle.
The point is, for this type client, you are better off spending the
money on the fastest single or dual core processors than a multiway box.
Anthony.
Juan Casero (FL FLC) wrote:
Greetings -
I
am tes
Can any one explain why the following query
select f(q) from
(
select * from times
where '2006-03-01 00:00:00'<=q and q<'2006-03-08 00:00:00'
order by q
) v;
never completes, but splitting up the time span into single days does work.
select f(q) from
(
select * from times
where '
I'm curious if anyone can back this up or debunk it. It's about
the polar opposite of everything I've heard from every other database
vendor for the past several years, and would be quite an eye-opener for
me.
Anyone?
Thanks.
--
Anthony
---(end o
om 'p1' to 'GIL' would go from an
Index Scan to a Sequential?
[There is an index on os_currentstep, and it was vacuum analyze'd
recently.]
Running version 7.4 (working on upgrading to 8.0 soon). Thanks!
--
Anthony
---(end of broadc
values, in the owner, I get an Index Scan:
'p1', 'p2', '2300', '8088', 'CHANGEINVENTION'
The os_currentstep table has about 119,700 rows in it -- and I can't do
too much to actually change the query, since it's coming from somethi
to be a bother!
--
Anthony
On Fri, 2006-09-22 at 18:58 -0500, Anthony Presley wrote:
> I thought this was related to the TYPE (ie, I could cast it using
> something like: attr1=1::int8). However, I tried a few more values, and
> the query planner is confusing me.
>
> With these
ombinations in under 1 or
2 seconds.
(Of course, you still need to store the results, and feed the input,
using a database of some kind).
--
Anthony Presley
On Tue, 2009-06-16 at 14:35 -0400, Hartman, Matthew wrote:
> Good afternoon.
>
> I have developed an application to efficiently s
graphs / reports that we're doing need to only use one type
of data at a time, but several will need to stitch / combine data from
multiple data tables.
These combined with some new processors, and a fast RAID-10 system
should give us what we need going forward.
Thanks again!
--
Anthony
--
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance
loops=1)
-> Index Scan using tdiag_pkey on tdiag (cost=0.00..19114765.76
rows=1141019 width=114)
(actual time=90344.380..90344.380 rows=1 loops=1)
Filter: ((create_time >= '2011-06-03 19:49:04+10'::timestamp with
time zone) AND
(create_time < '2011-06-06 19
(cost=0.00..19114765.76
rows=1141019 width=114)
(actual time=90344.380..90344.380 rows=1 loops=1)
Filter: ((create_time >= '2011-06-03 19:49:04+10'::timestamp with
time zone) AND
(create_time < '2011-06-06 19:59:04+10'::timestamp with time zone))
Total
gt; sort" to "quick sort"). Try something like work_mem=20MB and see if it
> does the trick.
This certainly speeds up the sorting.
>
> regards
> Tomas
--
Anthony Shipman | What most people think about
anthony.ship...@symstream.com | most things is mostly wrong.
--
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance
execute 'create temporary table tt on commit drop as ' ||
'select diag_id from tdiag ' || v_where;
query = 'select * from tdiag where diag_id in (select * from tt) ' ||
'order by diag_id ' || v_limit || ' ' || v_o
On Wednesday 08 June 2011 18:39, Pavel Stehule wrote:
> if you use FOR statement, there should be a problem in using a
> implicit cursor - try to set a GUC cursor_tuple_fraction to 1.0.
Alas this is mammoth replicator, equivalent to PG 8.3 and it doesn't have that
parameter.
--
Anth
ext |
tag | character varying| not null default ''::character
varying
Indexes:
"tdiag_pkey" PRIMARY KEY, btree (diag_id)
"tdiag_create_time" btree (create_time)
--
Anthony Shipman | Programming is like sex: One
On Thursday 09 June 2011 16:04, anthony.ship...@symstream.com wrote:
> I must be doing something really wrong to get this to happen:
Yes I did. Ignore that.
--
Anthony Shipman | flailover systems: When one goes down it
anthony.ship...@symstream.com | flails about until
ary key to (diag_id, create_time) would simple queries on
diag_id still work well i.e.
select * from tdiag where diag_id = 1234;
--
Anthony Shipman | -module(erlang).
anthony.ship...@symstream.com | ''(_)->0. %-)
--
Sent via pgsql-performance mailing list (pg
and you have to buy their
version of the software to use?
I'm fine with piecing together a few different OS projects, but would prefer
to not modify the app too much.
Thanks!
--
Anthony Presley
old hardware.
I was really hoping that with hardware RAID that something would be faster
(loading times, queries, etc...). What am I doing wrong?
About the only thing left that I know to try is to drop the RAID1+0 and go
to RAID0 in hardware, and do RAID1 in software. Any other thoughts?
Thanks!
--
Anthony
On Sun, Sep 11, 2011 at 6:17 PM, Tomas Vondra wrote:
> Dne 12.9.2011 00:44, Anthony Presley napsal(a):
> > We've currently got PG 8.4.4 running on a whitebox hardware set up,
> > with (2) 5410 Xeon's, and 16GB of RAM. It's also got (4) 7200RPM
> > SATA driv
Mark,
On Sun, Sep 11, 2011 at 10:10 PM, mark wrote:
>
>
> >From: pgsql-performance-ow...@postgresql.org
> [mailto:pgsql-performance-ow...@postgresql.org] On Behalf Of Anthony
> Presley
> >Sent: Sunday, September 11, 2011 4:45 PM
> >To: pgsql-performance@postgresql.
cached.
Both of these servers have the same indexes, and almost identical data.
However, the old server is doing some different planning than the new
server.
What did I switch (or should I unswitch)?
--
Anthony
On Sun, Sep 11, 2011 at 9:12 PM, Alan Hodgson wrote:
> On September 11, 2011 03:4
You may want to try pgreplay ... we've tried it for a similar scenario, and
so far, it's pretty promising.
I do wish it was able to be loaded from a pgfouine formatted log file, or
from another db ... but that's OK.
--
Anthony Presley
On Mon, Sep 12, 2011 at 6:28 PM, Hany ABO
checkpoint_segments = 30 (have tried 200 when I was loading the db)
random_page_cost = 2.5
effective_cache_size = 10240MB (have tried as high as 16GB)
If I disable the hashjoin, I get massive improvements on PG 9.x ... as fast
(or faster) than our PG 8.4 instance.
--
Anthony Presley
On Tue, Sep 13, 2011 at 1:22 AM, Arjen van der Meijden <
acmmail...@tweakers.net> wrote:
>
> On 12-9-2011 0:44 Anthony Presley wrote:
>
>> A few weeks back, we purchased two refurb'd HP DL360's G5's, and were
>> hoping to set them up with PG 9.0.2, runn
: ((classification)::text = 'cdr'::text)
-> Bitmap Index Scan on tevent_cdr_timestamp
(cost=0.00..57.31 rows=2477 width=0) (actual time=0.404..0.404 rows=2480
loops=1)
Index Cond: (("timestamp" >= '2011-09-09
22:00:00+10'::timestamp w
ntages
of b-tree indexes described in the section "Indexes and ORDER BY" of the
manual. If I do "set enable_bitmapscan = off;" the query runs a bit faster
although with a larger time range it reverts to a sequential scan.
--
Anthony Shipman | Consider the set
The query that I've shown is one of a sequence of queries with the timestamp
range progressing in steps of 1 hour through the timestamp range. All I want
PG to do is find the range in the index, find the matching records in the
table and return them. All of the planner's cleverness jus
t found them
to be faster than reading in slices, in the tests I've done.
Anyway at the moment it is fast enough.
Thanks
--
Anthony Shipman | It's caches all the way
anthony.ship...@symstream.com | down.
--
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance
lower. We've
checked the query results (they are identical) to make sure we're not
missing any data.
--
Anthony
On Sat, Oct 22, 2011 at 10:58 AM, Tom Lane wrote:
> Anthony Presley writes:
> > We have a dev machine running 9.0.1 (an i3 laptop, with a regular hard
> disk,
> > with 4GB of RAM, and a mostly untuned postgresql.conf file). The changed
> > lines are:
>
r 6
columns would be redundant. Again, many of the columns might be empty.
... From a space / size perspective, which option is a better choice?
How does PostgreSQL handle storing empty columns?
Thanks!
--
Anthony
HI, If you dont vaccum the table, You can read data modified with
pg_dirtyread extension, but be carefull ;-)
https://github.com/omniti-labs/pgtreats/tree/master/contrib/pg_dirtyread
Regards
On 07/06/17 07:33, Dinesh Chandra 12108 wrote:
Dear Expert,
Is there any way to rollback table data i
Hi Daulat
This is not the list for that (check https://www.postgresql.org/list/),
but if you want to access sql server look at tds_fdw(
https://github.com/tds-fdw/tds_fdw), I do not know if it installs on
windows, I've only used it on linux, and function very well.
Regards
Anthony
Hi Sumeet Shukla
While script is running check the pg_stat_activity, this view can be util
Regards
Anthony
On 01/08/17 10:16, Keith wrote:
On Tue, Aug 1, 2017 at 9:41 AM, Sumeet Shukla
mailto:sumeet.k.shu...@gmail.com>> wrote:
Hi,
I have 2 PG servers with same h
Hi Neto, maybe HypoPG
Can help you:
https://github.com/dalibo/hypopg
El 31 oct. 2017 2:13 PM, "Neto pr" escribió:
>
> Hello All I'm researching on Index-Advisor Tools to be applied in SQL
> queries. At first I found this: - EnterpriseDB -
> https://www.enterprisedb.com/docs/en/9.5/asguide/EDB_
37 matches
Mail list logo
