An Efficient Algorithm to Count the Relations in a Range of Binary Relations Represented by a k²-Tree
Two sets A and B, whose elements fulfill a total order on operator ≤, can have a binary relation R ⊆ A × B represented by the k<sup>2</sup>-tree compact data structure, which greatly improves storage space. Currently, Count query is managed by either usin...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9316722/ |