On Fri, 23 Jan 1998, Jan Vicherek wrote:
> Hi again,
>
> It seems unfortunate, but if I can't efficiently (i.e. no copying of
> whole table, no blocking and using index) browse the table, I might not
> be able to "sell" postgres into the commercial environment. :-( RAIMA
> Velocis might win :-(
>
> Please please help me solve this or make workarounds or anything. I
> would *really* like to see PosgreSQL to be playing against the Big
> (commercial) Boys !
I'm curious, but can the "Big (commercial) Boys" do this? If so,
can you please provide an example of which and how? Most of us here have
access to an one or the other (me, Oracle) to use as a sample system...if
we can prove that it does work on another system, then we have something
to work with, but right now all I've seen is "I wish I could do this", and
several examples on how to accomplish it using PostgreSQL, but that's
it...
>
> What the whole problem really reduces to, is to be able to get the next
> / previous value in an index. If I can do that, I win. No SELECT (and thus
> no locking) and no huge copying !). It seems to me like something
> primitive, so it should be easy. But it isn't obvious to me. Please help.
If there is no SELECT, how do you get data out of an SQL database?
*raised eyebrow*
> 0. having a value of a field on which there is an index, how can I do :
> a) current_pointer = some_function("value_I_have");
> b) next_pointer = some_other_function(current_pointer);
> c) one_tupple = yet_another_function(next_pointer);
> If I can accomplish a,b,c, then I win and I don't have to do questions
> 1..5 below.
Why not put a sequence field on the table so that you can do:
select * from table where rowid = n; -or-
select * from table where rowid = n - 1; -or-
select * from table where rowid = n + 1; -or-
select * from table where rowid >= n and rowid <= n+x;
And create the index on rowid?
Marc G. Fournier
Systems Administrator @ hub.org
primary: scrappy@hub.org secondary: scrappy@{freebsd|postgresql}.org