https://github.com/lemire/hierarchicalbinbuffering
Hierarchical Bin Buffering C++ Library
https://github.com/lemire/hierarchicalbinbuffering
Last synced: 5 months ago
JSON representation
Hierarchical Bin Buffering C++ Library
- Host: GitHub
- URL: https://github.com/lemire/hierarchicalbinbuffering
- Owner: lemire
- Created: 2015-03-12T23:04:24.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2015-03-13T14:13:55.000Z (over 11 years ago)
- Last Synced: 2025-04-13T12:28:25.059Z (over 1 year ago)
- Language: C++
- Homepage:
- Size: 523 KB
- Stars: 5
- Watchers: 5
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
#Hierarchical Bin Buffering C++ Library
Daniel Lemire and Owen Kaser
This is the C++ source code for the paper:
Daniel Lemire and Owen Kaser, Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays, ACM Transactions on Algorithms 4 (1), pages 1-31, 2008.
http://arxiv.org/abs/cs.DS/0610128
This paper includes a survey as well as new methods to precompute
polynomial range queries, as they are used in polynomial curve fitting
and statistics.
Examples of queries that can be written as polynomial range queries
include: the sum of the array between index i and index j,
the center of mass of the array between the index i and the index j, and
so on.
To build the software, do (gcc toolchain is required):
1) Go to the dubuc directory and type "make", this builds some of the essential stuff;
2) Go to lemurcore and type "make";
3) Still in the dubuc director, type "make benchmark1";
To check the code, type "make test"