The relational model is extremely general, its' been argued (fairly successfully) by Date and Codd to be THE most general model (Graph being a close second). It's a rigorous approach to managing data with integrity.
I used to be a programming language oriented person, was big into data structures and objects, but then I read Date and my mind was blown at how beautiful and expressive the relational model is -- for its intended purpose (managing data for logical integrity and ad hoc queriability).
The main issues are
1. is that many implementations don't include some features such as unions.
2. Certain things (tree traversal) have also been hard to express in older versions of SQL or older versions of Tutorial D (Chris Date's language that's closer to the model).
3. Sometimes you don't care about long term data management (i.e. ad hoc queriability and integrity), you just want programmatic data persistence with pre-baked access paths that are FAST.
4. Relational integrity features are often crude implementations that slow things down too much or require custom triggers.
5. Queriability in reality requires decent knowledge of the physical layout and indexing if you're going to make it performant
6. Most relational databases have not been built in a cloud native era where we assume distribution across ephemeral disks and compute
So... great mathematical model, great way to think through and organize your data for no ambiguity, but the practical implementations leave a lot to be desired.
The problem is that "my data is too complex for the relational model" often means "I haven't thought through my data". Things like maps, unions, ordered sets, N-ary relationships, graphs and trees, are actually quite straight forward to represent in relations. The challenge is many of the lessons and arguments for this are trapped in books from the 70s-90s, not on the Web.