35

Or better said: When to use array as a field data type in a table?

Which solution provides better search results?

Florin
  • 1,379
  • 3
  • 16
  • 21

5 Answers5

17

I avoid arrays for 2 reasons:

  • by storing more than one attribute value in a cell you violate the first normal form (theoretical);
  • you have to perform some extra, non-SQL related, processing each time you need to work with individual elements of the arrays (practical, but a direct consequence of the theoretical one)
Milen A. Radev
  • 60,241
  • 22
  • 105
  • 110
  • 18
    I'm a contractor (construction) and have little time for theory. Does that sound bad? I respect that but I do what comes first and works. Why do rdbms vendors provide array data types (for tables) if it is in violation of theory? – Florin Nov 11 '08 at 13:58
  • 11
    Yep, it sounds bad. Theory exists to provide solid foundation for the engineering. There are various reasons for the fact that SQL vendors ignore theory - they have little time for theory, they don't know the theory, they copy features from competitors etc. – Milen A. Radev Nov 11 '08 at 14:41
  • 10
    Point taken. I go back to my hammer and saw. – Florin Nov 11 '08 at 19:07
  • I wonder if arrays have a niche for creating many-to-many relations that need to be updated atomically. – Rol Jun 27 '21 at 12:13
14

I've considered this problem as well and the conclusion that I came to, is to use arrays when you want to eliminate table joins. The number of elements contained in each array isn't as important as the size of the tables involved. If there are only a few thousand rows in each table, then joining to get the 50 sub rows shouldn't be a big problem. If you get into 10's or 100's of thousands or rows, you're likely to start chewing through a lot of processor time and disk i/o though.

Dana the Sane
  • 14,762
  • 8
  • 58
  • 80
  • I could use the zip per county analogy. A county has so many zips. If a table T record needs to know of two counties, how many zips does the row know of? Do I keep an array of immutable county names in T and county-zip in T2? – Florin Nov 11 '08 at 05:28
  • I believe that GiST indexes can handle that sort of problem. In general, DBMS's don't deal well with this well though. This question also applies http://stackoverflow.com/questions/256997/hierarchical-tagging-in-sql#257106 – Dana the Sane Nov 11 '08 at 06:00
6

Don't know how long these links stay live so I'll paste the results below: http://sqlfiddle.com/#!17/55761/2

TLDR; searching a table index and then joining is fast, BUT adding a GIN index (using gin__int_ops) to a single table with an array column can be faster. Additionally, the flexibility of being able to match "some" or a small number of your array values might be a better option e.g. a tagging system.

create table data (
    id serial primary key,
    tags int[],
    data jsonb
);

create table tags (
    id serial primary key,
    data_id int references data(id)
);

CREATE INDEX gin_tags ON data USING GIN(tags gin__int_ops); 

SET enable_seqscan to off;

with rand as (SELECT generate_series(1,100000) AS id)
insert into data (tags) select '{5}' from rand;

update data set tags = '{1}' where id = 47300;

with rand as (SELECT generate_series(1,100000) AS id)
INSERT INTO tags(data_id) select id from rand;

Running:

  select data.id, data.data, data.tags
  from data, tags where tags.data_id = data.id and tags.id = 47300;

and

  select data.id, data.data, data.tags
  from data where data.tags && '{1}';

Yields:

Record Count: 1; Execution Time: 3ms
QUERY PLAN
Nested Loop (cost=0.58..16.63 rows=1 width=61)
-> Index Scan using tags_pkey on tags (cost=0.29..8.31 rows=1 width=4)
Index Cond: (id = 47300)
-> Index Scan using data_pkey on data (cost=0.29..8.31 rows=1 width=61)
Index Cond: (id = tags.data_id)

and

Record Count: 1; Execution Time: 1ms
QUERY PLAN
Bitmap Heap Scan on data (cost=15.88..718.31 rows=500 width=61)
Recheck Cond: (tags && '{1}'::integer[])
-> Bitmap Index Scan on gin_tags (cost=0.00..15.75 rows=500 width=0)
Index Cond: (tags && '{1}'::integer[])
mattdlockyer
  • 6,984
  • 4
  • 40
  • 44
0

The tables will always provide better search results assuming you're querying something within the actual array. With a subtable, you can index the contents trivially, whereas with an array, you'd have to literally create 50 indexes (one for each potential element within the array).

Will Hartung
  • 115,893
  • 19
  • 128
  • 203
  • I don't think this is the case, from what I've read, you can create indexes on arrays just like any other type of column type. – Dana the Sane Nov 11 '08 at 04:16
  • That may be correct, but all of the examples I saw were using expression indexes tied to specific elements of the array. – Will Hartung Nov 11 '08 at 15:21
  • 1
    No, you don't have to create 50 indexes. You create just one [on the array](https://www.postgresql.org/docs/current/indexes-types.html) –  May 13 '19 at 10:14
0

I think that arrays have to be used for some custom data. But for foreign keys - it's better to use link table (or something else but column per key). This way you have data control at DB level and easy queries for join - you need for join even if you have them in arrays (for full data set) - but arrays much more complicated than "standart" SQL. P.S. Sorry bad english

trashgenerator
  • 460
  • 7
  • 22