I cannot seem to find the trick to join two tables through an array column when one table is not an array value, and the other table’s array value can contain multiple values. It does work when there is a single valued array.
Here’s a simple minimal example of what I’m talking about. The real tables have GIN indexes on the array columns FWIW. These do not, but the query behaves the same.
DROP TABLE IF EXISTS eg_person; CREATE TABLE eg_person (id INT PRIMARY KEY, name TEXT); INSERT INTO eg_person (id, name) VALUES (1, 'alice') , (2, 'bob') , (3, 'charlie'); DROP TABLE IF EXISTS eg_assoc; CREATE TABLE eg_assoc (aid INT PRIMARY KEY, actors INT[], benefactors INT[]); INSERT INTO eg_assoc (aid, actors, benefactors) VALUES (1, '{1}' , '{2}') , (2, '{1,2}', '{3}') , (3, '{1}' , '{2,3}') , (4, '{4}' , '{1}'); SELECT aid, actors, a_person.name, benefactors, b_person.name FROM eg_assoc LEFT JOIN eg_person a_person on array[a_person.id] @> eg_assoc.actors LEFT JOIN eg_person b_person on array[b_person.id] @> eg_assoc.benefactors;
The actual results are this like so. The issue here is that name column comes up NULL
if either actors
or benefactors
contains more than one value.
aid | actors | name | benefactors | name -----+--------+-------+-------------+--------- 1 | {1} | alice | {2} | bob 2 | {1,2} | | {3} | charlie 3 | {1} | alice | {2,3} | 4 | {4} | | {1} | alice
I was expecting this:
aid | actors | name | benefactors | name -----+--------+-------+-------------+--------- 1 | {1} | alice | {2} | bob 2 | {1,2} | alice | {3} | charlie 2 | {1,2} | bob | {3} | charlie 3 | {1} | alice | {2,3} | bob 3 | {1} | alice | {2,3} | charlie 4 | {4} | | {1} | alice
It would be really nice if I could get it to look like this, though:
aid | actors | name | benefactors | name -----+--------+-------------+-------------+--------- 1 | {1} | {alice} | {2} | {bob} 2 | {1,2} | {alice,bob} | {3} | {charlie} 3 | {1} | {alice} | {2,3} | {bob, charlie} 4 | {4} | | {1} | {alice}
I’m aware that this schema denormalized, and I’m willing to go to a normal representation if need be. However, this is for a summary query and it already involves a lot more joins than I’d like.
Advertisement
Answer
Yes, the overlap operator &&
could use a GIN index on arrays. Very useful for queries this one to find rows with a given person (1
) among an array of actors:
SELECT * FROM eg_assoc WHERE actors && '{1}'::int[]
However, the logic of your query is the other way round, looking for all persons listed in the arrays in eg_assoc
. A GIN index is no help here. We just need the btree index of the PK person.id
.
Proper queries
Basics:
The following queries preserve original arrays exactly as given, including possible duplicate elements and original order of elements. Works for 1-dimenstional arrays. Additional dimensions are folded into a single dimension. It’s more complex to preserve multiple dimensions (but totally possible):
WITH ORDINALITY
in Postgres 9.4 or later
SELECT aid, actors , ARRAY(SELECT name FROM unnest(e.actors) WITH ORDINALITY a(id, i) JOIN eg_person p USING (id) ORDER BY a.i) AS act_names , benefactors , ARRAY(SELECT name FROM unnest(e.benefactors) WITH ORDINALITY b(id, i) JOIN eg_person USING (id) ORDER BY b.i) AS ben_names FROM eg_assoc e;
LATERAL
queries
For PostgreSQL 9.3+.
SELECT e.aid, e.actors, a.act_names, e.benefactors, b.ben_names FROM eg_assoc e , LATERAL ( SELECT ARRAY( SELECT name FROM generate_subscripts(e.actors, 1) i JOIN eg_person p ON p.id = e.actors[i] ORDER BY i) ) a(act_names) , LATERAL ( SELECT ARRAY( SELECT name FROM generate_subscripts(e.benefactors, 1) i JOIN eg_person p ON p.id = e.benefactors[i] ORDER BY i) ) b(ben_names);
db<>fiddle here with a couple of variants.
Old sqlfiddle
Subtle detail: If a person is not found, it’s just dropped. Both of these queries generate an empty array ('{}'
) if no person is found for the whole array. Other query styles would return NULL
. I added variants to the fiddle.
Correlated subqueries
For Postgres 8.4+ (where generate_subsrcipts()
was introduced):
SELECT aid, actors , ARRAY(SELECT name FROM generate_subscripts(e.actors, 1) i JOIN eg_person p ON p.id = e.actors[i] ORDER BY i) AS act_names , benefactors , ARRAY(SELECT name FROM generate_subscripts(e.benefactors, 1) i JOIN eg_person p ON p.id = e.benefactors[i] ORDER BY i) AS ben_names FROM eg_assoc e;
May still perform best, even in Postgres 9.3.
The ARRAY
constructor is faster than array_agg()
. See:
Your failed query
The query provided by @a_horse seems to do the job, but it is unreliable, misleading, potentially incorrect and needlessly expensive.
Proxy cross join because of two unrelated joins. A sneaky anti-pattern. See:
Fixed superficially with
DISTINCT
inarray_agg()
to eliminates the generated duplicates, but that’s really putting lipstick on a pig. It also eliminates duplicates in the original because its impossible to tell the difference at this point – which is potentially incorrect.The expression
a_person.id = any(eg_assoc.actors)
works, but eliminates duplicates from the result (happens two times in this query), which is wrong unless specified.Original order of array elements is not preserved. This is tricky in general. But it’s aggravated in this query, because actors and benefactors are multiplied and made distinct again, which guarantees arbitrary order.
No column aliases in the outer
SELECT
result in duplicate column names, which makes some clients fails (not working in the fiddle without aliases).min(actors)
andmin(benefactors)
are useless. Normally one would just add the columns toGROUP BY
instead of fake-aggregating them. Buteg_assoc.aid
is the PK column anyway (covering the whole table inGROUP BY
), so that’s not even necessary. Justactors, benefactors
.
Aggregating the whole result is wasted time and effort to begin with. Use a smarter query that doesn’t multiply the base rows, then you don’t have to aggregate them back.