haxl: A Haskell library for efficient, concurrent, and concise data access.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- 'ghc-options: -main-is' is not portable.
- 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
- Exposed modules use unallocated top-level names: Haxl
Haxl is a library and EDSL for efficient scheduling of concurrent data accesses with a concise applicative API.
To use Haxl, you need to implement one or more data sources, which provide the means for accessing remote data or other I/O that you want to perform using Haxl.
Haxl provides two top-level modules:
Data-source implementations import Haxl.Core,
Client code import your data sources and Haxl.Prelude, or some other client-level API that you provide.
[Skip to Readme]
Properties
| Versions | 0.1.0.0, 0.2.0.0, 0.3.0.0, 0.3.1.0, 0.4.0.0, 0.4.0.1, 0.4.0.2, 0.5.0.0, 0.5.1.0, 0.5.1.0, 2.0.0.0, 2.0.1.0, 2.0.1.1, 2.1.2.0, 2.3.0.0, 2.4.0.0, 2.5.1.0 |
|---|---|
| Change log | changelog.md |
| Dependencies | aeson (>=0.6 && <1.3), base (>=4 && <5), binary (>=0.7 && <0.10), bytestring (>=0.9 && <0.11), containers (>=0.5 && <0.6), deepseq, exceptions (>=0.8 && <0.9), filepath (>=1.3 && <1.5), ghc-prim, hashable (>=1.2 && <1.3), haxl, HUnit (>=1.2 && <1.7), pretty (>=1.1 && <1.2), text (>=1.2.1.0 && <1.3), time (>=1.4 && <1.9), transformers, unordered-containers (>=0.2 && <0.3), vector (>=0.10 && <0.13) [details] |
| License | LicenseRef-OtherLicense[multiple license files] |
| Copyright | Copyright (c) 2014-present, Facebook, Inc. |
| Author | Facebook, Inc. |
| Maintainer | The Haxl Team <haxl-team@fb.com> |
| Category | Concurrency |
| Home page | https://github.com/facebook/Haxl |
| Bug tracker | https://github.com/facebook/Haxl/issues |
| Uploaded | by niteria at 2017-07-25T11:51:04Z |
Modules
[Index]
Downloads
- haxl-0.5.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees
Readme for haxl-0.5.1.0
[back to package description]
Haxl
Haxl is a Haskell library that simplifies access to remote data, such as databases or web-based services. Haxl can automatically
- batch multiple requests to the same data source,
- request data from multiple data sources concurrently,
- cache previous requests.
Having all this handled for you behind the scenes means that your data-fetching code can be much cleaner and clearer than it would otherwise be if it had to worry about optimizing data-fetching. We'll give some examples of how this works in the pages linked below.
There are two Haskell packages here:
haxl: The core Haxl frameworkhaxl-facebook(in example/facebook): An (incomplete) example data source for accessing the Facebook Graph API
To use Haxl in your own application, you will likely need to build one or more
data sources: the thin layer between Haxl and the data that you want
to fetch, be it a database, a web API, a cloud service, or whatever.
The haxl-facebook package shows how we might build a Haxl data
source based on the existing fb package for talking to the Facebook
Graph API.
Where to go next?
-
The Story of Haxl explains how Haxl came about at Facebook, and discusses our particular use case.
-
An example Facebook data source walks through building an example data source that queries the Facebook Graph API concurrently.
-
The N+1 Selects Problem explains how Haxl can address a common performance problem with SQL queries by automatically batching multiple queries into a single query, without the programmer having to specify this behavior.
-
Haxl Documentation on Hackage.
-
There is no Fork: An Abstraction for Efficient, Concurrent, and Concise Data Access, our paper on Haxl, accepted for publication at ICFP'14.
