| From | Sent On | Attachments |
|---|---|---|
| Doug Hellmann | May 11, 2012 8:55 am | |
| Loic Dachary | May 11, 2012 12:40 pm | |
| Loic Dachary | May 11, 2012 12:55 pm | |
| Doug Hellmann | May 11, 2012 1:18 pm | |
| Doug Hellmann | May 11, 2012 1:21 pm | |
| Loic Dachary | May 14, 2012 5:22 am | |
| Doug Hellmann | May 14, 2012 7:15 am | |
| Loic Dachary | May 14, 2012 10:03 am | |
| Doug Hellmann | May 14, 2012 1:27 pm | |
| Julien Danjou | May 15, 2012 3:04 am | |
| Loic Dachary | May 15, 2012 4:52 am | |
| Julien Danjou | May 15, 2012 5:21 am | |
| Doug Hellmann | May 15, 2012 7:26 am | |
| Nick Barcet | May 16, 2012 12:31 am | |
| Loic Dachary | May 16, 2012 1:09 am | |
| Julien Danjou | May 16, 2012 2:19 am | |
| Doug Hellmann | May 16, 2012 8:05 am |
| Subject: | Re: [Openstack] [metering] public API design | |
|---|---|---|
| From: | Loic Dachary (lo...@enovance.com) | |
| Date: | May 14, 2012 5:22:22 am | |
| List: | net.launchpad.lists.openstack | |
On 05/11/2012 10:21 PM, Doug Hellmann wrote:
On Fri, May 11, 2012 at 3:40 PM, Loic Dachary <lo...@enovance.com
<mailto:lo...@enovance.com>> wrote:
On 05/11/2012 05:55 PM, Doug Hellmann wrote:
While thinking about this use case I also had a simple idea to optimize the
storage of events and added it to the wiki
http://wiki.openstack.org/EfficientMetering?action=diff&rev2=77&rev1=76
<http://wiki.openstack.org/EfficientMetering?action=diff&rev2=77&rev1=76>
It will probably be just as efficient to handle that during aggregate
calculation one time, rather than trying to do on-the-fly aggregation.
I agree and changed the description accordingly: http://wiki.openstack.org/EfficientMetering?action=diff&rev2=78&rev1=77
-- Loïc Dachary Chief Research Officer // eNovance labs http://labs.enovance.com // ? lo...@enovance.com ? +33 1 49 70 99 82
_______________________________________________ Mailing list: https://launchpad.net/~openstack Post to : open...@lists.launchpad.net Unsubscribe : https://launchpad.net/~openstack More help : https://help.launchpad.net/ListHelp





