Edmar Wiggers wrote:
>
> It seems that R-trees become inefficient when the number of dimensions
> increase. Has anyone thoght of a transparent way to use Peano codes (hhcode
> in Oracle lingo), and use B-tree indexes instead?
>
Do you have a reference, or more information on what a Peano code i
> > > FATAL 2: btree_insert_redo: uninitialized page
> > >
> > > Is it a bug ?
> >
> > Seems so. btree_insert_redo shouldn't see uninitialized pages
> > (only newroot and split ops add pages to index and they should
> > be redone before insert op).
> > Can you post/ftp me tgz of data dir?
> > Or
Hello,
what this can be?
FATAL: s_lock(40015071) at spin.c:127, stuck spinlock. Aborting.
>From other sources I can find out that there was real memory starvation. All
swap was eated out (that's not PostgreSQL problem).
--
Sincerely Yours,
Denis Perchine
--
E
> I am running 7.0 and for columns that have type 'timestamp'
> the values end up with the format of year-month-day HH:MM:SS-[0-n]
afaik there is a newer JDBC driver which copes with this.
- Thomas
Mikheev, Vadim wrote:
>
> > I see now the following message and couldn't start
> > postmaster.
> >
> > FATAL 2: btree_insert_redo: uninitialized page
> >
> > Is it a bug ?
>
> Seems so. btree_insert_redo shouldn't see uninitialized pages
> (only newroot and split ops add pages to index and they
> I see now the following message and couldn't start
> postmaster.
>
> FATAL 2: btree_insert_redo: uninitialized page
>
> Is it a bug ?
Seems so. btree_insert_redo shouldn't see uninitialized pages
(only newroot and split ops add pages to index and they should
be redone before insert op).
Can y
Hi,
I see now the following message and couldn't start
postmaster.
FATAL 2: btree_insert_redo: uninitialized page
Is it a bug ?
Anyway,how do I reset my WAL environment ?
Regards.
Hiroshi Inoue
Trond Eivind GlomsrØd wrote:
> Lamar Owen <[EMAIL PROTECTED]> writes:
> > Mitch Vincent wrote:
> > > code release would have to be somehow honored.. I'm just wondering if the PG
> > > team could change the license even if they wanted to.. I should go read the
> > _Every_single_ copyright holder o
"Martin A. Marques" wrote:
>
> Has somebody thought about putting PG in the GPL licence instead of the BSD?
It is somewhat difficult to put other peoples code under some different
license.
And AFAIK (IANAL) the old license would still apply too for all the code
that
has been released under it.
Lamar Owen <[EMAIL PROTECTED]> writes:
> Mitch Vincent wrote:
> >
> > Regardless of what license is best, could the license even be changed now? I
> > mean, some of the initial Berkeley code is still in there in some sense and
> > I would think that the original license (BSD I assume) of the ini
Mitch Vincent wrote:
>
> Regardless of what license is best, could the license even be changed now? I
> mean, some of the initial Berkeley code is still in there in some sense and
> I would think that the original license (BSD I assume) of the initial source
> code release would have to be someho
Sorry about that email. I was trying to forward your comments to a friend
and due to a lack of sleep I just typed "R" in pine. Doh!
Cheers,
Randy Jonasz
Software Engineer
Click2net Inc.
Web: http://www.click2net.com
Phone: (905) 271-3550
"You cannot possibly pay a philosopher what he's worth
* Oleg Bartunov <[EMAIL PROTECTED]> [001205 13:33] wrote:
> Alfred,
>
> do you have any numbers with and without your patch ?
> I mean performance. You may use pg_check utility.
Er, I just made the patch a couple of hours ago, and I'm also
dealing with some other FreeBSD issues right now. I wil
* Randy Jonasz <[EMAIL PROTECTED]> [001205 14:31] wrote:
>
> Sorry about that email. I was trying to forward your comments to a friend
> and due to a lack of sleep I just typed "R" in pine. Doh!
That's ok, you work with Dan Moschuk right?
--
-Alfred Perlstein - [[EMAIL PROTECTED]|[EMAIL PROTE
On Tuesday 05 December 2000 18:03, The Hermit Hacker wrote:
> >
> > Has somebody thought about putting PG in the GPL licence instead of the
> > BSD?
>
> its been brought up and rejected continuously ... in some of our opinions,
> GPL is more harmful then helpful ... as has been said before many ti
On 5 Dec 2000, Camm Maguire wrote:
> Greetings! I've noticed in the documentation that the sql standard
> requires foreign keys to reference primary key/(or maybe just unique)
> columns, but that postgresql does not enforce this. Is this a feature
> that is intended to persist, or a temporary
Regardless of what license is best, could the license even be changed now? I
mean, some of the initial Berkeley code is still in there in some sense and
I would think that the original license (BSD I assume) of the initial source
code release would have to be somehow honored.. I'm just wondering i
I am running 7.0 and for columns that have type 'timestamp'
the values end up with the format of year-month-day HH:MM:SS-[0-n]
e.g.
2000-12-05 15:58:12-06
the trailing -n (e.g. -06) is killing the JDBC driver.
Is there a work around. No matter what I Insert, a trailing
-0n ge
Just as interesting
On Tue, 5 Dec 2000, Alfred Perlstein wrote:
> * Alfred Perlstein <[EMAIL PROTECTED]> [001205 12:30] wrote:
> > * Tom Lane <[EMAIL PROTECTED]> [001205 08:37] wrote:
> > > BTW, I just remembered that in 7.0.*, the SLocks that are managed by
> > > SpinAcquire() all live in their
The Hermit Hacker wrote:
> its been brought up and rejected continuously ... in some of our opinions,
> GPL is more harmful then helpful ... as has been said before many times,
> and I'm sure will continue to be said "changing the license to GPL is a
> non-discussable issue" ...
I've declined com
> > Sounds great! We can follow this way: when first after last
> > checkpoint update to a page being logged, XLOG code can log
> > not AM specific update record but entire page (creating backup
> > "physical log"). During after crash recovery such pages will
> > be redone first, ensuring page co
On Tue, 5 Dec 2000, Martin A. Marques wrote:
> On Sunday 03 December 2000 04:00, Vadim Mikheev wrote:
> > > There is risk here. It isn't so much in the fact that PostgreSQL, Inc
> > > is doing a couple of modest closed-source things with the code. After
> > > all, the PG community has long ackn
On Tue, Dec 05, 2000 at 10:43:03AM -0800, Mikheev, Vadim wrote:
> > As far as I know (and have tested in excess) Informix IDS
> > does survive any power loss without leaving the db in a
> > corrupted state. The basic technology is, that it only relys
> > on writes to one "file" (raw device in tha
Alfred,
do you have any numbers with and without your patch ?
I mean performance. You may use pg_check utility.
Oleg
On Tue, 5 Dec 2000, Alfred Perlstein wrote:
> Date: Tue, 5 Dec 2000 13:04:45 -0800
> From: Alfred Perlstein <[EMAIL PROTECTED]>
> To: Tom Lane <[EMAIL PROTECTED]>
> Cc: [
Camm Maguire <[EMAIL PROTECTED]> writes:
> Greetings! 'copy from stdin' on 7.0.2 appears to simply hang if more
> than ~ 1000 records follow in one shot. I couldn't see this behavior
> documented anywhere. Is this a bug?
I've never heard of any such behavior ... and you can be sure that we'd
h
> Short Description
> foreign key check makes a big LOCK
>
> Long Description
> in: src/backend/utils/adt/ri_triggers.c
>
> RI_FKey_check(), RI_FKey_noaction_upd(), RI_FKey_noaction_del(), etc..
> checking the referential with SELECT FOR UPDATE.
>
> After BEGIN TRANSACTION: the INSERT/DELETE/UP
* Alfred Perlstein <[EMAIL PROTECTED]> [001205 12:30] wrote:
> * Tom Lane <[EMAIL PROTECTED]> [001205 08:37] wrote:
> > BTW, I just remembered that in 7.0.*, the SLocks that are managed by
> > SpinAcquire() all live in their own little shm segment. On a machine
> > where slock_t is char, it'd lik
Greetings! I've noticed in the documentation that the sql standard
requires foreign keys to reference primary key/(or maybe just unique)
columns, but that postgresql does not enforce this. Is this a feature
that is intended to persist, or a temporary deviation from the sql
standard? The current
Greetings! 'copy from stdin' on 7.0.2 appears to simply hang if more
than ~ 1000 records follow in one shot. I couldn't see this behavior
documented anywhere. Is this a bug?
Take care,
--
Camm Maguire[EMAIL PROTECTED]
===
> > > I totaly missed your point here. How closing source of
> > > ERserver is related to closing code of PostgreSQL DB server?
> > > Let me clear things:
> > >
> > > 1. ERserver isn't based on WAL. It will work with any version >= 6.5
> > >
> > > 2. WAL was partially sponsored by my employer, Se
On Tuesday 05 December 2000 16:23, Martin A. Marques wrote:
>
> Has somebody thought about putting PG in the GPL licence instead of the
> BSD? PG inc would still be able to do there money giving support (just like
> IBM, HP and Compaq are doing there share with Linux), without been able to
> close
Minor usability/debuggability suggestion...
RI violation error messages in 7.0.0 do not appear to identify the
offending value.
Example:
ERROR: fk_employee_currency referential integrity violation - key
referenced from employee not found in currency
Easier to debug would be:
ERROR: fk_emplo
* Tom Lane <[EMAIL PROTECTED]> [001205 08:37] wrote:
> BTW, I just remembered that in 7.0.*, the SLocks that are managed by
> SpinAcquire() all live in their own little shm segment. On a machine
> where slock_t is char, it'd likely only amount to 128 bytes or so.
> Maybe you are seeing some bug i
On Tue, Dec 05, 2000 at 02:52:48PM -0500, Tom Lane wrote:
> There aren't going to be all that many data pages needing the COW
> treatment, because the postmaster uses very little data space of its
> own. I think this would become an issue if we tried to have the
> postmaster pre-cache catalog inf
On Sunday 03 December 2000 21:49, The Hermit Hacker wrote:
>
> I've been trying to follow this thread, and seem to have missed where
> someone arrived at the conclusion that we were proprietarizing(word?) this
I have missed that part as well.
> ... we do apologize that it didn't get out mid-Octo
> > I totaly missed your point here. How closing source of
> > ERserver is related to closing code of PostgreSQL DB server?
> > Let me clear things:
> >
> > 1. ERserver isn't based on WAL. It will work with any version >= 6.5
> >
> > 2. WAL was partially sponsored by my employer, Sectorbase.com,
[EMAIL PROTECTED] writes:
> The process vs threads benchmark which showed 160us vs 120us, only did
> the process creation, not the delayed hit of the "copy on write" pages
> in the new process. Just forking is not as simple as forking, once the
> forked process starts to work, memory that is not e
On Sunday 03 December 2000 12:41, mlw wrote:
> Thomas Lockhart wrote:
> > As soon as you find a business model which does not require income, let
> > me know. The .com'ers are trying it at the moment, and there seems to be
> > a few flaws... ;)
>
> While I have not contributed anything to Postgres
On Sunday 03 December 2000 04:00, Vadim Mikheev wrote:
> > There is risk here. It isn't so much in the fact that PostgreSQL, Inc
> > is doing a couple of modest closed-source things with the code. After
> > all, the PG community has long acknowleged that the BSD license would
> > allow others to
> Well, there is a theoretical chance of deadlock --- not against other
> transactions doing the same thing, since RowShareLock and
> RowExclusiveLock don't conflict, but you could construct deadlock
> scenarios involving other transactions that grab ShareLock or
> ShareRowExclusiveLock. So I don
> As far as I know (and have tested in excess) Informix IDS
> does survive any power loss without leaving the db in a
> corrupted state. The basic technology is, that it only relys
> on writes to one "file" (raw device in that case), the txlog,
> which is directly written. All writes to the txlog
On Tue, Dec 05, 2000 at 05:29:36AM +, Thomas Lockhart wrote:
>
> As you can see, "core" == "fundamental" in the general sense, in a
> statement not written specifically for the hacker community but for the
> world at large. In many cases, taking one syllable rather than four is a
> good thing
I have been watching this thread vs non-threaded discussion and am completely with the
process-only crew for a couple reasons, but lets look at a few things:
The process vs threads benchmark which showed 160us vs 120us, only did the process
creation, not the delayed hit of the "copy on write" pag
On Tue, 5 Dec 2000, Tom Lane wrote:
> Hmm. The rule will generate a query along these lines:
>
> DELETE FROM ips_free
> FROM ips_free ipsfree2
> WHERE ips_free.block_id = ipsfree2.block_id
> AND ips_free.ip = ipsfree2.ip
> AND ipsfree2.ip = '10.10.10.10';
>
> (I'm using ipsfr
Alfred Perlstein <[EMAIL PROTECTED]> writes:
> No I'm not sure actually. :) I'll look into it further, but I
> was wondering if there was something I could do to debug the
> locks better. I think I'll add some S_MAGIC or something in
> the struct to see if the whole thing is getting clobbered or
BTW, I just remembered that in 7.0.*, the SLocks that are managed by
SpinAcquire() all live in their own little shm segment. On a machine
where slock_t is char, it'd likely only amount to 128 bytes or so.
Maybe you are seeing some bug in FreeBSD's handling of tiny shm
segments?
On Mon, Dec 04, 2000 at 08:43:24PM -0800, Tom Samplonius wrote:
> Some OSes (Linux is the main one) implement threads as pseudo processes.
> Linux threads are processes with a shared address space and file
> descriptor table.
>
> Context switch cost for threads can be lower if you are switchi
* Tom Lane <[EMAIL PROTECTED]> [001205 07:43] wrote:
> Alfred Perlstein <[EMAIL PROTECTED]> writes:
> > Here's the log, the number in parens is the address of the lock,
> > on tas() the value printed to the right is the value in _ret,
> > for the others, it's the value before the lock count is set
Alfred Perlstein <[EMAIL PROTECTED]> writes:
> Here's the log, the number in parens is the address of the lock,
> on tas() the value printed to the right is the value in _ret,
> for the others, it's the value before the lock count is set.
This looks to be the trace of a SpinAcquire()
(see src/bac
On Tue, Dec 05, 2000 at 10:07:37AM +0100, Zeugswetter Andreas SB wrote:
> > And using the following program for timing thread creation
> > and cleanup:
> >
> > #include
> >
> > threadfn() { pthread_exit(0); }
>
> I think you would mainly need to test how the system behaves, if
> the threads
Actually, Alfred is a FreeBSD committer, and committed it
to the FreeBSD source tree.
It's for ALL at FreeBSD 4-STABLE as of today.
LER
-Original Message-
From: Tom Lane [mailto:[EMAIL PROTECTED]]
Sent: Tuesday, December 05, 2000 9:14 AM
To: Alfred Perlstein
Cc: Larry Rosenman; Post
* Tom Lane <[EMAIL PROTECTED]> [001205 07:24] wrote:
> Alfred Perlstein <[EMAIL PROTECTED]> writes:
> > I'm pretty sure you guys need memory barrier ops.
>
> On a machine that requires such a thing, the assembly code for UNLOCK
> should include it. Want to provide a patch?
My assembler is extre
Alfred Perlstein <[EMAIL PROTECTED]> writes:
> I'm pretty sure you guys need memory barrier ops.
On a machine that requires such a thing, the assembly code for UNLOCK
should include it. Want to provide a patch?
regards, tom lane
* Tom Lane <[EMAIL PROTECTED]> [001205 07:14] wrote:
> Alfred Perlstein <[EMAIL PROTECTED]> writes:
> > Anyhow, to address the problem I've removed struct mount from
> > userland visibility in both FreeBSD 5.x (current) and FreeBSD 4.x
> > (stable).
>
> That might fix things on your box, but we c
Alfred Perlstein <[EMAIL PROTECTED]> writes:
> Anyhow, to address the problem I've removed struct mount from
> userland visibility in both FreeBSD 5.x (current) and FreeBSD 4.x
> (stable).
That might fix things on your box, but we can hardly rely on it as an
answer for everyone running FreeBSD :-
On FreeBSD 4.1.1 and above there's a sysctl tunable called
kern.ipc.shm_use_phys, when set to 1 it's supposed to
make the kernel's handling of shared memory much more
effecient at the expense or making the shm segment unpageable.
I tried to use this option with 7.0.3 and FreeBSD 4.2 but
for some
I'm debugging some code here where I get problems related to
spinlocks, anyhow, while running through the files I noticed
that the UNLOCK code seems sort of broken.
What I mean is that on machines that have loosely ordered
memory models you can have problems because of data that's
supposed to be
Here's the query that, given the primary key table, lists all foreign
keys, their tables, the RI type, and defereability.
Michael Fork - CCNA - MCP - A+
Network Support - Toledo Internet Access - Toledo Ohio
SELECT pg_trigger.tgargs,
pg_trigger.tgnargs,
pg_trigger.tgdeferrable,
pg_trigger.tginit
It seems that R-trees become inefficient when the number of dimensions
increase. Has anyone thoght of a transparent way to use Peano codes (hhcode
in Oracle lingo), and use B-tree indexes instead?
Also, I've read that R-trees sometimes suffer a lot when an update overflows
a node in the index.
T
On Mon, Dec 04, 2000 at 09:09:55AM +0100, [EMAIL PROTECTED] wrote:
> i have wrote an application dealing with ean13 and ean8 type,how can i
> submit it ??
Post a link to your patches here and see if it generates some
interest. Some description would be nice too, what you are
exactly trying to pr
* Alfred Perlstein <[EMAIL PROTECTED]> [001205 04:00]:
> * Larry Rosenman <[EMAIL PROTECTED]> [001128 20:44] wrote:
> > * Tom Lane <[EMAIL PROTECTED]> [001128 22:31]:
> > > Larry Rosenman <[EMAIL PROTECTED]> writes:
> > > > The last batch of commits break on FreeBSD 4.2-STABLE.
> > > > /usr/inclu
* Larry Rosenman <[EMAIL PROTECTED]> [001128 20:44] wrote:
> * Tom Lane <[EMAIL PROTECTED]> [001128 22:31]:
> > Larry Rosenman <[EMAIL PROTECTED]> writes:
> > > The last batch of commits break on FreeBSD 4.2-STABLE.
> > > /usr/include/machine/lock.h:148: conflicting types for `s_lock'
> > > ../..
> Right. This is very much the guarantee that RAID (non-zero) makes,
> except "other than disk hardware failure" is replaced by "other than
> the failure of two drives". RAID gives you that (very, very
> substantial
> boost which is why it is so popular for DB servers). It doesn't give
> you
> And using the following program for timing thread creation
> and cleanup:
>
> #include
>
> threadfn() { pthread_exit(0); }
I think you would mainly need to test how the system behaves, if
the threads and processes actually do some work in parallel, like:
threadfn() {int i; for (i=0; i<10
64 matches
Mail list logo
