VBTree

From MaRDI portal
Revision as of 20:10, 12 March 2024 by Import240312060351 (talk | contribs) (Created automatically from import240312060351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:5977756



CRANVBTreeMaRDI QIDQ5977756

Vector Binary Tree to Make Your Data Management More Efficient

Chen Zhang

Last update: 12 January 2024

Software version identifier: 0.1.0, 0.1.1


Copyright license: GNU General Public License, version 3.0

Vector binary tree provides a new data structure, to make your data visiting and management more efficient. If the data has structured column names, it can read these names and factorize them through specific split pattern, then build the mappings within double list, vector binary tree, array and tensor mutually, through which the batched data processing is achievable easily. The methods of array and tensor are also applicable. Detailed methods are described in Chen Zhang et al. (2020) <doi:10.35566/isdsa2019c8>.