#752 closed enhancement (wontfix)
Base Classes for Trees
Reported by: | wiz | Owned by: | Adrian Holovaty |
---|---|---|---|
Component: | Metasystem | Version: | |
Severity: | normal | Keywords: | |
Cc: | Triage Stage: | Unreviewed | |
Has patch: | no | Needs documentation: | no |
Needs tests: | no | Patch needs improvement: | no |
Easy pickings: | no | UI/UX: | no |
Description
Base classes, what could efficiently handle large tree-like structures.
- Recursive handling (delete, move, rebuild, and so)
- Querying for children in some ways, with filters
- Nearest
- By path
- Level[s] slice
- Parents
- Node data types handling. Mapping to other classes.
I think it would be 2 classes: one for handling tree structure and one base class for node items.
Change History (3)
comment:1 by , 19 years ago
comment:2 by , 18 years ago
php has this thing called Nested Set in PEAR. It adds a _lot_ of information to the table, but allows for very efficient subtree selections.
comment:3 by , 18 years ago
Resolution: | → wontfix |
---|---|
Status: | new → closed |
I'm pretty sure this is complex enough (and has enough different possible implamentations) that it really shouldn't be part of Django proper.
Note:
See TracTickets
for help on using tickets.
The best discussion of the issues of hierarchical data in SQL I've seen is Chapter 7 of Practical Issues in Database Management by Fabian Pascal. In short, its not pretty.