VBTree (Q5977756): Difference between revisions
From MaRDI portal
Changed label, description and/or aliases in en, and other parts |
Added link to MaRDI item. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / programmed in | |||
| Property / programmed in: R / rank | |||
| Property / depends on software | |||
| Property / depends on software: R / rank | |||
| Property / depends on software: R / qualifier | |||
| 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
