Christopher Browne kirjutas E, 03.11.2003 kell 15:22:
Can't one just run a _separate_ VACUUM on those smaller tables ?
Yes, but that defeats the purpose of having a daemon that tries to
manage this all for you.
If a dumb deamon can't do its work well, we need smarter daemons ;)
Neil Conway kirjutas E, 03.11.2003 kell 18:59:
On Mon, 2003-11-03 at 11:11, Tom Lane wrote:
Why not? The advice says that you're going to access the data
sequentially in the forward direction. If you're not going to back up,
there is no point in keeping pages in cache after they've been
Ryan Mahoney kirjutas N, 06.11.2003 kell 23:03:
I am running PostgreSQL 7.3.1 on i686-pc-linux-gnu, compiled by GCC 2.96
the following query fails:
SELECT 'UPDATE pa_sales_lead SET details = COALESCE(details, \'\') ||
\'' || replace(data, '\'', '\'\'') || '\' WHERE foreign_sales_lead_id =
Alexey Mahotkin kirjutas K, 05.11.2003 kell 17:11:
Aha, that's in src/backend/utils/adt/formatting.c, right?
Yes, I see, it goes byte by byte and uses toupper(). I believe we
could look at the locale, and if it is UTF-8, then use (or copy)
e.g. g_utf8_strup/strdown, right?
Anthony W. Youngman kirjutas K, 05.11.2003 kell 01:15:
1) Your database might change over time and say a table that originally
had only a few rows
could suddenty grow considerably. Now an optimiser would insulate you
from these changes
or in the worst case all that would need to be done
Redirected to -hackers
Neil Conway kirjutas L, 15.11.2003 kell 22:20:
Tom Lane [EMAIL PROTECTED] writes:
(I believe the previous discussion also agreed that we wanted to
postpone the freezing of now(), which currently also happens at
BEGIN rather than the first command after BEGIN.)
Tom Lane kirjutas E, 17.11.2003 kell 02:08:
Neil Conway [EMAIL PROTECTED] writes:
Hmmm... I agree this behavior isn't ideal, although I can see the case
for viewing this as a mistake by the application developer: they are
assuming that they know exactly when transactions begin, which is not
Bruce Momjian kirjutas E, 17.11.2003 kell 02:31:
Defining now() as the first call seems pretty arbitrary to me. I can't
think of any time-based interface that has that API. And what if a
trigger called now() in an earlier query and you didn't even know about
it.
That would be OK. The whole
Andreas Pflug kirjutas K, 19.11.2003 kell 20:45:
Dave Cramer wrote:
Why should ALTER COLUMN change the column number, i.e. position?
Rod's current proposed patch does that if you do an alter column alter
type. This is an artifact of the underlying mechanism. (ren old col, add
new col,
Andreas Pflug kirjutas N, 20.11.2003 kell 01:38:
Second, column type changes needing a nontrivial cast function should be
implemented in a way that preserve attnum. This could be done like this:
- decompile dependent objects, and memorize them for later recreation
- ADD tmpCol, UPDATE
Andreas Pflug kirjutas N, 20.11.2003 kell 11:40:
Hannu Krosing wrote:
attnum is used internally to retrieve the data
Oops...
So if an additional column number is invented, it should not be a
logical column number, but a physical storage number for internal data
retrieval
Tom Lane kirjutas N, 20.11.2003 kell 17:18:
Oleg Bartunov [EMAIL PROTECTED] writes:
we have a patch for contrib/tsearch2 we'd like to commit for 7.4.1.
Is it ok ?
We added support for compound words using ispell dictionaries.
It's rather important feature for agglutinative languages
Zeugswetter Andreas SB SD kirjutas E, 24.11.2003 kell 13:16:
Main needs partitioning is useful for:
- partition elimination for queries (e.g. seq scans only scan relevant partitions)
- deleting/detaching huge parts of a table in seconds
- attaching huge parts to a table in seconds (that may
Dennis Bjorklund kirjutas T, 25.11.2003 kell 14:51:
On Tue, 25 Nov 2003, Tatsuo Ishii wrote:
I'm tired of telling that Unicode is not that perfect.
Of course not, but neither is the current multibyte with only marginal
support for unicode (many people actually need upper()/lower() )
Peter Eisentraut kirjutas T, 25.11.2003 kell 21:13:
Greg Stark writes:
This sounds like you want to completely reimplement all of the locale handling
provided by the OS? That seems like a dead-end approach to me. There's no way
your handling will ever be as complete or as well optimized
Andreas Pflug kirjutas K, 26.11.2003 kell 12:09:
ow wrote:
It appears there's not a lot of interest in discussing the possibility of FK
constraint creation WITHOUT the verification check. How then should one handle
the situation with pg_restore and large dbs where creation of FK
Jonathan Gardner kirjutas K, 26.11.2003 kell 19:03:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I apologize if this post is inappropriate.
Doing some development work, me and my co-worker discussed some
optimizations strategies. One of the ideas that came up was materialized
views.
Andreas Pflug kirjutas N, 20.11.2003 kell 16:10:
Hannu Krosing wrote:
You are just shifting the interface problems to a place needing way more
changes in the backend. There will be some problems either way.
Not quite. Certainly, basing internal storage on attstoragenum is more
Neil Conway kirjutas P, 30.11.2003 kell 02:18:
Jonathan Gardner [EMAIL PROTECTED] writes:
3) We would implement some sort of differential view update scheme
based on the paper Efficiently Updating Materialized Views[1].
Maybe the TelegraphCQ engine can give some ideas
Greg Stark kirjutas E, 01.12.2003 kell 18:15:
Separate OS partitions is a reasonable use of partitioned tables, but the
biggest advantage is being able to drop and load partitions very quickly, and
without impacting performance at all. loading or dropping millions of records
becomes a simple
Anand, VJ (MED, GEMS-IT) kirjutas K, 03.12.2003 kell 18:18:
Hello:
I am trying to find out, how is the B-tree index implemented for
multiple columns? does Postgres, just
concatenate the columns ---
Yes.
if this is the case, then how is the
search performed? Also, does
Greg Stark kirjutas N, 04.12.2003 kell 19:55:
I have an idea for what I think may be a very simple optimization for postgres
to make. I would like to try my hand at implementing it, but the last time I
tried I apparently started off in the wrong direction.
In the following query, the sort
Hannu Krosing kirjutas N, 04.12.2003 kell 23:01:
Where should I be looking in the code?
Try to find where the modified query is tested for. It's probably be
inside the optimizer, as index scan + no sort is not always faster than
seq scan + sort, as shown by the same query after vacuum
Andrew Dunstan kirjutas T, 09.12.2003 kell 22:07:
Dave Cramer wrote:
Have a look at Axion for a pure java db
http://axion.tigris.org/
Not as full featured,but still useful.
Er, I take it that not as full featured is an example of meiosis :-)
Here's what the web page says:
Teodor Sigaev kirjutas T, 09.12.2003 kell 23:07:
Urmo wrote:
Hi,
there seems to be no way of searching partial matches with tsearch.
Would it be hard to implement prefix based matching, i.e.
hu matches human, humanity, humming, huge? With some hacking I
managed to disable
Teodor Sigaev kirjutas K, 10.12.2003 kell 11:20:
Tsearch was never minded as prefix search, and index structure doesn't support
any kind of prefix or suffix. But you can write extension to tsearch, which will
search by prefix. But such solution wiil not use index, only sequence scan.
David Fetter kirjutas R, 12.12.2003 kell 20:13:
Kind people,
I'm looking to the SQL WITH clause as a way to get better regex
support in PostgreSQL. I've been chatting a little bit about this,
and here's an idea for a behavior. Implementation details TBD.
WITH res = match (x.foo,
David Fetter kirjutas L, 13.12.2003 kell 23:17:
On Sat, Dec 13, 2003 at 10:58:59PM +0200, Hannu Krosing wrote:
David Fetter kirjutas R, 12.12.2003 kell 20:13:
Kind people,
I'm looking to the SQL WITH clause as a way to get better regex
support in PostgreSQL. I've been chatting
Dann Corbit kirjutas T, 16.12.2003 kell 12:40:
I suspect if you do explain against the SQL of the view, the answer
will be apparent.
Donning my Karnak the magnificent hat {borrowed from Johnny Carson}:
You are missing an index.
For the best help, post the SQL of your view, and also the
Neil Conway kirjutas K, 17.12.2003 kell 00:37:
Andrew Dunstan [EMAIL PROTECTED] writes:
In normal operation the only thing that should be signalling a
backend is the postmaster.
Oh? What about LISTEN/NOTIFY?
IIRC cancelling queries is done by making a connection to a new backend
and then
Tom Lane kirjutas N, 18.12.2003 kell 00:27:
Robert Bedell [EMAIL PROTECTED] writes:
I'm curious if anyone has ever looked into adding OLAP functionality (per
the SQL99 specs) into PostGreSQL.
As a first project one could think of implementing NULLS FIRST/LAST
(from 4.14.9) for all ORDER BY
Robert Bedell kirjutas N, 18.12.2003 kell 01:02:
These are not simple projects, I know.
Might be a tad ambitious for your first venture into backend hacking...
I agree completely. I'm not purporting to jump in quite that quickly, but
it is something I would like to see added, and am
Robert Bedell kirjutas N, 18.12.2003 kell 01:55:
I guess that by adding hash aggregates Tom solved most problems of
adding ROLLUP, CUBE and GROUPING SETS.
OTOH, I'm not sure if hash aggregates can already spill to disk if not
enough memory is available for keeping them all. If not, then
Merlin Moncure kirjutas R, 09.01.2004 kell 22:04:
Peter Eisentraut wrote:
The central problem I have is this: How do we deal with the fact that
an XML datum carries its own encoding information?
Maybe I am misunderstanding your question, but IMO postgres should be
treating xml documents
Eric Ridge kirjutas R, 09.01.2004 kell 01:16:
Forgetting about composite indexes for a moment, is postgres even
capable of doing 2 index scans in this situation? Does it know how do
take the intersection of two scans?
Not currently, but it has been in TODO for quite some time:
* Use
Merlin Moncure kirjutas E, 12.01.2004 kell 19:56:
Hannu Krosing wrote:
IIRC, the charset transformations are done as a separate step in the
wire protocol _before_ any parser has chance transform or not.
Yep. My point is that this is wrong.
Of course :)
It seems to be a quick hack
Merlin Moncure kirjutas K, 14.01.2004 kell 15:49:
Hannu Krosing wrote:
I hope that real as-needed-column-by-column translation will be used
with bound argument queries.
It also seems possible to delegate the encoding changes to after the
query is parsed, but this will never work
Merlin Moncure kirjutas N, 15.01.2004 kell 18:43:
Hannu Krosing wrote:
select
'd/'::xml == '?xml version=1.0 encoding=utf-8?\nd/\n'::xml
Right: I understand your reasoning here. Here is the trick:
select '[...]'::xml introduces a casting step which justifies a
transformation
Brian Moore kirjutas P, 25.01.2004 kell 11:07:
hello,
this note is intended to describe my work on beginning to further
integrate xml into postgresql. first, i'd like to thank the
contributers of contrib/xml as their work was instrumental in helping
me understand what support exists and
IIRC none the patches that made online vacuuming less intrusive were
included in the released 7.4.
Where can I find the prefferred patch (preferrably the later one that
yields after vacuumin N pages) for 7.3.4 or 7.4 series.
I currently don't want any other fanciness that was tried as well.
Dennis Haney kirjutas T, 27.01.2004 kell 21:08:
Tom Lane wrote:
Dennis Haney [EMAIL PROTECTED] writes:
There is no constraint on the order of 'a', so why is pull_up_subqueries
explicitly ignoring subqueries that contain an 'order by'?
Because there would be no place to
Tom Lane kirjutas R, 30.01.2004 kell 16:48:
Bruce Momjian [EMAIL PROTECTED] writes:
Also, what does an in-memory bitmapped index look like?
One idea that might work: a binary search tree in which each node
represents a single page of the table, and contains a bit array with
one bit for
Peter Eisentraut kirjutas N, 29.01.2004 kell 19:31:
Andrew Dunstan wrote:
Peter: this looks very nice. What are your intentions with this code?
Once we figure out how to handle the on-the-wire character set recoding
when faced with XML documents (see separate thread a few weeks ago), I
Tom Lane kirjutas L, 31.01.2004 kell 01:02:
Hannu Krosing [EMAIL PROTECTED] writes:
Another idea would be using bitmaps where we have just one bit per
database page and do a seq scan but just over marked pages.
That seems a bit too lossy for me,
I originally thought of it in context
Robert Treat kirjutas K, 04.02.2004 kell 16:55:
Seems it has no chance of getting in as it is GPL'd code... so step one
would be convincing him to relicense it.
As a side note, I thought Joe Conway also had an implementation of
this...
IIRC Joe Conway had the simple join-by-parent-id
Tom Lane kirjutas K, 04.02.2004 kell 06:04:
Christopher Kings-Lynne [EMAIL PROTECTED] writes:
Wasn't there some guy at RedHat doing it?
Andrew Overholt did some work on SQL99 recursive queries, but went back
to university without having gotten to the point where it actually
worked. One of
Christopher Browne kirjutas K, 04.02.2004 kell 15:10:
The fact that the form of this resembles that of the Lisp/ML let
forms means that WITH can be useful in structuring queries as well.
For instance, supposing you're computing a value that gets used
several times, putting it into a WITH
Chad kirjutas R, 27.02.2004 kell 14:53:
Is it possible for Postgres Btrees to support access by logical row number ?
WHat do you mean by logical row number ?
Hannu
---(end of broadcast)---
TIP 7: don't forget to increase your free
Merlin Moncure kirjutas K, 10.03.2004 kell 17:00:
Bruce Momjian wrote:
I am timing small queries, and found that a PREPARE/EXECUTE of SELECT
1 takes about 1.2ms on my machine. A normal SELECT doesn't take much
longer, so I am wondering why a simpler query isn't faster.
Looking at
Josh Berkus kirjutas T, 09.03.2004 kell 19:46:
In my personal experience, the *primary* use of PITR is recovery from User
Error. For example, with one SQL Server 7.0 installation for a law firm,
I've made use of PITR 4 times over the last 4 years: once was because and HDD
failed, the
Shachar Shemesh kirjutas N, 22.04.2004 kell 19:49:
The BSD license, in contrast to PostgreSQL's, does NOT require me to
copy license related texts around, only the copyrights themselves. It
does pose certain restrictions on what I am allowed to do with the
copyrights, but any modern free
Shachar Shemesh kirjutas R, 23.04.2004 kell 07:53:
Tom Lane wrote:
Jeff Davis [EMAIL PROTECTED] writes:
Also, can you license code at all if it isn't yours? I would assume you
would have to make changes and license the changes you made, and
distribute it along with the
Bruce Momjian kirjutas T, 11.05.2004 kell 00:26:
Hannu Krosing wrote:
Bruce Momjian kirjutas E, 10.05.2004 kell 06:58:
Added to TODO:
* Add MERGE command that does UPDATE, or on failure, INSERT
perhaps the issue raised about BEFOR/AFTER INSERT/UPDATE TRIGGERS and
RULES should
Bruce Momjian kirjutas E, 10.05.2004 kell 06:58:
Added to TODO:
* Add MERGE command that does UPDATE, or on failure, INSERT
perhaps the issue raised about BEFOR/AFTER INSERT/UPDATE TRIGGERS and
RULES should get a mention in the TODO (... needs to be discussed, or
somesuch ...)
Bruce Momjian kirjutas P, 16.05.2004 kell 22:45:
Jan Wieck wrote:
We have ARC, the background writer and vacuum delay, and people even ask
me for backports of that (I have one for vacuum delay, but refuse to
make one for the others). How long do you want to delay that being ready
for
scott.marlowe kirjutas T, 27.04.2004 kell 20:43:
As someone who has discussed this with Tom in the past, I seem to remember
that there were major issues with handling the system catalogs, because
internally, the backends treat the identifiers as if they have already
been quoted.
why not
On Mon, 2002-09-23 at 18:41, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
Alvaro Herrera kirjutas E, 23.09.2002 kell 10:30:
The former drops f1 from c, while the latter does not. It's
inconsistent.
But this is what _should_ happen.
On what grounds do you claim that? I
On Wed, 2002-09-25 at 04:13, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
1)
create table p1 (f1 int, g1 int);
create table p2 (f1 int, h1 int);
create table c () inherits(p1, p2);
drop column p2.f1; -- this DROP is in fact implicitly ONLY
On Wed, 2002-09-25 at 04:33, Alvaro Herrera wrote:
Hannu Krosing dijo:
On Wed, 2002-09-25 at 04:13, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
1)
create table p1 (f1 int, g1 int);
create table p2 (f1 int, h1 int);
create table
Alvaro Herrera kirjutas K, 25.09.2002 kell 02:45:
Hannu Krosing dijo:
For me it feels assymmetric (unless we will make attislocal also int
instead of boolean ;). This assymetric nature will manifest itself when
we will have ADD COLUMN which can put back the DROP ONLY COLUMN and it
has
Tatsuo Ishii kirjutas N, 26.09.2002 kell 03:37:
The actual checking is done in INSERT/UPDATE/COPY. However, the
checking is currently very limited: every byte of a mutibyte character
must be greater than 0x7f.
Where can I read about basic tech details of Unicode / Charset
Conversion / ...
On Sun, 2002-09-29 at 07:19, Lamar Owen wrote:
On Saturday 28 September 2002 09:23 pm, Bruce Momjian wrote:
Justin Clift wrote:
Alvaro Herrera wrote:
I agree with Lamar that upgrading is a very difficult process right
As a simple for the user approach, would it be
On Sun, 2002-09-29 at 09:47, Tom Lane wrote:
Alvaro Herrera [EMAIL PROTECTED] writes:
What would that converter need:
[snip]
I think that should be enough for converting table files. I'd like to
experiment with something like this when I have some free time. Maybe
next year...
Tom Lane kirjutas P, 29.09.2002 kell 04:00:
Alvaro Herrera [EMAIL PROTECTED] writes:
I have this almost ready. The thing I don't have quite clear yet is
what to do with attislocal. IMHO it should not be touched in any case,
but Hannu thinks that for symmetry it should be reset in some
On Sun, 2002-09-29 at 19:57, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
I'd propose that ADD ONLY would pull topmost attislocal up (reset it
from the (grand)child) whereas plain ADD would leave attislocal alone.
ADD ONLY? There is no such animal as ADD ONLY, and cannot
On Sun, 2002-09-29 at 19:28, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
The initial Postgres design had a notion of StorageManager's, which
should make this very easy indeed, if it had been kept working .
But the storage manager interface was never built to hide issues like
On Tue, 2002-10-01 at 01:10, Bruce Momjian wrote:
Given what Tom has posted regarding the standard, I think Oracle
is wrong. I'm wondering how the others handle multiple
references in CURRENT_TIMESTAMP in a single stored
procedure/function invocation. It seems to me that the lower
On Tue, 2002-10-01 at 03:31, Tom Lane wrote:
Offhand this seems kinda inconsistent to me --- I'd expect
regression=# select extract(week from date '2002-09-30');
date_part
---
40
(1 row)
to produce 39, not 40, on the grounds that the first day of Week 40
is tomorrow
On Tue, 2002-10-01 at 03:49, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
On Tue, 2002-10-01 at 03:31, Tom Lane wrote:
I notice that 2001-12-31 is considered part of the first week of 2002,
which is also pretty surprising:
There are at least 3 different ways to start week
On Fri, 2002-10-04 at 01:00, Tom Lane wrote:
Bruce Momjian [EMAIL PROTECTED] writes:
Where are we with this patch?
It's done as far as I'm concerned ;-). Not sure if Hannu still wants
to argue that the behavior is wrong ... it seems fine to me though ...
I stop arguing for now, ONLY can
Bruce Momjian kirjutas L, 05.10.2002 kell 13:49:
Curtis Faith wrote:
Back-end servers would not issue fsync calls. They would simply block
waiting until the LogWriter had written their record to the disk, i.e.
until the sync'd block # was greater than the block that contained the
On Sat, 2002-10-05 at 20:32, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
The writer process should just issue a continuous stream of
aio_write()'s while there are any waiters and keep track which waiters
are safe to continue - thus no guessing of who's gonna commit
On Sun, 2002-10-06 at 04:03, Tom Lane wrote:
Hannu Krosing [EMAIL PROTECTED] writes:
Or its solution ;) as instead of the predicting we just write all data
in log that is ready to be written. If we postpone writing, there will
be hickups when we suddenly discover that we need to write
Tom Lane kirjutas E, 07.10.2002 kell 01:07:
To test this, I made a modified version of pgbench in which each
transaction consists of a simple
insert into table_NNN values(0);
where each client thread has a separate insertion target table.
This is about the simplest transaction I
On Tue, 2002-10-08 at 00:12, Curtis Faith wrote:
Tom, first of all, excellent job improving the current algorithm. I'm glad
you look at the WALCommitLock code.
This must be so because the backends that are
released at the end of any given disk revolution will not be able to
participate
On Tue, 2002-10-08 at 01:27, Tom Lane wrote:
The scheme we now have (with my recent patch) essentially says that the
commit delay seen by any one transaction is at most two disk rotations.
Unfortunately it's also at least one rotation :-(, except in the case
where there is no contention, ie,
Curtis Faith kirjutas T, 08.10.2002 kell 01:04:
I may be missing something obvious, but I don't see a way to get more
than 1 trx/process/revolution, as each previous transaction in that
process must be written to disk before the next can start, and the only
way it can be written to the
Karel Zak kirjutas K, 16.10.2002 kell 15:19:
Hi,
I have SQL query:
SELECT * FROM ii WHERE i1='a' AND i2='b';
There're indexes on i1 and i2. I know best solution is use one
index on both (i1, i2).
The EXPLAIN command show that optimalizer wants to use one index:
test=#
On Wed, 2002-10-16 at 23:08, Curtis Faith wrote:
Bruce Momjian wrote:
I tried to prepare as best I could before bringing anything forward to
HACKERS. In particular, I read the last two years of archives with anything
to do with the WAL log and looked at the current code, read the TODOs, read
Alvaro Herrera kirjutas L, 12.10.2002 kell 04:16:
On Fri, Oct 11, 2002 at 07:08:18PM -0700, Jeff Davis wrote:
And it really is a minor matter of convenience. I end up dropping and
recreating all my tables a lot in the early stages of development, which is
mildly annoying. Certainly not
On Thu, 2002-10-17 at 23:34, Teodor Sigaev wrote:
wow=# select 5.3::float;
ERROR: Bad float8 input format '5.3'
Could it be something with locales ?
Try:
select 5,3::float;
-
Hannu
---(end of broadcast)---
TIP 5: Have you
On Wed, 2002-10-23 at 03:09, Tom Lane wrote:
It's fairly difficult to get anywhere with standard leak-tracking tools,
since they don't know anything about palloc. What's worse, it is *not*
a bug for a routine to palloc space it never pfrees, if it knows that
it's palloc'ing in a short-lived
Karel Zak kirjutas K, 30.10.2002 kell 10:08:
Hi,
I read a presentation about Object-Oriented features in relation DBs.
The nice are UDT (user defined type):
CREATE TABLE person (
name varchar(32),
address ROW( street varchar(32),
town varchar(32)),
Yaroslav Dmitriev kirjutas K, 30.10.2002 kell 13:48:
Hello,
OK
select 1 as ccc where 1=1
ERROR
select 1 as ccc where ccc=1
PostgreSQL said: ERROR: Attribute 'ccc' not found
Is there any way to set conditions on calculated fields values?
You could try using a subquery
select *
from
Philip Warner kirjutas P, 03.11.2002 kell 06:30:
At 09:36 AM 2/11/2002 -0500, Tom Lane wrote:
Why not do frequent non-full vacuums on only that table, perhaps every
five minutes or so? That's certainly the direction that development is
headed in (we just haven't automated the vacuuming
Philip Warner kirjutas P, 03.11.2002 kell 15:41:
At 03:25 PM 3/11/2002 +0500, Hannu Krosing wrote:
a separate backend in a loop that
kept doing VACUUM TABLE with only 5 seconds sleep between
Good grief! I thought 5 minutes was bad enough. Can't wait for b/g vacuum.
Thanks for the input
Satoshi Nagayasu kirjutas T, 05.11.2002 kell 08:05:
Tom Lane wrote:
I don't see why 2PC would require any protocol-level change. I would
think that the API would be something like
BEGIN;
issue some commands ...
PRECOMMIT;
-- if the above does not return an error,
Bruce Momjian kirjutas K, 06.11.2002 kell 08:19:
I have copies of Peer Direct's (Jan's company) port of PostgreSQL to
Win32, and SRA's port to Win32, and permission to generate a merged
patch that can be applied to 7.4.
Great!
Now that 7.3 is almost complete, I am going to start work on
Satoshi Nagayasu kirjutas K, 06.11.2002 kell 04:15:
Ross J. Reedstrom [EMAIL PROTECTED] wrote:
If application continues to use just BEGIN/COMMIT, then the protocol
level must parse command stream and recognize COMMIT in order to replace
it with PRECOMMIT, COMMIT.
If the
snpe kirjutas L, 09.11.2002 kell 22:51:
Hello,
I work with JDeveloper and PostgreSQL JDBC and I have one problem.
I get error :
sub-SELECT in FORM must have an alias
I can't change SQL command, but it is internal JDeveloper command
You could set up query logging in the backend and see
Tom Lane kirjutas L, 23.11.2002 kell 03:43:
Joe Conway [EMAIL PROTECTED] writes:
I see we just recently made the word value reserved:
http://developer.postgresql.org/cvsweb.cgi/pgsql-server/src/backend/parser/keywords.c.diff?r1=1.130r2=1.131
I noticed it because it breaks the
On Sun, 2002-11-24 at 08:34, Philip Warner wrote:
At 03:48 PM 23/11/2002 -0800, Christopher Kings-Lynne wrote:
I assume that's the correct behaviour? If they specify a default, the
column should be auto-filled with that default, right?
Good question. We might want some input from other DBs;
Al Sutton kirjutas T, 26.11.2002 kell 20:37:
D'Arcy,
In production the database servers are seperate multi-processor machines
with mirrored disks linked via Gigabit ethernet to the app server.
In development I have people extremely familiar with MS, but not very hot
with Unix in any
Evgen Potemkin kirjutas R, 22.11.2002 kell 15:57:
Hi there!
Patch is posted to pgsql-patches. docs inside.
It would of course be nice to support both Oracle and ISO/ANSI syntaxes,
but I'm afraid that the (+) may clash with our overloadable operators
feature.
SQL 99 version will be later.
I
intarray) for performance reasons ;)
--
Hannu Krosing [EMAIL PROTECTED]
---(end of broadcast)---
TIP 4: Don't 'kill -9' the postmaster
scott.marlowe kirjutas K, 27.11.2002 kell 01:40:
On 27 Nov 2002, Hannu Krosing wrote:
You could try out VMWare and run a linux virtual machine under Windows,
You could set it up once with all necessary servers and then copy the
files to each new developers machine.
VMWare is not free
On Thu, 2002-11-28 at 17:34, Evgen Potemkin wrote:
thanks, it's VERY helpful.
understanding SQL99 draft is a bit more difficult than i thought :)
You might also try to get DB2 installed somewhere (IIRC IBM gives out
limited time developer copies).
It implements at least the basic recursive
;)
Hannu Krosing
---(end of broadcast)---
TIP 6: Have you searched our list archives?
http://archives.postgresql.org
On Sat, 2002-11-30 at 01:40, Nicolai Tufar wrote:
And I happen to have bad luck to use PostgreSQL with Turkish locale. And, as
you
may know our I is not your I:
pgsql=# create table a(x char(1));
CREATE TABLE
pgsql=# grant SELECT ON a to PUBLIC;
ERROR: user public does
On Sat, 2002-11-30 at 07:57, Nicolai Tufar wrote:
With this, no matter what kind of I you used in names,
it is always going to end up a valid ASCII character.
Would it be acceptable if I submit a path that applies this
special logic in src/backend/parser/scan.l if the locale is tr_TR?
1 - 100 of 1744 matches
Mail list logo
