HongoDB | opaleye | |
---|---|---|
- | 9 | |
12 | 605 | |
- | - | |
0.0 | 8.3 | |
over 13 years ago | about 1 month ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
HongoDB
We haven't tracked posts mentioning HongoDB yet.
Tracking mentions began in Dec 2020.
opaleye
-
What's your favorite Database EDSL/library in Haskell?
If you ever have any questions about Opaleye I'm happy to help. Feel free to open an issue to ask about anything any time.
-
Persistent vs. beam for production database
Sounds like Opaleye isn't on your list of choices, but if it is then feel free to ask me any questions, any time by filing an issue (I'm the Opaleye maintainer).
-
How to build a large-scale haskell backend for a photo sharing app (some questions)
Opaleye is Posgres-only, and Postgres does such a good job of optimizing queries that performance issues basically don't arise. I have a long-standing invitation to improve Opaleye's query generation as soon as anyone can produce a repeatable example of a poorly-performing query. In Opaleye's eight years, no one ever has. There's a thread where two reports have come close, but it's still not clear that that's simply due to using a six year old version of Postgres.
- What are things that the Haskell scene lacks the most?
-
Out of memory when building product-profunctors
Nice! Well done. If you have any more questions about product-profunctors or Opaleye then please let me know. It's best to ask by [opening an issue](https://github.com/tomjaguarpaw/haskell-opaleye/issues/new).
- Embedded Pattern Matching
- How to simply do opaleye field type conversion
-
Against SQL
The only way out that I can see is to design embedded domain specific languages (EDSLs) that inherit the expressiveness, composability and type safety from the host language. That's what Opaleye and Rel8 (Postgres EDSLs for Haskell do. Haskell is particularly good for this. The query language can be just a monad and therefore users can carry all of their knowledge of monadic programming to writing database queries.
This approach doesn't resolve all of the author's complaints but it does solve many.
Disclaimer: I'm the author of Opaleye. Rel8 is built on Opaleye. Other relational query EDSLs are available.
[1] https://github.com/tomjaguarpaw/haskell-opaleye/
-
Combining Deep and Shallow Embedding of Domain-Specific Languages
For an example of how this plays out in practice observe Opaleye's MaybeFields (generously contributed by Shane and /u/ocharles at Circuithub). The definition is essentially identical to Optional from the paper. Instead of a specialised typeclass Inhabited we use the ProductProfunctor NullSpec (which happens to conjure up an SQL NULL, but it could be any other witness).
What are some alternatives?
pool-conduit - Persistence interface for Haskell allowing multiple storage methods.
esqueleto - Bare bones, type-safe EDSL for SQL queries on persistent backends.
acid-state - Add ACID guarantees to any serializable Haskell data structure
mywatch
mysql-haskell - Pure haskell mysql driver
HDBC - Haskell Database Connectivity
groundhog - This library maps datatypes to a relational model, in a way similar to what ORM libraries do in OOP. See the tutorial https://www.schoolofhaskell.com/user/lykahb/groundhog for introduction
database-migrate - database-migrate haskell library to assist with migration for *-simple sql backends.
hedis - A Redis client library for Haskell.
squeal-postgresql - Squeal, a deep embedding of SQL in Haskell
erd - Translates a plain text description of a relational database schema to a graphical entity-relationship diagram.
rel8 - Hey! Hey! Can u rel8?