# MatrixTreeEncoding

**Repository Path**: mirrors_hekailiang/MatrixTreeEncoding

## Basic Information

- **Project Name**: MatrixTreeEncoding
- **Description**: Encodes tree structure as nested set interval as described by Dan Hazel (2008) and Vadim Tropashko (2005). WIP!
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2022-09-02
- **Last Updated**: 2025-12-13

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

Work in Progress!

# MatrixTreeEncoding
Encodes tree structure as nested set interval as described by:  
Dan Hazel (2008) using alternating continued fractions and 
Vadim Tropashko (2005) using additive continued fractions.

## References
* Hazel, D. (2008). Using rational numbers to key nested sets. arXiv preprint [arXiv:0806.3115](https://arxiv.org/pdf/0806.3115.pdf). 
* Tropashko, Vadim. (2005). Abstract Nested Intervals Tree Encoding in SQL. SIGMOD Record. 34. 47-52. [10.1145/1083784.1083793](https://www.researchgate.net/publication/220416044_Abstract_Nested_Intervals_Tree_Encoding_in_SQL).
[SQL Design Patterns](https://vadimtropashko.files.wordpress.com/2011/07/ch5.pdf)