haskell-beam/beam

Idea: Optimize simple boolean filters

Open

#93 opened on Dec 4, 2017

View on GitHub
 (1 comment) (0 reactions) (0 assignees)Haskell (191 forks)auto 404
enhancementgood first issue

Repository metrics

Stars
 (631 stars)
PR merge metrics
 (PR metrics pending)

Description

I often have conditional filtering in my queries which causes beam to produce where clauses that look like WHERE ((true) AND (true)) AND (true).... It seems it would be easy to clean this up when building the queries by just realizing that a known (val_ True) combined with &&. can simplify to one side or the other. I'm not sure if this is "in-scope" with this project, but if it were easy, it would make the resulting queries cleaner.

I could see an argument against this if one wanted to have a very clear 1-to-1 correspondence between the beam DSL and generated SQL.

Contributor guide

Research direction
Examine how beam generates WHERE clauses and find where boolean constants are combined. Implement simplification by reducing known boolean values in conjuncts/disjuncts.
Tech stack
haskell
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
HaskellGit
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60