|
|
|
|
References
|
|
| |
| 1. |
O'Neil P., O'Neil E., Pal S., Cseri I., Schaller G., Westbury N., “ORDPATHs: Insert-Friendly XML Node Labels”, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, 2004, 903–908 http://www.cse.iitb.ac.in/infolab/Data/Courses/CS632/2014/2007/Papers/ordpath.pdf  |
| 2. |
PostgreSQL index - ltree URL: https://www.postgresql.org |
| 3. |
Guttman A., “R-trees: A dynamic index structure for spatial searching”, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 1984, 47-57 |
| 4. |
Zabavskyy A., Closure Table Pattern to Model Hierarchies in NoSQL URL: https://towardsdatascience.com |
| 5. |
Oracle - Hierarchical Queries URL: https://docs.oracle.com |
| 6. |
Abdelali E., Mazouz S. et al., “Different approaches to modeling the trees data in relational database”, International Journal of Computer Applications, 53:18 (2012) |
| 7. |
Tropashko V., Nested Intervals Tree Encoding with Continued Fraction, 2004 arXiv preprint cs/0402051 |
| 8. |
Tropashko V., “Nested intervals tree encoding in SQL”, ACM SIGMOD Record, 34:2 (2005), 47–52 |
| 9. |
Tropashko V., Trees in SQL: Nested Sets and Materialized Path, 2002 URL: www.dbazine.com/tropashko4.shtml |
| 10. |
Tropashko V., Nested Intervals with Farey Fractions, 2004 URL: arXiv preprint cs.DB/0401014 |
| 11. |
Celko J., Joe Celko's SQL for Smarties: Trees and Hierarchies, Morgan Kaufmann Publishers Inc, San Francisco, 2004, 436 pp. |
| 12. |
Celko J., SQL for Smarties: Advanced SQL Programming, Morgan Kaufmann Publishers Inc, San Francisco, 1999, 576 pp. |
| 13. |
Celko J., Thinking in Auxiliary Sets, Temporal, and Virtual Tables in SQL, Morgan Kaufmann Publishers Inc, Burlington, 2008, 576 pp. |
| 14. |
Celko J., SQL for Smarties: Advanced SQL Programming, third edition, Morgan Kaufmann Publishers Inc, San Francisco, 2005, 576 pp. |
| 15. |
Celko J., SQL for Smarties: Advanced SQL Programming, fourth edition, Morgan Kaufmann Publishers Inc, Burlington, 2011 |
| 16. |
Leiserson Ch. E., Prokop H., Randall K. H., “Using de Bruijn sequences to index a 1 in a computer word”, Available on the Internet from http://supertech.csail.mit.edu/papers.html, 3:5 (1998) |
| 17. |
Anderson S., Count the consecutive zero bits (trailing) on the right with modulus division and lookup URL: https://graphics.stanford.edu/, 2005 |
| 18. |
Anderson S., Reverse bits in word by lookup table URL: https://graphics.stanford.edu/, 2005 |
| 19. |
Kernighan W. B., Ritchie D., The C programming language, Pearson Education Asia, Burlington, 2002 |
| 20. |
Beeler M., Gosper R.W., Schroeppel R. H., MIT Artificial intelligence memo, v. 239, Feb, Burlington, 1972 |
| 21. |
Anderson S., Interleave bits by table lookup InterleaveTableLookup, 2005 |
