P5-dbix-class-tree

Jul 20, 2023

Perl extension to manipulate and analyze tree structured data

This module provides methods for working with adjacency lists. The adjacency list model is a very common way of representing a tree structure. In this model each row in a table has a prent ID column that references the primary key of another row in the same table. Because of this the primary key must only be one column and is usually some sort of integer. The row with a parent ID of 0 is the root node and is usually the parent of all other rows. Although, there is no limitation in this module that would stop you from having multiple root nodes.



Checkout these related ports:
  • Zodb3 - Z - Object Database for python
  • Zodb - Python object-oriented database
  • Zabbix22-libzbxpgsql - Zabbix agent module for comprehensive monitoring of PostgreSQL servers
  • Xtrabackup8 - Open-source backup tool for InnoDB and XtraDB
  • Xtrabackup - OpenSource version of InnoDB backup with support of Percona extensions
  • Xrootd - Framework for fast, low latency, scalable data access
  • Xls2txt - Utilities to convert spreadsheet files to text and csv formats
  • Xapian-core12 - Probabilistic text search database engine
  • Xapian-core10 - Probabilistic text search database engine
  • Xapian-core - Probabilistic text search database engine
  • Xapian-bindings12 - Bindings allowing Xapian to be used from various programming languages
  • Xapian-bindings - Bindings allowing Xapian to be used from various programming languages
  • Wfb2sql - CIA World Fact Book to SQL Conversion Utility
  • Webdis - HTTP interface for Redis
  • Vsqlite - Well designed and portable SQLite3 Wrapper for C++