-
Most optimum way to search a column containing a list of values
Hello,
I have a table with ‘parent’ and ‘child’ columns containing an id. I have another column named ‘chain’ that is a list containing id’s of parents all the way to the root. This means that for a given row, the chain column contains the path to the root node.Now what I’d like to do is find all rows whose chain column contains a particular id. I have the following:
select from table where id in/:chainIs there a better way to achieve this? I’m looking to see if this can be improved either by redoing the query or a reorganization of the data.
-
1 Reply
-
Can you make up a sample table with a few rows of data and share the q code?
It’ll help people understand your use-case and make it easier for them to answer the question.
You can see details on how to include a code block:
1. What datatype are you using for ids?
2. How many rows do you expect to be in the final table?
3. Will the table live on disk or in memory?
4. Will it receive a lot of updates or be mostly static?
5. What will the average length of a chain be?
6. You name the column ‘child’, so each node can only have one child? Or would ‘children’ make more sense? as a list?
One basic unoptimized example using .z.s self to get the parenting chain of each row
q)tree:([] row:til 5;parent:0N 0 0 1 1) q)tree row parent ---------- 0 1 0 2 0 3 1 4 1 q)getChain:{[c;r] $[null p:tree[r]`parent;c,p;.z.s[c,p;p]]} q)getChain[();4] 1 0 0N q)update chain:getChain[()] each row from tree row parent chain ----------------- 0 ,0N 1 0 0 0N 2 0 0 0N 3 1 1 0 0N 4 1 1 0 0NThese links to existing resources may also be of use:
Log in to reply.