VBTree (Q5977756): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||||||||||||||
(4 intermediate revisions by 2 users not shown) | |||||||||||||||
description / en | description / en | ||||||||||||||
Vector Binary Tree to Make Your Data Management More Efficient | |||||||||||||||
Property / programmed in | |||||||||||||||
Property / programmed in: R / rank | |||||||||||||||
Property / description | |||||||||||||||
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>. | |||||||||||||||
Property / description: 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>. / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / last update | |||||||||||||||
12 January 2024
| |||||||||||||||
Property / last update: 12 January 2024 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier | |||||||||||||||
0.1.0 | |||||||||||||||
Property / software version identifier: 0.1.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.1.0 / qualifier | |||||||||||||||
publication date: 16 September 2018
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.1.1 | |||||||||||||||
Property / software version identifier: 0.1.1 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.1.1 / qualifier | |||||||||||||||
publication date: 12 January 2024
| |||||||||||||||
Property / author | |||||||||||||||
Property / author: Chen Zhang / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / maintained by | |||||||||||||||
Property / maintained by: Chen Zhang / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / copyright license | |||||||||||||||
Property / copyright license: GNU General Public License, version 3.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: tensorA / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: VBTree Tutorial: Automatic Completion of Group Operation on Structural Dataset / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / CRAN project | |||||||||||||||
Property / CRAN project: VBTree / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / programmed in | |||||||||||||||
Property / programmed in: R / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / depends on software | |||||||||||||||
Property / depends on software: R / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / depends on software: R / qualifier | |||||||||||||||
software version identifier: ≥ 2.10 | |||||||||||||||
Property / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI software profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 20:10, 12 March 2024
Vector Binary Tree to Make Your Data Management More Efficient
Language | Label | Description | Also known as |
---|---|---|---|
English | VBTree |
Vector Binary Tree to Make Your Data Management More Efficient |
Statements
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>.
0 references
12 January 2024
0 references