On Sun, 2007-02-09 at 13:04 -0500, Kenneth Marshall wrote:
2. Evaluate the performance of different hash index implementations
and/or changes to the current implementation. My current plan is
to keep the implementation as simple as possible and still provide
the desired performance.
I'm running Vista x64 and while I can successfully install PG, I
can't seem to get PL/JAVA installed. The installer doesn't recognize
that I have a JRE installed (I do) and the option is grayed out
during installation.
So a couple of questions:
1) Should PL/JAVA be able to be installed on
Hi,
apoc9009 wrote:
Thadt is Replication NOT Backup
I've now read all of your messages in this thread, but I simply fail to
understand why you are that much opposed to the term 'replication'. I
think the only thing which comes any close to what you're looking for is
replication (in
backup is not replication.
but replicated database can be treated as good source of backup.
please take following remarks:
1) in English you don't capitalize nouns
2) read what other people write to you and try to understand that.
3) this is open source, try to be more cooperative not just cry
I think we need to build up a library of autogenerated queries, so we
can do things which address multiple use cases. Can you tell us more
about who/what generated it, so we can research?
Sorry, I can't publish a lot of information, that is on of the biggest russian
software company, it
apoc9009 wrote:
Write it down 100 times and maybe you understand
If you are going to be rude nobody will bother to respond to you.
Acknowledged experts have been very patient with you so far in this
thread. You should be appreciative, not truculent.
cheers
andrew
On Fri, Sep 07, 2007 at 09:50:07AM -0400, Mark Mielke wrote:
Kenneth Marshall wrote:
On Thu, Sep 06, 2007 at 11:56:25PM -0700, Neil Conway wrote:
You might find this patch useful:
http://archives.postgresql.org/pgsql-patches/2005-05/msg00164.php
...
Unfortunately, the patch doesn't
Markus Schiltknecht wrote:
[2]: Terms and Definitions of Database Replication
http://www.postgres-r.org/documentation/terms
Markus, the links in the left side menu are broken on the about and
documentation page. They point to http://www.postgres-r.org/overview
instead of
Kenneth Marshall wrote:
On Thu, Sep 06, 2007 at 11:56:25PM -0700, Neil Conway wrote:
You might find this patch useful:
http://archives.postgresql.org/pgsql-patches/2005-05/msg00164.php
...
Unfortunately, the patch doesn't apply cleanly to HEAD, but I can merge
it up to HEAD if you'd
Markus Schiltknecht schrieb:
Hi,
apoc9009 wrote:
Thadt is Replication NOT Backup
I've now read all of your messages in this thread, but I simply fail
to understand why you are that much opposed to the term 'replication'.
I think the only thing which comes any close to what you're looking
On Fri, Sep 07, 2007 at 12:55:37PM +0100, Heikki Linnakangas wrote:
Neil Conway wrote:
You might find this patch useful:
http://archives.postgresql.org/pgsql-patches/2005-05/msg00164.php
Oh, I had forgot about that.
It implements the just store the hash in the index idea; it
On Thu, Sep 06, 2007 at 11:56:25PM -0700, Neil Conway wrote:
On Sun, 2007-02-09 at 13:04 -0500, Kenneth Marshall wrote:
2. Evaluate the performance of different hash index implementations
and/or changes to the current implementation. My current plan is
to keep the implementation as
Ühel kenal päeval, R, 2007-09-07 kell 12:03, kirjutas apoc9009:
Andrew Sullivan schrieb:
It seems that what you want is near-real-time online backups with _no
cost_, which is not a feature that I think anyone will ever work on.
A
100% Correct!
I think anyone commit the Statement,
Ühel kenal päeval, R, 2007-09-07 kell 12:20, kirjutas apoc9009:
Trevor Talbot schrieb:
Backup 12/24/2008 Version 2
/pg/backup/12_24_2008/base/rcvry.rcv--- Basebackup
/pg/backup/12_24_2008/changes/0001.chg --- Changed Data
/changes/0002.chg --- Changed Data
Neil Conway wrote:
You might find this patch useful:
http://archives.postgresql.org/pgsql-patches/2005-05/msg00164.php
Oh, I had forgot about that.
It implements the just store the hash in the index idea; it also sorts
the entries in a bucket by the hash value, which allows binary
On Thu, Sep 06, 2007 at 11:56:25PM -0700, Neil Conway wrote:
On Sun, 2007-02-09 at 13:04 -0500, Kenneth Marshall wrote:
2. Evaluate the performance of different hash index implementations
and/or changes to the current implementation. My current plan is
to keep the implementation as
Kenneth Marshall wrote:
I understand that a hash value is a many-to-one mapping. That is the
point of the flag in the index. The flag means that there is only one
item in the heap corresponding to that hash value. In this case we
know that the value in the heap is the correct one and a possibly
On Fri, Sep 07, 2007 at 10:36:41AM -0400, Brian Hurt wrote:
Kenneth Marshall wrote:
I understand that a hash value is a many-to-one mapping. That is the
point of the flag in the index. The flag means that there is only one
item in the heap corresponding to that hash value. In this case we
Hi,
apoc9009 wrote:
Translation for you:
A Backup is a File or Set of Files thadt contains the Data of your
Business critical Informations.
It should not be Archived on the same place, the same House or the same
Room.
I disagree, a backup does not necessarily have to be a single file or a
On Fri, Sep 07, 2007 at 11:08:13AM -0400, Brian Hurt wrote:
Kenneth Marshall wrote:
How likely is it that you will get a hash collision, two strings that are
different that will hash to the same value? To avoid this requires a
very large hash key (128 bits, minimum)- otherwise you
Hi,
I'm asking for advice and hints regarding terms in database replication,
especially WRT Postgres-R. (Sorry for crossposting, but I fear not
reaching enough people on the Postgres-R ML alone)
I'm struggling on how to classify the Postgres-R algorithm. Up until
recently, most people
Filip Rembiałkowski schrieb:
please take following remarks:
thx, but if i need some advice form a scandinavian dickhead then i will
let you know this
---(end of broadcast)---
TIP 5: don't forget to increase your free space map settings
On Fri, Sep 07, 2007 at 10:30:30AM -0400, Mark Mielke wrote:
Kenneth Marshall wrote:
I understand that a hash value is a many-to-one mapping. That is the
point of the flag in the index. The flag means that there is only one
item in the heap corresponding to that hash value. In this case we
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
apoc9009 wrote:
Filip Rembiałkowski schrieb:
please take following remarks:
thx, but if i need some advice form a scandinavian dickhead then i will
let you know this
This is not acceptable on our lists. Do not post in such a way again.
apoc9009 wrote:
Filip Rembiałkowski schrieb:
please take following remarks:
thx, but if i need some advice form a scandinavian dickhead then i will
let you know this
That kind of remark is not acceptable on the PostgreSQL mailing lists.
Please do not post here again unless you can speak to
Kenneth Marshall wrote:
How likely is it that you will get a hash collision, two strings that are
different that will hash to the same value? To avoid this requires a very
large hash key (128 bits, minimum)- otherwise you get into birthday attack
problems. With a 32-bit hash, the
Heikki Linnakangas [EMAIL PROTECTED] writes:
Since that interface documentation has been copied to the manual,
gin.sgml, section 52.2, which is up to date, how about we just remove it
from the README?
+1 ... README files should not duplicate info that's in the SGML docs.
Since that interface documentation has been copied to the manual,
gin.sgml, section 52.2, which is up to date, how about we just remove it
from the README?
Agreed
--
Teodor Sigaev E-mail: [EMAIL PROTECTED]
WWW:
Kenneth Marshall wrote:
I understand that a hash value is a many-to-one mapping. That is the
point of the flag in the index. The flag means that there is only one
item in the heap corresponding to that hash value. In this case we
know that the value in the heap is the correct one and a possibly
On Fri, 2007-09-07 at 11:48 -0400, Greg Smith wrote:
On Fri, 7 Sep 2007, Simon Riggs wrote:
I think that is what we should be measuring, perhaps in a simple way
such as calculating the 90th percentile of the response time
distribution.
I do track the 90th percentile numbers, but in
On Fri, Sep 07, 2007 at 12:03:31PM +0200, apoc9009 wrote:
Andrew Sullivan schrieb:
It seems that what you want is near-real-time online backups with _no
cost_, which is not a feature that I think anyone will ever work on.
A
100% Correct!
I think anyone commit the Statement, thadt a
On Wed, 2007-09-05 at 23:31 -0400, Greg Smith wrote:
Tom gets credit for naming the attached patch, which is my latest attempt to
finalize what has been called the Automatic adjustment of
bgwriter_lru_maxpages patch for 8.3; that's not what it does anymore but
that's where it started.
1. Sort the stopword lists in the main distribution
2. Require them to be sorted
3. Remove the sort from readstoplist()
I don't believe that will a big win in performance - lists are rather small. And
it needed to add check of sorting
--
Teodor Sigaev
Phil wrote:
1) Should PL/JAVA be able to be installed on Vista x64 or is there some
known issue? What environment variables should be set, and how should I
set them for a JRE vs. JDK installation?
Sorry - don't know.
2) Where is the source code for the Windows installer? I've tried fairly
Simon Riggs wrote:
On Fri, 2007-09-07 at 06:36 +0200, Florian G. Pflug wrote:
Tom Lane wrote:
Florian G. Pflug [EMAIL PROTECTED] writes:
- I actually think with just a little bit of more work, we
can go even further, and get rid of the ReadNewTransactionId() call
completely during
On Wednesday 05 September 2007 12:01, Tom Lane wrote:
Robert Treat [EMAIL PROTECTED] writes:
On Wednesday 05 September 2007 00:06, Tom Lane wrote:
BTW, on re-reading that, it seems a tad surprising to get an error right
there --- if postgres_fe.h or anything it includes were broken, then
On Fri, 7 Sep 2007, Simon Riggs wrote:
I think that is what we should be measuring, perhaps in a simple way
such as calculating the 90th percentile of the response time
distribution.
I do track the 90th percentile numbers, but in these pgbench tests where
I'm writing as fast as possible
On Fri, 2007-09-07 at 06:36 +0200, Florian G. Pflug wrote:
Tom Lane wrote:
Florian G. Pflug [EMAIL PROTECTED] writes:
So I believe you're right, and we can skip taking the lock in the no
xid case
Sounds good.
- I actually think with just a little bit of more work, we
can go even
2007/9/6, Simon Riggs [EMAIL PROTECTED]:
The query formulation does seem a fairly common one.
First query:
explain analyze
select *
from
a
left outer join (
select b.id, sum(b.val)
from b
group by b.id
) bagg
on bagg.id =
access/gin/README describes the Gin interface, but it hasn't been
updated since the change to extractQuery interface to allow no query
can match return value.
Since that interface documentation has been copied to the manual,
gin.sgml, section 52.2, which is up to date, how about we just remove it
On Fri, 7 Sep 2007, Simon Riggs wrote:
I think we should do some more basic tests to see where those outliers
come from. We need to establish a clear link between number of dirty
writes and response time.
With the test I'm running, which is specifically designed to aggrevate
this behavior,
On Thu, Sep 06, 2007 at 01:08:59PM -0500, Kenneth Marshall wrote:
Since we already have to check the actual tuple values for any index
lookup in postgresql, we could only store the full hash value and the
corresponding TIDs in the bucket. Then when we lookup an item by
calculating its hash, if
Florian G. Pflug [EMAIL PROTECTED] writes:
Why would it? The idea was to remember the largest committed xid, and that
won't go away just because the proc array is rather empty xid-wise.
I hadn't fully absorbed this idea last night, but now that I have, I'm
starting to think it's a good one.
Robert Treat wrote:
On Wednesday 05 September 2007 12:01, Tom Lane wrote:
Robert Treat [EMAIL PROTECTED] writes:
On Wednesday 05 September 2007 00:06, Tom Lane wrote:
BTW, on re-reading that, it seems a tad surprising to get an error right
there --- if postgres_fe.h or
Trevor Talbot schrieb:
Backup 12/24/2008 Version 2
/pg/backup/12_24_2008/base/rcvry.rcv--- Basebackup
/pg/backup/12_24_2008/changes/0001.chg --- Changed Data
/changes/0002.chg --- Changed Data
/changes/0003.chg --- Changed Data
Andrew Sullivan schrieb:
It seems that what you want is near-real-time online backups with _no
cost_, which is not a feature that I think anyone will ever work on.
A
100% Correct!
I think anyone commit the Statement, thadt a Databases is a very
imported Part of Software
for a wide range of
I notice we sort the stop word list after we read it into memory.
Wouldn't it be easier to
1. Sort the stopword lists in the main distribution
2. Require them to be sorted
3. Remove the sort from readstoplist()
We should at very least do (1) to improve the sort speed at start.
--
Simon
Simon Riggs [EMAIL PROTECTED] writes:
I notice we sort the stop word list after we read it into memory.
I see nothing wrong with that; it only happens once per backend session,
and it makes maintenance of the files easier.
regards, tom lane
Hello
last time I checked utf8 database. Now I checked latin2 encoding
database. I used dictionaries from last test.
client_encoding | utf8
lc_collate | cs_CZ.iso-8859-2
lc_ctype| cs_CZ.iso-8859-2
lc_messages |
Tom Lane wrote:
I've spent the past hour or so trying to consolidate the comments in
GetSnapshotData and related places into a single chunk of text to be
added to src/backend/access/transam/README. Attached is what I have so
far --- this incorporates the idea of not taking ProcArrayLock to exit
Florian G. Pflug [EMAIL PROTECTED] writes:
Tom Lane wrote:
Here is another variant of the risk scenario:
1. Xact A is running (in Read Committed mode).
2. Xact C's GetSnapshotData reads next transaction ID into xmax, then is
swapped out before it can acquire ProcArrayLock.
3. Xact B gets
On Wed, Sep 05, 2007 at 03:27:50PM -0400, Tom Lane wrote:
Decibel! [EMAIL PROTECTED] writes:
While this is correct on a per-relation level, I'm thinking that it's
not what we'd really like to have happen in psql. What I'd like \d to do
is show me everything in any schema that's in my
Be forewarned - this is probably a very long post, and I'm just a mere
mortal (ie. admin) who doesn't write copious amounts of C code. Take
the following posts and suggestions with a grain of salt.
So I've been seeing/hearing all of the hoopla over vertical databases
(column stores), and how
Avery,
Make one small, very tiny syntactic change to CREATE TABLE that
includes a new keyword, COLUMN-STORE or something similar.
If someone writes the rest of the code, I doubt the syntax will be the
holdup. But writing an efficient C-store table mechanism is much harder
than I think you
Pavel Stehule wrote:
postgres=# select ts_debug('cs','Příliš žluťoučký kůň se napil žluté vody');
ERROR: character 0xc3a5 of encoding UTF8 has no equivalent in LATIN2
CONTEXT: SQL function ts_debug statement 1
I can reproduce that. In fact, you don't need the custom config or
dictionary at
Just wondering if it is already in 8.3 with a new name, or if not if there are
plans to add it? TIA
--
Robert Treat
Build A Brighter LAMP :: Linux Apache {middleware} PostgreSQL
---(end of broadcast)---
TIP 1: if posting/reading through Usenet,
In hindsight, I did miss quite a bit in my last post. Here's a summary
that might clear it up:
Add a single keyword that specifies that the storage format changes
slightly. The keyword should not affect SQL compliancy while still
extending functionality. It can be specified as either part
Ühel kenal päeval, R, 2007-09-07 kell 16:41, kirjutas apoc9009:
Filip Rembiałkowski schrieb:
please take following remarks:
thx, but if i need some advice form a scandinavian dickhead then i will
let you know this
Is this apoc9009 guy real ?
For some time I honestly believed (based in part
Here's some revised text for the README file, based on using Florian's
idea of a global latestCompletedXid variable. As I worked through it
I realized that in this design, XidGenLock gates entry of new XIDs into
the ProcArray while ProcArrayLock gates their removal. Which is an
interesting sort
Avery,
my ramblings snipped
If someone writes the rest of the code, I doubt the syntax will be the
holdup. But writing an efficient C-store table mechanism is much harder
than I think you think it is; Vertica worked on it for a year and failed,
and Paraccel took two years to succeed.
Tom Lane wrote:
Here's some revised text for the README file, based on using Florian's idea
of a global latestCompletedXid variable. As I worked through it I realized
that in this design, XidGenLock gates entry of new XIDs into the ProcArray
while ProcArrayLock gates their removal. Which is
Florian G. Pflug [EMAIL PROTECTED] writes:
I noticed two rather cosmetic issues
.) latestCompletedXid sounds as it might refer to the *last* completed xid,
but it actually refers to the largest / highest completed xid. So maybe we
should call it highestCompletedXid or largestCompletedXid.
On 9/7/07, Avery Payne [EMAIL PROTECTED] wrote:
Avery,
my ramblings snipped
If someone writes the rest of the code, I doubt the syntax will be the
holdup. But writing an efficient C-store table mechanism is much harder
than I think you think it is; Vertica worked on it for a year and
Robert Treat [EMAIL PROTECTED] writes:
Just wondering if it is already in 8.3 with a new name, or if not if there
are
plans to add it? TIA
tsvector_update_trigger(), see docs section 9.13.2 (at the moment)
regards, tom lane
---(end of
On Fri, Sep 07, 2007 at 02:58:03PM -0700, Avery Payne wrote:
In hindsight, I did miss quite a bit in my last post. Here's a summary
that might clear it up:
Add a single keyword that specifies that the storage format changes
slightly. The keyword should not affect SQL compliancy while
On Sat, Sep 08, 2007 at 01:02:04AM +0300, Hannu Krosing wrote:
??hel kenal p??eval, R, 2007-09-07 kell 16:41, kirjutas apoc9009:
Filip Rembia??kowski schrieb:
please take following remarks:
thx, but if i need some advice form a scandinavian dickhead then i will
let you know this
Is
On my x86_64 machine, CVS HEAD is throwing the following scary-looking
warnings:
to_tsany.c: In function 'pushval_morph':
to_tsany.c:247: warning: cast from pointer to integer of different size
to_tsany.c: In function 'to_tsquery_byid':
to_tsany.c:306: warning: cast to pointer from integer of
I wrote:
Whether the code is actually safe or not, these [warnings] are not acceptable.
On looking closer, it seems the intent is to pass an argument of
unspecified type through parse_tsquery to a PushFunction:
typedef void (*PushFunction)(void *opaque, TSQueryParserState state, char *,
int,
68 matches
Mail list logo
