Postgresql – Error: Relation [“table name”] does not exist

postgresqltable

I am trying to create tables based on relational schema, but I get "Relation does not exist" errors for some tables and could not find a way to get out of this. I will display my schema, code, and actual errors below. I really feel this might have a simple solution, but I just got stuck into it..

CREATE TABLE Driver 
( 
Id           CHAR(11)      NOT NULL,
FirstName    VARCHAR(15)   NOT NULL,
LastName     VARCHAR(20)   NOT NULL,     
Phone        CHAR(12)      CHECK (char_length(Phone) > 8),

PRIMARY KEY  (Id)
);

CREATE TABLE Driving 
(
Id           CHAR(11)         REFERENCES Driver ON DELETE CASCADE,
BusId        INT              REFERENCES Bus    ON DELETE CASCADE,

PRIMARY KEY  (Id, BusId)
);

CREATE TABLE Bus
(
BusId    INT           NOT NULL,
Make     VARCHAR(20)   DEFAULT ('Volvo'),
Model    VARCHAR(20),
Year     SMALLINT      NOT NULL    CONSTRAINT ManufacturingYear 
                                         CHECK ((Year > 1970) AND 
                                                (Year < date_part('year', current_date) + 1)),
 Space   SMALLINT      CHECK (Space > 0),
 Route   SERIAL,

 PRIMARY KEY (BusId),
 FOREIGN KEY (Route) REFERENCES Route ON DELETE SET NULL
 );

CREATE TABLE Route
(
RouteId          SERIAL         NOT NULL,
StartingPoint    SMALLINT       NOT NULL,
EndingPoint      SMALLINT       NOT NULL,

PRIMARY KEY(RouteId),
FOREIGN KEY (StartingPoint) REFERENCES Stop,
FOREIGN KEY (EndingPoint) REFERENCES Stop
);

CREATE TABLE RouteStops
(
Route       SERIAL,
Stop        SMALLINT,

PRIMARY KEY(Route, Stop),
FOREIGN KEY (Route)  REFERENCES Route  ON DELETE CASCADE,
FOREIGN KEY (Stop)   REFERENCES Stop   ON DELETE CASCADE
);

CREATE TABLE Stop 
(
StopId    SMALLINT      NOT NULL,
Name      VARCHAR(30)   DEFAULT ('Station'),

PRIMARY KEY(StopId)
);

Errors:

ERROR:  relation "bus" does not exist
ERROR:  relation "route" does not exist
ERROR:  relation "stop" does not exist
ERROR:  relation "route" does not exist

Best Answer

You try to create relations (constraint) before create parent objects, for example:

order #2:

CREATE TABLE Driving 
(
Id           CHAR(11)         REFERENCES Driver ON DELETE CASCADE,
BusId        INT              REFERENCES Bus    ON DELETE CASCADE,

PRIMARY KEY  (Id, BusId)
);

but table Bus at this moment not created.

2 possible solutions:

Create tables in order - from parent to child (not always possible)
Create all tables without constraints and add all of them after

Related Solutions

Postgresql – Postgres multiple joins slow query, how to store default child record

You write:

Each customer can have multiple sites, but only one should be displayed in this list.

Yet, your query retrieves all rows. That would be a point to optimize. But you also do not define which site is to be picked.

Either way, it does not matter much here. Your EXPLAIN shows only 5026 rows for the site scan (5018 for the customer scan). So hardly any customer actually has more than one site. Did you ANALYZE your tables before running EXPLAIN?

From the numbers I see in your EXPLAIN, indexes will give you nothing for this query. Sequential table scans will be the fastest possible way. Half a second is rather slow for 5000 rows, though. Maybe your database needs some general performance tuning?

Maybe the query itself is faster, but "half a second" includes network transfer? EXPLAIN ANALYZE would tell us more.

If this query is your bottleneck, I would suggest you implement a materialized view.

After you provided more information I find that my diagnosis pretty much holds.

The query itself needs 27 ms. Not much of a problem there. "Half a second" was the kind of misunderstanding I had suspected. The slow part is the network transfer (plus ssh encoding / decoding, possibly rendering). You should only retrieve 100 rows, that would solve most of it, even if it means to execute the whole query every time.

If you go the route with a materialized view like I proposed you could add a serial number without gaps to the table plus index on it - by adding a column row_number() OVER (<your sort citeria here>) AS mv_id.

Then you can query:

SELECT *
FROM   materialized_view
WHERE  mv_id >= 2700
AND    mv_id <  2800;

This will perform very fast. LIMIT / OFFSET cannot compete, that needs to compute the whole table before it can sort and pick 100 rows.

pgAdmin timing

When you execute a query from the query tool, the message pane shows something like:

Total query runtime: 62 ms.

And the status line shows the same time. I quote pgAdmin help about that:

The status line will show how long the last query took to complete. If a dataset was returned, not only the elapsed time for server execution is displayed, but also the time to retrieve the data from the server to the Data Output page.

If you want to see the time on the server you need to use SQL EXPLAIN ANALYZE or the built in Shift + F7keyboard shortcut or Query -> Explain analyze. Then, at the bottom of the explain output you get something like this:

Total runtime: 0.269 ms

Postgresql – Possible to have nested inserts in Postgres 8.4

You should be able to do something like this with a writable CTE:

WITH i AS (
   INSERT INTO host (hostname, hostrole) VALUES ('foobar', 'Virtual') RETURNING id
)
INSERT INTO interface (name, mac, host)
SELECT 'eth0', '00:50:56:9d:34:d4', id
FROM i

(untested, but it should be something like that)

Writable CTE is in PostgreSQL 9.1 and up.

Best Answer

Related Solutions

Postgresql – Postgres multiple joins slow query, how to store default child record

pgAdmin timing

Postgresql – Possible to have nested inserts in Postgres 8.4

Related Question