Materialized path
From Wikipedia, the free encyclopedia
 |
This article is an orphan, as few or no other articles link to it. Please introduce links to this page from related articles; suggestions may be available. (October 2009) |
A materialized path is a technique for encoding a tree in a flat data structure. This is often used in relational databases due to single queries returning entire trees as opposed to recursive queries being needed.
[edit] External links
 |
This database-related article is a stub. You can help Wikipedia by expanding it. |
