forked from tlk00/BitMagic
-
Notifications
You must be signed in to change notification settings - Fork 0
BitMagic Library
License
michkhol/BitMagic
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
BitMagic Library Algorithms and tools for integer set algebra operations used for information retrieval, indexing of databases, scientific algorithms, ranking, clustering and signal processing. BitMagic library uses compressed bit-vectors as a main vehicle for implementing set algebraic operations, because of high efficiency and bit-level parallelism of this representation. To compress memory it uses delta / prefix sum coding. One of our goals is constant improvement of performance via SIMD vectorization (SSE2, SSE4.2, AVX2), CPU cache-friendly algorithms and data-parallel thread-safe structures. Features: - compressed bit-vector container with mechanisms to iterate integer set it represents - set algebraic operations: AND, OR, XOR, MINUS on bit-vectors and integer sets - serialization/hybernation of bit-vector containers into compressed BLOBs for persistence (or in-RAM compression) - set algebraic operations on compressed BLOBs (on the fly deserialization with set-algebraic function) - statistical algorithms to efficiently construct similarity and distance metrics, measure similarity between bit-vectors, integer sets and compressed BLOBs - operations with rank: population count distances on bit-vector - sparse vector(s) for native int types using bit transposition and separate compression of bit-plains, with support of NULL values (unassigned) for construction of in-memory columnar structures. Bit-transposed sparse vectors can be used for on-the fly compression of astronomical, molecular biology or other data, efficient store of associations for graphs, etc. - algorithms on sparse vectors: dynamic range clipping, search, group theory image (re-mapping). Collection of algorithms is increasing, please check our samples and the API lists. Features In Progress: - compressed binary relational and adjacency matrixes and operations on matrixes for Entity-Relationship acceleration, graph operations, materialized RDBMS joins, etc - portable C-library layer working as a bridge to high level languages like Python, Java, Scala, .Net Please visit our repository at: https://github.com/tlk00/BitMagicC License: - Apache 2.0 How to build BitMagic library: BitMagic C++ is a header-only software package and you probably can just take the sources and put it into your project directly. All library sources are in src directory. However if you want to use our makefiles you need to follow the next simple instructions: Unix: ----- 1. Traditional (in-place build) - Apply environment variables by runing bmenv.sh : $ . bmenv.sh - use GNU make (gmake) to build installation. $gmake rebuild or (DEBUG version) $gmake DEBUG=YES rebuild The default compiler on Unix and CygWin is g++. If you want to change the default you can do that in makefile.in (should be pretty easy to do) 2. CMake based build Project now comes with a set of makefiles for cmake, you can just build it or generate project files for any cmake-supported environment. Windows: -------- If you use cygwin installation please follow general Unix recommendations. MSVC - solution and projects are available via CMAKE generation MacOS --------- XCODE - project files are available via CMAKE generation ================================================================================= API documentation and examples: http://www.bitmagic.io/apis.html Fine tuning and optimizations: ------------------------------ All BM fine tuning parameters are controlled by the preprocessor defines. ================================================================================= BM library supports CXX-11. Move semantics, noexept, etc. use #define BM_NO_CXX11 to explicitly disable use of CXX11 features for your build. ================================================================================= BM library includes some code optimized for 64-bit systems. This optimization gets applied automatically. BM library contains hand tuned code (intrinsics) for SIMD extensions SSE2, SSE4.2, AVX2. To turn on SSE2 optimization #define BMSSE2OPT in your build environment. To use SSE4.2 #define BMSSE42OPT (this enables hardware popcount via intrinsics). SSE42 optimization automatically assumes SSE2 as a subset of SSE4.2. (you don’t need to use both BMSSE2OPT and BMSSE42OPT). You will need compiler supporting Intel SIMD intrinsics (MSVC, GCC - are ok). To turn on AVX2 - #define BMAVX2OPT This will automatically enable AVX2 256-bit SIMD, popcount (SSE4.2) and other compatible hardware instructions. BM library does NOT support multiple code paths and runtime CPU identification. You have to build specifically for your target system or use default portable build. To correctly build for the target SIMD instruction set - please set correct code generation flags for the build environment. BitMagic examples and tests can be build with GCC using cmd-line settings: make BMOPTFLAGS=-DBMAVX2OPT rebuild or make BMOPTFLAGS=-DBMSSE42OPT rebuild It automatically applies the right set of compiler (GCC) flags for the target build. CMAKE cd build cmake -DBMOPTFLAGS:STRING=BMSSE42OPT .. make OR cmake -DBMOPTFLAGS:STRING=BMAVX2OPT .. ================================================================================= BM library supports "restrict" keyword, some compilers (for example Intel C++) generate better code (out of order load-stores) when restrict keyword is helping. This option is turned OFF by default since most of the C++ compilers does not support it. To turn it ON please #define BM_HASRESTRICT in your project. Some compilers use "__restrict" keyword for this purpose. To correct it define BMRESTRICT macro to correct keyword. ================================================================================= If you want to use BM library in STL-free project you need to define BM_NO_STL variable. It will disable inclusion of certain headers and also will make bm::bvector<> iterators incompatible with STL algorithms (which you said you are not using anyway). This rule only applies to the core bm::bvector<> methods. Auxiliary algorithms may still use STL. ================================================================================= Thank you for using BitMagic library! e-mail: [email protected] WEB site: http://bitmagic.io
About
BitMagic Library
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published
Languages
- C++ 92.7%
- C 4.9%
- Makefile 1.5%
- Other 0.9%