to
find all these papers with Google (Scholar) in case my computer is
shut down, otherwise you can download them directly from me.
Greetings,
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
---(end of broadcast
On 11/20/05, Heikki Linnakangas [EMAIL PROTECTED] wrote:
On Sat, 19 Nov 2005, Nicolas Barbier wrote:
You might want to take a look at the pages that I set up to track the
progress on my master's thesis:
url:http://www.nicolas.barbier.easynet.be/itsme/thesis/
especially
%20Optimizer/index.html
The manual:
url:http://www.postgresql.org/docs/current/static/planner-optimizer.html
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
---(end of broadcast)---
TIP 2: Don't 'kill -9' the postmaster
, in which update-in-place is
safe. (No transaction can guarantee that it will commit.)
Updates to row values that did not escape the currect transaction
yet (ie, rows that were created by or have their last value written by
the current transaction).
Nicolas
--
Nicolas Barbier
http://www.gnu.org
of the outer query:
SELECT * FROM (
SELECT
ROW_NUMBER() OVER (ORDER BY key ASC) AS rownumber,
columns
FROM tablename
) AS foo
WHERE rownumber = 10
(example stolen from the Wikipedia article linked above).
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
of these
passes has to be fully executed, because one needs to read at least
all the data once to find the top n.
greetings,
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
---(end of broadcast)---
TIP 5: don't
2009/12/15 Tom Lane t...@sss.pgh.pa.us:
to...@tuxteam.de writes:
(and as Andrew Dunstan pointed out off-list: I was wrong with my bold
assertion that one can squeeze infinitely many (arbitrary length)
strings between two given. This is not always the case).
Really? If the string length is
2009/12/16 Albe Laurenz laurenz.a...@wien.gv.at:
Quote:
The problem [of phantom reads] was identified in (Eswaran et al., 1976),
but the general purpose predicate locking solution suggested there
has not been widely adopted because of the difficulty in testing mutual
satisfiability
[ Forgot the list, resending. ]
2009/12/16 Boszormenyi Zoltan z...@cybertec.at:
Robert Haas írta:
On Wed, Dec 16, 2009 at 1:25 PM, Robert Haas robertmh...@gmail.com wrote:
On Wed, Dec 16, 2009 at 1:14 PM, Alvaro Herrera
alvhe...@commandprompt.com wrote:
So you'd have to disable HOT
2009/12/18 Florian Weimer fwei...@bfk.de:
* Florian Pflug:
On 16.12.09 16:40 , Kevin Grittner wrote:
Nicolas Barbiernicolas.barb...@gmail.com wrote:
I am not sure whether the serialization failures that it may cause
are dependent on the plan used.
They are.
But so are failures due
2009/12/31 Bruce Momjian br...@momjian.us:
I must be missing something but I thought the only problem with our
existing snapshot system was that you could see a row updated after your
snapshot was created, and that the solution to that was to abort the
transaction that would see the new row.
[ Reviving this old thread because a recent one referred to it. ]
2009/5/7 Albe Laurenz laurenz.a...@wien.gv.at:
Kevin Grittner wrote:
maybe I misunderstood something.
Consider a function
makehighlander(personid integer) RETURNS void
defined like this:
SELECT ishighlander INTO
2009/12/31 Sergej Galkin sergej.gal...@gmail.com:
typedef struct moving_object
{
double x_high;
double y_high;
double x_low;
double y_low;
time_t mov_time;
double x_plus;
double y_plus;
double x_minus;
double y_minus;
} moving_object;
[..]
2010/1/7 Markus Wanner mar...@bluegap.ch:
(It's interesting that with database page level granularity, he states
that predicate locking would not be necessary. Instead any page can be
locked at any time. For this to work, according to my reasoning, you'd
have to know in advance on which page
2010/1/7 Albe Laurenz laurenz.a...@wien.gv.at:
I don't know if such a thing would be easy to implement in
PostgreSQL, but I had thought that the standard approach to
implement predicate locking is like this:
Whenever you touch (read) a data structure, you tag it with a lock
that prevents
2010/1/7 Albe Laurenz laurenz.a...@wien.gv.at:
Nicolas Barbier wrote:
In such a pure implementation of predicate locking, the overlap
testing is be done using the algebraic properties of the conditions,
which is of course extremely difficult (if not impossible) to
implement perfectly
2010/1/8 Markus Wanner mar...@bluegap.ch:
SIREAD atop predicate locking serves detecting vulnerable edges (I hope
I'm using that term correctly here) between newly inserted tuples and
reads, right? I was trying to figure if it would make sense to use
predicate locking (instead of table or row
2010/1/8 Kevin Grittner kevin.gritt...@wicourts.gov:
Nicolas Barbier nicolas.barb...@gmail.com wrote:
I assume here that PG's non-SI-compatible behavior of not always
rollbacking any transaction that writes to a non-last version will
be disabled in serializable mode.
Can that currently
2010/3/23 Pavel Stehule pavel.steh...@gmail.com:
2010/3/23 Takahiro Itagaki itagaki.takah...@oss.ntt.co.jp:
The fundamental issue seems to be in the slow initialization of
dictionaries. If so, how about adding a pre-complile tool to convert
a dictionary into a binary file, and each backend
2010/4/7 Olivier Baheux olivierbah...@gmail.com:
i'm trying to find where are stored sequence definition
(increment,minvalue,maxvalue,start,cache) in system tables. Atm I
found everything exept sequence.
It's in the sequence itself (which can be accessed like a table). The
fact that this
2010/5/11 Marko Tiikkaja marko.tiikk...@cs.helsinki.fi:
On 2010-05-11 14:29 +0200, Robert Haas wrote:
On Tue, May 11, 2010 at 2:16 AM, Dmitry Fefelov fo...@ac-sw.com wrote:
The referential integrity triggers contain some extra magic that isn't
easily simulatable in userland, and that is
2010/5/11 Marko Tiikkaja marko.tiikk...@cs.helsinki.fi:
This is getting way off topic, but:
On 5/11/10 3:55 PM +0300, Nicolas Barbier wrote:
T2 SELECT i FROM a WHERE i = 1 FOR SHARE; -- Lock a with i = 1 FOR
SHARE.
i
---
1
(1 Zeile)
T2 SELECT a_id FROM b WHERE a_id = 1; -- Check
2010/5/14 Greg Stark gsst...@mit.edu:
On Thu, May 13, 2010 at 10:25 PM, Florian Pflug f...@phlo.org wrote:
C1: BEGIN
C1: SELECT * FROM t WHERE id = 1 FOR UPDATE
C2: BEGIN
C2: SET TRANSACTION ISOLATION LEVEL SERIALIZABLE
C2: SELECT * FROM t -- Take snapshot before C1 commits
C1: COMMIT
attributes are used in the query.
Hibernate:
url:http://www.hibernate.org/
Hibernate Inheritance Mapping:
url:http://www.hibernate.org/hib_docs/reference/en/html/inheritance.html
greetings,
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
that looks suspiciously similar to a
DBMS optimizer.
Maybe it is debatable whether this optimization should be done by the
application (i.e. the ORM) or by the DBMS. I am personally in favor of
doing it in the DBMS.
greetings,
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word
recursively (implementation doesn't have to
be recursive, of course), to eliminate whole sub-trees of the join
tree.
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
---(end of broadcast)---
TIP 9: In versions below 8.0
There are (of course) competing standards such as:
url:http://en.wikipedia.org/wiki/High_Level_Shader_Language
and:
url:http://en.wikipedia.org/wiki/Cg_%28programming_language%29.
greetings,
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
dictionary
* specifies maximum length - add the before maximum
14.12. Example of Creating a Parser
* Note it should - insert that after Note
* The void function - replace The with This
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
---(end
2009/8/23 Magnus Hagander mag...@hagander.net:
For another data point, Microsoft documentation says:
This POSIX function is deprecated beginning in Visual C++ 2005. Use
the ISO C++ conformant _hypot instead.
_hypot() has been there since Windows 95, so it shouldn't be a problem
to use it -
2009/9/15 Michael Meskes mes...@postgresql.org:
Looking at
http://zlew.org/postgresql_static_check/scan-build-2009-09-14-1/report-3LPmKK.html#EndPath
it tells me that the value stored to 'counter' is never used. However, the
counter++ is called inside a loop and thus will be read the next
, then we
don't need this feature at the moment. Otherwise: Could anyone
explain?
That is exactly what it means.
Nicolas
--
Nicolas Barbier
http://www.gnu.org/philosophy/no-word-attachments.html
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your
2010/5/25 Dan Ports d...@csail.mit.edu:
On Mon, May 24, 2010 at 10:24:07AM -0500, Kevin Grittner wrote:
Replicating or recreating the whole predicate locking and conflict
detection on slaves is not feasible for performance reasons. (I
won't elaborate unless someone feels that's not
2010/5/25 Dan Ports d...@csail.mit.edu:
On Tue, May 25, 2010 at 02:00:42PM +0200, Nicolas Barbier wrote:
I don't understand the problem. According to me, in the context of
SSI, a read-only slave can just map SERIALIZABLE to the technical
implementation of REPEATABLE READ (i.e., the currently
2010/5/25 Florian Pflug f...@phlo.org:
On May 25, 2010, at 20:18 , Dan Ports wrote:
T3, which is a read-only transaction, sees the incremented date and an
empty list of receipts. But T1 later commits a new entry in the
receipts table with the old date. No serializable ordering allows this.
2010/5/25 Florian Pflug f...@phlo.org:
Hm, but for there to be an actual problem (and not a false positive), an
actual dangerous circle has to exist in the dependency graph. The
existence of a dangerous structure is just a necessary (but not
sufficient) and easily checked-for condition for
2010/6/30 Robert Haas robertmh...@gmail.com:
By the way, does the SQL standard say anything about materialized views?
AFAIK, nope. Probably for the same reason that indexes are not
mentioned by the standard: both are only performance enhancements, and
one could easily imagine future SQL
2010/8/5 Richard husttrip...@vip.sina.com:
All jods are done by client code, not manually.
What is a jod?
I still did't not understand what you said.
What break what?
The fact that you replaced CHECKPOINT_WAIT with CHECKPOINT_IMMEDIATE
is the cause of your problem. You broke the correctness
2010/8/11 Marko Tiikkaja marko.tiikk...@cs.helsinki.fi:
On 8/11/10 8:31 AM +0300, Peter Eisentraut wrote:
Thinking about SQL assertions (check constraints that are independent of
one particular table), do you think it would be reasonable to implement
those on top of constraint triggers? On
2010/8/24 Pei He hepeim...@gmail.com:
I want to run two different versions of postgresql-8.2.5 under eclipse.
But, it requires me to change PGDATA and LD_LIBRARY_PATH to switch.
Moreover, to let eclipse know the changes, I need to modify .profile
under my home folder, and log out and log
2010/8/25 Simon Riggs si...@2ndquadrant.com:
referenced meaning by an RI constraint, which only ever refers to
PKs in other tables.
FK constraints can also point to non-PK UNIQUE columns.
Nicolas
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your
2010/8/25 Simon Riggs si...@2ndquadrant.com:
On Wed, 2010-08-25 at 16:14 +0200, Nicolas Barbier wrote:
2010/8/25 Simon Riggs si...@2ndquadrant.com:
referenced meaning by an RI constraint, which only ever refers to
PKs in other tables.
FK constraints can also point to non-PK UNIQUE
2009/6/7 Markus Wanner mar...@bluegap.ch:
However, there's no special whitespace treatment. Nor anything remotely
as clever as nearby variable renaming. There's no such magic, the
developer still needs to tell the tool what he wants.
If I understand correctly, nearby variable renaming refers
2011/12/30 Ants Aasma ants.aa...@eesti.ee:
On Thu, Dec 29, 2011 at 6:44 PM, Kevin Grittner
kevin.gritt...@wicourts.gov wrote:
positives. To get this right for a checksum in the page header,
double-write would need to be used for all cases where
full_page_writes now are used (i.e., the
2012/1/4 Simon Riggs si...@2ndquadrant.com:
On Wed, Jan 4, 2012 at 9:20 AM, Andres Freund and...@anarazel.de wrote:
I wonder if CRC32c wouldn't be a good alternative given more and more cpus
(its in SSE 4.2) support calculating it in silicon.
We're trying to get something that fits in
2012/2/22 Robert Haas robertmh...@gmail.com:
On Tue, Feb 21, 2012 at 9:00 AM, Pavel Stehule pavel.steh...@gmail.com
wrote:
I had to reply to query about usage VACUUM ANALYZE or ANALYZE. I
expected so ANALYZE should be faster then VACUUM ANALYZE.
But is not true. Why?
I'm pretty sure
2010/12/13 Tom Lane t...@sss.pgh.pa.us:
But allow me to harbor doubts that they really
intend to allow someone to force a constraint to be considered valid
without any verification.
Table constraints are either enforced or not enforced. Domain
constraints and assertions are always enforced.,
2010/12/15 matteo durighetto desmodem...@gmail.com:
But why we need all these versions of the same row on table, if for
rollback we need only the original row X (X0) ?
And the previous value of row X during the execution of a statement
(because statements don't see their own changes, think
2010/12/16 Robert Haas robertmh...@gmail.com:
On Thu, Dec 16, 2010 at 7:49 AM, Dimitri Fontaine dimi...@2ndquadrant.fr
wrote:
Please note that the SQL scripts seem to be encoded in latin9.
Seems like an odd choice. Why not UTF-8?
Latin 9 = ISO 8859-15 = a more modern version of Latin 1
2010/12/20 Martijn van Oosterhout klep...@svana.org:
On Mon, Dec 20, 2010 at 09:03:56AM +0900, Itagaki Takahiro wrote:
UTF-8 is not a superset of all encodings.
I think you mean Unicode is not a superset of all character sets. I've
heard this before but never found what's missing. [citation
2010/12/24 Florian Pflug f...@phlo.org:
On Dec23, 2010, at 20:39 , Tomas Vondra wrote:
I guess we could use the highest possible value (equal to the number
of tuples) - according to wiki you need about 10 bits per element
with 1% error, i.e. about 10MB of memory for each million of
2011/1/5 Zotov zo...@oe-it.ru:
Why doesn`t work this query?
select table1.field1, func1.field2 from table1 left outer join
func1(table1.field1) on true where func1.field3 in (20, 100);
If i have other than LEFT OUTER JOIN I can understand why
ERROR: invalid reference to FROM-clause entry
2011/1/16 Simone Aiken sai...@ulfheim.net:
is there a way to make queries on the system tables show me what
is actually there when I'm poking around? So for example:
Select * from pg_type limit 1;
tells me that the typoutput is 'boolout'. An english
2011/1/21 Anssi Kääriäinen anssi.kaariai...@thl.fi:
Sorry for bothering all of you, but I just don't get this. What if T2 rolls
back instead of committing? Then the snapshot of T3 would have been valid,
right? Now, for the snapshot of T3 it doesn't matter if T2 commits or if it
doesn't,
2011/1/21 Robert Haas robertmh...@gmail.com:
On Fri, Jan 21, 2011 at 8:05 AM, Nicolas Barbier
nicolas.barb...@gmail.com wrote:
2011/1/21 Anssi Kääriäinen anssi.kaariai...@thl.fi:
Sorry for bothering all of you, but I just don't get this. What if T2 rolls
back instead of committing
2011/1/27 Bruce Momjian br...@momjian.us:
Bruce Momjian wrote:
Peter Eisentraut wrote:
We use small k in postgresql.conf, so pg_test_fsync should use the
same. Using kB would be more accurate in any case.
OK, done with the attached applied patch.
FYI, I had used 'k' because this page
2011/2/1 Magnus Hagander mag...@hagander.net:
On Tue, Feb 1, 2011 at 07:56, Pavel Stehule pavel.steh...@gmail.com wrote:
2011/2/1 Magnus Hagander mag...@hagander.net:
On Tue, Feb 1, 2011 at 05:53, Pavel Stehule pavel.steh...@gmail.com wrote:
Hello
There are broken links inside messages
2011/2/9 amit sehas cu...@yahoo.com:
Lets say that the cost based optimizer determines that the order of the
joins should be T1.a=T2.b followed by T2.c = T3.d followed by T3.e = T4.f
the question we have is during query execution are the joins evaluated
completely one by one in that order,
2011/2/10 mac_man2...@yahoo.it mac_man2...@yahoo.it:
Which operations invoke the sorting algorithms implemented in the sorting
module (tuplesort.c) ?
Of course, one of those operations invoking sorting is the ORDER BY clause
and the DISTINCT too.
Moreover, the Merge Join should be
2012/8/7 Kevin Grittner kevin.gritt...@wicourts.gov:
I also think it's a problem that one can get through the entire
Concurrency Control chapter (mvcc.sgml) without a clue that
sequences aren't transactional.
It is possible to say that they *are* transactional when considering
the following
2012/4/25 Simon Riggs si...@2ndquadrant.com:
On Wed, Apr 25, 2012 at 4:55 AM, Noah Misch n...@leadboat.com wrote:
I do not see a clean behind-the-scenes fix for points 1, 4 and 5. We can
resolve those by adding a new variety of temporary table, one coincidentally
matching the SQL standard's
2012/4/25 Simon Riggs si...@2ndquadrant.com:
So you are saying it is OK to not be able to *create* them on HS, just
*use* pre-defined tables?
That's almost useless IMHO.
Applications expect to be able to do this all in the same transaction
on one session
CREATE TEMP TABLE x;
...DML
2012/4/25 Nicolas Barbier nicolas.barb...@gmail.com:
is the reason of existence for the PG-like temporary transactions.
s/transactions/tables/
Nicolas
--
A. Because it breaks the logical sequence of discussion.
Q. Why is top posting bad?
--
Sent via pgsql-hackers mailing list (pgsql
2012/5/17 Volker Grabsch v...@notjusthosting.com:
Also, is there any chance to include a (simple) attempt of
such an optimiztation into PostgreSQL-9.2 beta, or is this
only a possible topic for 9.3 and later?
For 9.2, you’re about 4 months late :-). The last commitfest was in Januari:
2011/5/30, Nick Raj nickrajj...@gmail.com:
3. When tuples are 5 lakh
For the benefit of the others: 5 lakh seems to mean 500,000.
URL:http://en.wikipedia.org/wiki/Lakh
Nicolas
--
A. Because it breaks the logical sequence of discussion.
Q. Why is top posting bad?
--
Sent via pgsql-hackers
2011/5/31, Tom Lane t...@sss.pgh.pa.us:
Unless maybe there's a kFreeBSD-like project out there with NetBSD as
the kernel?)
There used to be an attempt by Debian (called GNU/NetBSD), but that
has since long been abandoned. I don't know of any other similar
projects.
2011/6/17, Andrew Dunstan and...@dunslane.net:
On 06/17/2011 10:55 AM, Radosław Smogura wrote:
XML canonization preservs whitespaces, if I remember
well, I think there is example.
In any case if I will store image in XML (I've seen this), preservation of
white spaces and new lines is
2011/6/17, Andrew Dunstan and...@dunslane.net:
On 06/17/2011 11:29 AM, Nicolas Barbier wrote:
CDATA sections are just syntactic sugar (a form of escaping):
Yeah. OTOH doesn't an empty CDATA section force a child element, where a
pure empty element does not?
Wow, some Googling around shows
2011/6/28, Robert Haas robertmh...@gmail.com:
You know, it just occurred to me while reading this email that you're
using the term predicate lock in a way that is totally different
from what I learned in school. What I was taught is that the word
predicate in predicate lock is like the word
2011/6/29, Florian Pflug f...@phlo.org:
Secondly, there is little point in having an type XML if we
don't actually ensure that values of that type can only contain
well-formed XML.
+1. The fact that XPATH() must return a type that cannot depend on the
given expression (even if it is a
2013/2/19 Robert Haas robertmh...@gmail.com:
In the department of crazy ideas, what about having pg_dump NEVER
refresh ANY materialized views?
It's true that the job of pg_dump and pg_restore is to put the new
database in the same state that the old database was in, but I think
you could
2013/3/3 Kevin Grittner kgri...@ymail.com:
Rewriting queries using
expressions which match the MV's query to pull from the MV instead
of the underlying tables is the exception. While that is a sexy
feature, and I'm sure one can construct examples where it helps
performance, it seems to me
2013/3/3 Kevin Grittner kgri...@ymail.com:
Nicolas Barbier nicolas.barb...@gmail.com wrote:
I think that automatically using materialized views even when the
query doesn’t mention them directly, is akin to automatically
using indexes without having to mention them in the query. That
way
2013/3/5 Robert Haas robertmh...@gmail.com:
All that having been said, it's hard for me to imagine that anyone
really cares about any of this until we have an incremental update
feature, which right now we don't. Actually, I'm betting that's going
to be significantly harder than
2013/3/5 Kevin Grittner kgri...@ymail.com:
Exactly. I predict that we will eventually have some special sort
of trigger for maintaining MVs based on base table changes to
handle the ones that are just too expensive (in developer time or
run time) to fully automate. But there is a lot of
2013/3/5 Kevin Grittner kgri...@ymail.com:
Perhaps it would be worth looking for anything in the patch that
you think might be painting us into a corner where it would be hard
to do all the other cool things. While it's late enough in the
process that changing anything like that which you
2013/3/8 Andres Freund and...@anarazel.de:
On 2013-03-07 15:21:35 -0800, Josh Berkus wrote:
This limitation is in no way crippling for this feature, or even a major
detraction. I still intend to promote the heck out of this feature.
Thats scaring me. Because the current state of the
2013/4/3 Tom Lane t...@sss.pgh.pa.us:
Kevin Grittner kgri...@ymail.com writes:
To be honest, I don't think I've personally seen a single use case
for matviews where they could be used if you couldn't count on an
error if attempting to use them without the contents reflecting a
2013/4/5 Noah Misch n...@leadboat.com:
On Thu, Apr 04, 2013 at 12:28:01PM +0200, Nicolas Barbier wrote:
+1. Having unlogged matviews without having incremental updates yet,
isn't super useful anyway.
I would have surmised the opposite: since an unlogged MV requires a full
refresh
2013/5/17 Kevin Grittner kgri...@ymail.com:
During calculation of the deltas to apply to the matviews, it must
be possible to query the referenced tables from the perspective of
both the before and after versions of the data.
[..]
I don't think the process applying the deltas needs to do
2013/5/17 Kevin Grittner kgri...@ymail.com:
Nicolas Barbier nicolas.barb...@gmail.com wrote:
Note that the basic count algorithm assumes real-serializable
transactions for correctness. Example:
[..]
Good point.
It might be hard to detect when this type of race condition exists,
since
2013/5/17 Claudio Freire klaussfre...@gmail.com:
On Fri, May 17, 2013 at 4:25 PM, Kevin Grittner kgri...@ymail.com wrote:
(3) The count algorithm must be implemented in a way that understands
MVCC internals: Reading the base tables must be done using a technique
that reads all rows (i.e.,
[ Forgot the list, resending. ]
2010/9/25 Greg Stark gsst...@mit.edu:
On Thu, Sep 23, 2010 at 4:08 PM, Kevin Grittner
kevin.gritt...@wicourts.gov wrote:
One place I'm particularly interested in using such a feature is in
pg_dump. Without it we have the choice of using a SERIALIZABLE
2010/9/27 Guillaume Du Pasquier guillaume.dupasqu...@sensometrix.ch:
In both cases, the client socket (pgadmin or my program) remains in
TIME_WAIT state.
I have used wireshark to sniff the TCP protocol.
We have at the end of a connection:
Client Server
--- FIN,ACK
2010/9/27 Robert Haas robertmh...@gmail.com:
On Mon, Sep 27, 2010 at 12:56 PM, Guillaume Du Pasquier
guillaume.dupasqu...@sensometrix.ch wrote:
Our client runs on the same machine as the postgresql server.
Would it be possible to use PF_UNIX sockets ?
Yeah, actually that's the default, if
2010/11/2 Kenneth Marshall k...@rice.edu:
Given that our hash implimentation mixes the input data well (It does.
I tested it.) then a simple rotate-and-xor method is all that should
be needed to maintain all of the needed information. The original
hash function has done the heavy lifting in
2010/11/11 David E. Wheeler da...@kineticode.com:
On Nov 11, 2010, at 10:05 AM, Tom Lane wrote:
So are you planning to implement multisets? It's a feature I'd love to see
What actual functionality does it buy? AFAICT from Itagaki-san's
description, it's an array only you ignore the
2011/12/5 Tom Lane t...@sss.pgh.pa.us:
What is bothering me is that this approach is going to cause substantial
bloat of the executable code, and such bloat has got distributed costs,
which we don't have any really good way to measure but for sure
micro-benchmarks addressing only sort speed
[ Please don't top-post. URL:http://en.wikipedia.org/wiki/Posting_style ]
2011/2/11 mac_man2...@yahoo.it mac_man2...@yahoo.it:
So, is there any precise way to discover when sorting is invoked?
EXPLAIN shows how a query would be executed; explicit sorts should be
mostly obvious.
2011/2/11 Kevin Grittner kevin.gritt...@wicourts.gov:
mac_man2...@yahoo.it mac_man2...@yahoo.it wrote:
I need to know, from an algorithmic point of view, in which cases
sorting is invoked.
[..]
Are your really looking to categorize the types of queries where
sorting is *invoked*, or the
2011/3/1 Andrew Dunstan and...@dunslane.net:
I think hierarchical data really only scratches the surface of the problem.
It would be nice to be able to specify all sorts of context for searches:
* foo after bar
* foo near bar
* foo and bar in the same paragraph
* foo as a
2011/3/9 Vlad Arkhipov arhi...@dc.baikal.ru:
Let there are two transactions that were created with read commited
isolation level. In the first one we're executing a SELECT query:
SELECT * FROM t UNION ALL SELECT * FROM t;
In the second transaction we're modifying the same table:
INSERT INTO
2011/3/9 Nicolas Barbier nicolas.barb...@gmail.com:
Note that the standard defines things that must never happen in the
case of READ COMMITTED, it does not specify that one *must* be able to
see the stuff as committed by previous transactions, for example.
Hmm, make that stuff as committed
2011/3/10 Jesper Krogh jes...@krogh.cc:
On 2011-03-10 19:25, Bruce Momjian wrote:
Sure, anyone can add text to that wiki; you create a community account
here:
http://www.postgresql.org/community/signup
Suggestion: Add this url to the login box on the wiki.
+1, Adrian von Bidder
2011/3/15 Dmitriy Igrishin dmit...@gmail.com:
Oleg Bartunov and I intend to begin the project of translation
of PostgreSQL documentation on Russian.
Just to make sure that you are aware of a recently-started effort to
create a German translation, by Susanne and others:
2011/3/20 hom obsidian...@gmail.com:
I trace into scan.c because I want to known how the paser tree is
built and I debug the source step by step.
I suggest you learn how flex/bison work first. The contents of the *.c
files generated by flex/bison are not generally supposed to be
interpreted by
2011/3/30 aaronenabs aaronen...@btconnect.com:
Hi all i have been trying to compile the sourcecode for postgresql but keep
getting an error message when running it in cygwin.
it states:
dllwrap: gcc exited with status 1
make[3]: *** [cygpq.dll] Error 1
make[3]: Leaving directory
2011/3/30 aaronenabs aaronen...@btconnect.com:
Can you alos advise how i change the the HeapTupleSatisfiesVisibility() to
true within the source code:
[..]
#define HeapTupleSatisfiesVisibility(tuple, snapshot, buffer) \
((*(snapshot)-satisfies) ((tuple)-t_data, snapshot, buffer))
As
2011/4/27 Vlad Arkhipov arhi...@dc.baikal.ru:
I'm currently need predicate locking in the project, so there are two ways
to get it by now: implement it by creating special database records to lock
with SELECT FOR UPDATE or wait while they will be implemented in Postgres
core. Is there
2011/5/11, Bruce Momjian br...@momjian.us:
FYI, because the visibility map is only one _bit_ per page, it is 8000 *
8 or 64k times smaller than the heap, e.g. one 8k page covers 64MB of
heap pages.
Actually, that would be one 8kB block covers 512MB of heap: 1 block
of visibility map (8kB) =
[ Forgot the list. ]
2011/5/12, Yves Weißig weis...@rbg.informatik.tu-darmstadt.de:
I'm currently debugging my developed AM and are running into this problem:
TRAP: FailedAssertion(!(((bool) (((void*)(tid) != ((void *)0))
((tid)-ip_posid != 0, File: indexam.c, Line: 488)
Can anybody
1 - 100 of 127 matches
Mail list logo
