- 07 Feb, 2000 5 commits
-
-
Jan Wieck authored
Jan
-
Tom Lane authored
fields in JoinPaths --- turns out that we do need that after all :-(. Also, rearrange planner so that only one RelOptInfo is created for a particular set of joined base relations, no matter how many different subsets of relations it can be created from. This saves memory and processing time compared to the old method of making a bunch of RelOptInfos and then removing the duplicates. Clean up the jointree iteration logic; not sure if it's better, but I sure find it more readable and plausible now, particularly for the case of 'bushy plans'.
-
Tatsuo Ishii authored
Minor fix
-
Hiroshi Inoue authored
-
Hiroshi Inoue authored
from md.c.
-
- 06 Feb, 2000 4 commits
-
-
Jan Wieck authored
be suppressed. Jan
-
Bruce Momjian authored
regression tests so I prepared a set of expected files to make things look OK. There's also a file to account for minor variations in the geopmetry output and a resultmap patch to pull them all together. With these changes PostgreSQL, from CVS, builds and regression tests (runcheck) cleanly. Keith Parks.
-
Tom Lane authored
nonoverlap_sets() and is_subset() to list.c, where they should have lived to begin with, and rename to nonoverlap_setsi and is_subseti since they only work on integer lists.
-
Tatsuo Ishii authored
fix suggested by Keith Parks.
-
- 05 Feb, 2000 6 commits
-
-
Tom Lane authored
lnext, to eliminate O(N^2) behavior with lots of indexquals.
-
Tom Lane authored
extracting from an AND subclause just those opclauses that are relevant for a particular index. For example, we can now consider using an index on x to process WHERE (x = 1 AND y = 2) OR (x = 2 AND y = 4) OR ...
-
Bruce Momjian authored
-
Tatsuo Ishii authored
it seems more suitable for the naming convention in libpq. New function PQsetClientEncoding added. It makes possible to change the client encoding on the fly without setting PGCLIENTENCODING.
-
Tatsuo Ishii authored
it seems more suitable for the naming convention in libpq.
-
Jan Wieck authored
FOREIGN KEY constraint during CREATE TABLE. Tnx to Stephan. Jan
-
- 04 Feb, 2000 6 commits
-
-
Jan Wieck authored
a FOREIGN KEY constraint. Jan
-
Bruce Momjian authored
-
Jan Wieck authored
Added constraint dumping capability to pg_dump (also from Stephan) Fixed DROP TABLE -> RelationBuildTriggers: 2 record(s) not found for rel error. Fixed little error in gram.y I made the last days. Jan
-
Jan Wieck authored
Jan
-
Bruce Momjian authored
-
Tom Lane authored
the cache context, it didn't bother to free the tuple that CatalogIndexFetchTuple had allocated in the transaction context. Do enough cache lookups in the same xact, and you start to notice...
-
- 03 Feb, 2000 3 commits
-
-
Bruce Momjian authored
-
Tom Lane authored
Group and Unique use an arbitrary assumption that there will be about 10% as many groups as input tuples --- perhaps someday we can refine this.
-
Tom Lane authored
-
- 02 Feb, 2000 8 commits
-
-
Jan Wieck authored
actions performed by analyse.c when creating table constraints. Jan
-
Thomas G. Lockhart authored
-
Thomas G. Lockhart authored
-
Thomas G. Lockhart authored
-
Thomas G. Lockhart authored
-
Thomas G. Lockhart authored
-
Thomas G. Lockhart authored
From pgadmin author on 99-12-24.
-
Peter Eisentraut authored
-
- 31 Jan, 2000 3 commits
-
-
Jan Wieck authored
Jan
-
Tom Lane authored
syscache and relcache flushes). Relcache entry rebuild now preserves original tupledesc, rewrite rules, and triggers if possible, so that pointers to these things remain valid --- if these things change while relcache entry has positive refcount, we elog(ERROR) to avoid later crash. Arrange for xact-local rels to be rebuilt when an SI inval message is seen for them, so that they are updated by CommandCounterIncrement the same as regular rels. (This is useful because of Hiroshi's recent changes to process our own SI messages at CommandCounterIncrement time.) This allows simplification of some routines that previously hacked around the lack of an automatic update. catcache now keeps its own copy of tupledesc for its relation, rather than depending on the relcache's copy; this avoids needing to reinitialize catcache during a cache flush, which saves some cycles and eliminates nasty circularity problems that occur if a cache flush happens while trying to initialize a catcache. Eliminate a number of permanent memory leaks that used to happen during catcache or relcache flush; not least of which was that catcache never freed any cached tuples! (Rule parsetree storage is still leaked, however; will fix that separately.) Nothing done yet about code that uses tuples retrieved by SearchSysCache for longer than is safe.
-
Tom Lane authored
nodes...
-
- 30 Jan, 2000 1 commit
-
-
Byron Nikolaidis authored
Bug fix for LongVarBinary -- begin transaction
-
- 29 Jan, 2000 4 commits
-
-
Tom Lane authored
-
Tom Lane authored
we *always* rebuild, rather than deleting, an invalidated relcache entry that has positive refcount. Otherwise an SI cache overrun leads to dangling Relation pointers all over the place!
-
Bruce Momjian authored
-
Peter Eisentraut authored
Initdb help correction Changed end/abort to commit/rollback and changed related notices Commented out way old printing functions in libpq Fixed a typo in alter table / alter column
-