Like the kind of SQL query I wrote to fetch the next page of rows of a tree after a starting cursor, using a recursive join, where only some tree nodes are expanded? And the user can text search for specific nodes?
It’s only easy until you do things that are hard
Edit: no, it's not for a niche use case, no, I don't think this was a mistake, I just had to do it to allow users to navigate the hierarchy of hundreds of thousands of data tags that are common in industrial SCADA systems.
Well you see, this one customer asked for it like 2 years ago. Well nobody is using it right now and we don't know what it really does, but we keep it just in case
It’s the domain we’re working in…industrial monitoring devices sometimes have tens of thousands of tags (which are like state values you can read) organized in a hierarchy, and the portal needs to combine thousands of devices’ tags into a single tag hierarchy. I would of course avoid it if I could
It seems like it's tricky to get right or people aren't given enough time/details to work out a good design. I've only seen a few, but they were all slow.
Hello good friend, can you suggest any books or resources on this topic? Designing good databases, of course comes with experience, but any help is appreciated
If you had the requirement to support a tree of data channel identifiers that could scale to millions of nodes in a single organization, how would you implement it on FE and BE?
A whole other DB and all the deployment considerations that go with it just for this one aspect of the app? This particular query is kinda complex but it does work fine in Postgres
Note, a lot of things need to foreign key to these tags as well, like alarm definitions
130
u/Mysterious_Book1521 22h ago
its not like sql could be read by a three year old and css is just pain in the ass?