Klohto

Klohto

:waving_hand: Heyo,

I’m having a bit of trouble with more complicated order_by in my Ecto query.

  • I have a Document, that has a Category assigned
  • Category can have children or a parent
  • I already have a function that traverses the tree and preloads children, parent or both (the preload in Ecto query goes only one level deep, for more complicated preloading I use the function)
  • The children part should be irrelavant for this question

I would now like to sort/order selected Documents based on the Category and their parent and their parent etc…
Basically, to achieve that Documents are first sorted by the main category and then the following sub categories.

The code looks like this for now (Guideline == Document):

guidelines =
      from(
        g in Guideline,
        left_join: a in assoc(g, :author),
        left_join: c in assoc(g, :category),
        preload: [author: a, category: c],
        where: ^filter,
        select: g,
        # TODO: will not sort correctly when we have more than one parent category
        #
        # 1. Drafts are shown first
        # 2. Then sorted by author
        # 3. Then sorted by "main" category
        # 4. Then sorted by "secondary" category
        # 5. Then sorted by guideline (doc) ID
        #       For UX sake, don't sort by Title or Updated Time,
        #       it just shuffles the docs.
        #       Drafts are always on top, so that's
        #       good enough for editors.
        order_by: [
          desc: g.is_draft,
          asc: g.author_id,
          asc_nulls_first: c.parent_id,
          asc_nulls_first: c.id,
          asc: g.id
        ]
      )

I’m thinking I could check how many parent categories does the document has, preload them all with my function and create a order_by with multiple c.parent.id based on the count.

So the partial created order_by for 3 levels deep category would like (PS. I’m not sure whether this would work, I don’t think I can query that deep) :

      order_by =
        [
          asc_nulls_first: c.parent.parent.parent.id,
          asc_nulls_first: c.parent.parent.id,
          asc_nulls_first: c.parent.id,
          asc_nulls_first: c.id
        ]```

Showing Posts 2 to 1

Klohto

Klohto OP

Yep, correct! The “potentially different number” should be guarded by my traverse/preload function, where I enumerate how many parent categories does the doc have and based on that number I create the maximal c.parent.parent.parent… I was thinking a macro or something.

I really like the UI change. I kept thinking from backend perspective, but you’re definitely correct that sorting based on more than 2 categories has minor benefit.

joey_the_snake

joey_the_snake

I’m thinking I could check how many parent categories does the document has, preload them all with my function and create a order_by with multiple c.parent.id based on the count.

I might misunderstand, but it looks like you are trying to sort your documents, correct? If so then you will be sorting over entires that potentially have different numbers of parent categories. i.e. c.parent.parent.parent.id might not exist for some documents.

Some strategies I can think of, without knowing your use case too well:

  • Pre-compute the category hierarchy for each document and save it in a separate field. Then you can order by a single column. There is extra overhead in maintaining this field whenever the categories change, but for your use case this might be more efficient than computing and sorting the hierarchy every time the information is fetched.
  • Change your UI so that it is only showing the category that is assigned to the document and then give them the ability to view the hierarchy for a single document when they click on something.
— All posts loaded —

Where Next? Top

Trending in Questions Top

RSP87
I’m working on a project that simulates the bumbl example in the programming phoenix book. It acts almost like an email client. We have a...
New
kszambelanczyk
Hello! Could someone please give me a help/sample code, how to delete a file from s3 using waffle/waffle_ecto from Phoenix app. I creat...
New
RemyXRenard
I’m seeing that a list inside a Kino.DataTable will be interpreted as a charlist, even if the Kino.configure() is set to charlists: :as_l...
New
velrest
So my question is quite simple and i have found no conclusive answer on forum, google or AI. Should we use :erlang.float for Integer to ...
New
samoloth
Hi, I’ve just set up an application with ash_authentication. There is only magic link strategy for now, so there is no confirmation add o...
New
nseaSeb
Hello, I know there is an approach for handling lists that allows for optimized traversal, but I can’t recall the specific method (somet...
New
FlyingNoodle
If a change or preparation module uses Ash.Changeset.get_argument/2 or Ash.Query.get_argument/2 (or any of the other get_argument functio...
New

Other Trending Topics Top

mudasobwa
I am happy to introduce the very α version of the new programming language compiled to BEAM. Welcome Cure. It has literally three kille...
New
marciok
Hi there! We created Gust: A task orchestrator inspired by Airflow. For those who have never heard about Aiflow, it’s a Python-based wor...
New
jimsynz
Beam Bots (or just BB for short) is a framework for building fault-tolerant robotics applications in Elixir using familiar OTP patterns. ...
New
Dmk
Xamal is a deployment tool for Elixir apps that deploys native releases to bare metal servers over SSH. It’s a port of GitHub - basecamp/...
New
Damirados
Hello everyone. After busy few months I am happy to announce v0.1.0 of Emerge & Solve. They are GUI (Emerge) and State management (S...
New
netoum
Corex is an accessible, unstyled UI component library for Phoenix that integrates Zag.js state machines using Vanilla JavaScript and Live...
New

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews