Consider the following test setup:
create table t1 (
id int8 primary key,
name varchar not null unique
);
create table t2 (
id int8 primary key,
t1_id int8 not null references t1
);
create table t2a (
primary key(id),
check(t1_id = 1)
) inherits (t2);
create table t2b (
primary key(id),
On Fri, Nov 19, 2010 at 1:41 PM, Scott Ribe scott_r...@elevated-dev.com wrote:
And I tried to make the it only involves a single t1 and matches a single
partition more explicit, but this didn't do it either:
explain with tbl as (select id from t1 where name = 'foo')
select * from t1, t2
On Monday 23 June 2008 15:45:22 Kynn Jones wrote:
On Mon, Jun 23, 2008 at 2:21 PM, Steve Atkins [EMAIL PROTECTED] wrote:
In real use you're unlikely to hit any limits, theoretical or practical,
but if you start to use a silly number of tables and so on you're likely
to hit performance
How can I find the limits (if any) on things such as the maximum number of
tables, views, indices, columns-per-table, size of database, etc.?
(At the moment I'm particularly interested any limits that my exist on the
numbers of tables and views that may exist in any one database.)
TIA!
Kynn
On Jun 23, 2008, at 10:56 AM, Kynn Jones wrote:
How can I find the limits (if any) on things such as the maximum
number of tables, views, indices, columns-per-table, size of
database, etc.?
(At the moment I'm particularly interested any limits that my exist
on the numbers of tables
http://www.postgresql.org/about/
On Mon, 2008-06-23 at 13:56 -0400, Kynn Jones wrote:
How can I find the limits (if any) on things such as the maximum
number of tables, views, indices, columns-per-table, size of database,
etc.?
(At the moment I'm particularly interested any
On Mon, 2008-06-23 at 11:21 -0700, Steve Atkins wrote:
http://www.postgresql.org/about/ has some of the theoretical limits.
In real use you're unlikely to hit any limits, theoretical or
practical, but if you start to use a silly number of tables and so
on
you're likely to hit
On Mon, Jun 23, 2008 at 2:21 PM, Steve Atkins [EMAIL PROTECTED] wrote:
In real use you're unlikely to hit any limits, theoretical or practical,
but if you start to use a silly number of tables and so on you're likely to
hit performance issues eventually. I'm not sure where that threshold
Kynn Jones [EMAIL PROTECTED] writes:
Actually, the DB I have in mind would certainly be approaching silly
territory. I'm looking at a schema with around 10 thousand tables (or
views). Unfortunately, as far as I can tell,
http://www.postgresql.org/about/ says nothing about maximum number of
On Mon, Jun 23, 2008 at 2:45 PM, Kynn Jones [EMAIL PROTECTED] wrote:
Actually, the DB I have in mind would certainly be approaching silly
territory. I'm looking at a schema with around 10 thousand tables (or
views).
What kind of app would require such a schema? Just curious...
--
Sent via
Steve Atkins wrote on 23.06.2008 20:21:
In real use you're unlikely to hit any limits, theoretical or practical,
I imagine that the 1GB column-value limit is something that could be reached
though. Especially for BLOB (aka bytea) or CLOB (aka text) columns.
Thomas
--
Sent via
Thomas Kellerer wrote:
Steve Atkins wrote on 23.06.2008 20:21:
In real use you're unlikely to hit any limits, theoretical or practical,
I imagine that the 1GB column-value limit is something that could be
reached though. Especially for BLOB (aka bytea) or CLOB (aka text) columns.
No, since
[EMAIL PROTECTED] wrote:
Hi All.
My question is simple and plain: Are there some limit in the number of
database operations between a BEGIN statement and a COMMIT statement?
Yes, there is a command counter that is incremented for every command
between BEGIN and COMMIT. It can't exceed 4
On Dec 15, 2007, at 8:29 PM, Bruce Momjian wrote:
[EMAIL PROTECTED] wrote:
Hi All.
My question is simple and plain: Are there some limit in the
number of
database operations between a BEGIN statement and a COMMIT statement?
Yes, there is a command counter that is incremented for every
[EMAIL PROTECTED] writes:
Hi All.
My question is simple and plain: Are there some limit in the number of
database operations between a BEGIN statement and a COMMIT statement?
The most relevant limitation is that the whole body has to fit in 1GB.
You can also only execute 4 billion statements
Hi All.
My question is simple and plain: Are there some limit in the number of
database operations between a BEGIN statement and a COMMIT statement?
Thanks in advance.
Luca
--
Email.it, the professional e-mail, gratis per te: http://www.email.it/f
Sponsor:
Un look da modella in pochi
I found a rather strange but working method to compare the contents of two tables in different databases:
select 'otformularfeld' as which, md5(array_to_string(array(
select md5(id_pkff||id_formular||id_formfeld||id_bf) from otformularfeld where quarant=0 order by id_pkff
),''))
So:
- basically
Are there any practical limits to the number of functions and triggers that
can be applied to any particular table??
Bob
[EMAIL PROTECTED] (Bob Pawley) writes:
Are there any practical limits to the number of functions and
triggers that can be applied to any particular table??
I'd expect it to be rather like Perlis' assertion about procedures
with lots of parameters...
--
let name=cbbrowne and tld=ntlug.org in
Am Samstag, den 04.06.2005, 15:22 -0500 schrieb Bruno Wolff III:
On Sat, Jun 04, 2005 at 21:53:24 +0200,
Joachim Zobel [EMAIL PROTECTED] wrote:
So WITH will allow recursion so I can walk the graph, right? Does this
mean I can recursively join until a terminating condition is reached?
It
Joachim Zobel schrob:
Am Samstag, den 04.06.2005, 15:22 -0500 schrieb Bruno Wolff III:
On Sat, Jun 04, 2005 at 21:53:24 +0200,
Joachim Zobel [EMAIL PROTECTED] wrote:
So WITH will allow recursion so I can walk the graph, right? Does this
mean I can recursively join until a terminating
Am Donnerstag, den 02.06.2005, 12:46 -0700 schrieb Ben:
You mean, you want to be able to say something like:
select isConnected(a,b)
and get back a true/false, or maybe the path?
That seems quite doable in SQL, assuming you either store those results
and simply use sql to retrieve
On Sat, Jun 04, 2005 at 11:31:02 +0200,
Joachim Zobel [EMAIL PROTECTED] wrote:
These are both things I want to avoid. I am not trying to solve a real
world problem, I want to understand the limits of SQL. And it seems that
a plain SELECT that tells me if a path exists is not possible.
Am Samstag, den 04.06.2005, 07:38 -0500 schrieb Bruno Wolff III:
On Sat, Jun 04, 2005 at 11:31:02 +0200,
Joachim Zobel [EMAIL PROTECTED] wrote:
... And it seems that
a plain SELECT that tells me if a path exists is not possible...
When 'WITH' gets implemented then you should be able
On Sat, Jun 04, 2005 at 21:53:24 +0200,
Joachim Zobel [EMAIL PROTECTED] wrote:
Am Samstag, den 04.06.2005, 07:38 -0500 schrieb Bruno Wolff III:
On Sat, Jun 04, 2005 at 11:31:02 +0200,
Joachim Zobel [EMAIL PROTECTED] wrote:
... And it seems that
a plain SELECT that tells me if a
Is anybody else thinking about the limits of SQL? As often I am probably
not the first to ask these questions. Any pointers?
Joe Celko (sp?) has a couple of books on this subject, SQL for Smarties. I
don't recall if he talks about graphs, but does discuss queries on tree
relationships.
--
Is anybody else thinking about the limits of SQL? As often I am probably
not the first to ask these questions. Any pointers?
Joe Celko (sp?) has a couple of books on this subject, SQL for Smarties. I
don't recall if he talks about graphs, but does discuss queries on tree
relationships.
I've
Hi.
I am looking for a way to write a SELECT that finds connectivity
components of a graph or at least for one that given two nodes
determines if there is a path between them. It seems that this is not
possible, no matter what graph representation I choose. Which constructs
from set theory are
You mean, you want to be able to say something like:
select isConnected(a,b)
and get back a true/false, or maybe the path?
That seems quite doable in SQL, assuming you either store those results
and simply use sql to retrieve them, or use a stored proc to compute the
result each time.
On
I'm not sure if it's relevant to your question
http://www-2.cs.cmu.edu/~cache/pg_graph/
pg_graph provides a way of handling graph-based data structures within
the relational database PostgreSQL. In particular, it provides a convenient
means of inserting graphs as BLOB-like objects in the
A couple of links:
http://www.dbazine.com/ofinterest/oi-articles/celko24
http://www.dbmsmag.com/9603d06.html
On Jun 2, 2005, at 2:33 AM, Joachim Zobel wrote:
Hi.
I am looking for a way to write a SELECT that finds connectivity
components of a graph or at least for one that given two nodes
Hi,
I am developing an application that will use the
C API for postgreSQL and I need to know this:
1 - How many tuples can be returned as a result of a
query using a CURSOR? (Is it possible to do a SELECT
* on a table that has 2 million records and OPEN a
CURSOR for that SELECT and show all
Marcos Barreto de Castro [EMAIL PROTECTED] writes:
1 - How many tuples can be returned as a result of a
query using a CURSOR? (Is it possible to do a SELECT
* on a table that has 2 million records and OPEN a
CURSOR for that SELECT and show all records'contents
using FETCH FORWARD, for
On Sat, 9 Jan 1999, Fabrice Scemama wrote:
// Is there a way to select only a range of rows from a table, using a command
// like:
//
// SELECT * FROM table WHERE where_statement LIMIT 50,100;
That doesn't make sense in a relational database by itself since
it's not guaranteed to
Hi,
Is there a way to select only a range of rows from a table, using
a command
like:
SELECT * FROM table WHERE where_statement LIMIT 50,100;
Assuming you use a "Order By" clause to make sure you got the records in the
appropriate order there is a patch file in the "patches" directory of
35 matches
Mail list logo
