- 04 6月, 2002 4 次提交
-
-
由 Barry Lind 提交于
fixed bug reported by Noel Rappin (nrappin@sockeye.com) java Array type handled Timestamps incorrectly
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
with the Cursor object's fetchmany() method. The API and inline documentation state that the default is 1. It currently defaults to 5. Patrick Macdonald
-
由 Bruce Momjian 提交于
-
- 03 6月, 2002 5 次提交
-
-
由 Bruce Momjian 提交于
CONSTRAINTS. Neil Conway <neilconway@rogers.com>
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
由 Bruce Momjian 提交于
-
- 02 6月, 2002 3 次提交
-
-
由 Peter Eisentraut 提交于
-
由 Peter Eisentraut 提交于
-
由 Bruce Momjian 提交于
> * Add FILLFACTOR to btree index creation
-
- 01 6月, 2002 1 次提交
-
-
由 Thomas G. Lockhart 提交于
precision storage format. Previously applied the same math as used for the 64-bit integer storage format case, which was wrong. Problem introduced recently when the 64-bit storage format was implemented.
-
- 31 5月, 2002 3 次提交
-
-
由 Tom Lane 提交于
-
由 Dave Cramer 提交于
-
由 Dave Cramer 提交于
-
- 30 5月, 2002 1 次提交
-
-
由 Tom Lane 提交于
a multicolumn-capable index AM *must* support nulls in index columns after the first one.
-
- 29 5月, 2002 8 次提交
-
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
that would do the wrong thing with BLOB OIDs exceeding 2G.
-
由 Bruce Momjian 提交于
> * Add BSD-licensed qsort() for Solaris
-
由 Tom Lane 提交于
one immediately upon forking to handle a new connection, and one after the authentication cycle is finished. Per today's pggeneral discussion.
-
由 Tom Lane 提交于
having names conflicting with system objects will work --- the search path is now user-schema, pg_catalog rather than implicitly the other way around. Note this requires being careful to explicitly qualify references to system names whenever pg_catalog is not first in the search path. Also, add support for dumping ACLs of schemas.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
quotes only when necessary.
-
由 Peter Eisentraut 提交于
Makefile.shlib system, not MakeMaker.
-
- 28 5月, 2002 5 次提交
-
-
由 Tom Lane 提交于
Patch from Teodor Sigaev.
-
由 Tom Lane 提交于
Patch from Teodor Sigaev.
-
由 Bruce Momjian 提交于
> * Add BSD-licensed qsort() for 32-bit Solaris
-
由 Tom Lane 提交于
From Joe Conway.
-
由 Tom Lane 提交于
where the latter is made slightly larger to allow for in-memory tuples containing resjunk attributes. Responds to today's complaint that one cannot UPDATE a table containing the allegedly-legal maximum number of columns. Also, apply Manfred Koizar's recent patch to avoid extra alignment padding when there is a null bitmap. This saves bytes in some cases while not creating any backward-compatibility problem AFAICS.
-
- 26 5月, 2002 3 次提交
-
-
由 Bruce Momjian 提交于
> * Add getpid() function to backend
-
由 Tom Lane 提交于
and just slow down normal operations (only fractionally, but a cycle saved is a cycle earned). Improve documentation of AMI_OVERRIDE behavior.
-
由 Tom Lane 提交于
-
- 25 5月, 2002 5 次提交
-
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
wasn't seen before, maybe the Tcl compiler flags were less strict.
-
由 Tom Lane 提交于
-
由 Tom Lane 提交于
transaction, so as to avoid returning them out of the index AM. Saves repeated heap_fetch operations on frequently-updated rows. Also detect queries on unique keys (equality to all columns of a unique index), and don't bother continuing scan once we have found first match. Killing is implemented in the btree and hash AMs, but not yet in rtree or gist, because there isn't an equally convenient place to do it in those AMs (the outer amgetnext routine can't do it without re-pinning the index page). Did some small cleanup on APIs of HeapTupleSatisfies, heap_fetch, and index_insert to make this a little easier.
-
由 Peter Eisentraut 提交于
system, not Tcl-provided one. Make sure export file, if any, is cleaned. Tcl configuration is now read directly in configure and recorded in Makefile.global. This eliminates some duplicate efforts and allows for easier hand-editing of the results, if necessary.
-
- 23 5月, 2002 2 次提交
-
-
由 Tom Lane 提交于
to do profiling on Cygwin, per report from Dave Page.
-
由 Tom Lane 提交于
exemplified by bug #671. Moving the storage to relcache turned out to be a bad idea because relcache might decide to discard the info. Instead, open and close the relcache entry on each sequence operation, and use a record of the current XID to discover whether we already hold AccessShareLock on the sequence.
-