Trees in the database: Advanced data structures
Storing tree structures in a bi-dimensional table has always been problematic. The simplest tree models are usually quite inefficient, while more complex ones aren't necessarily better. In this talk I briefly go through the most used models (adjacency list, materialized path, nested sets) and introduce some more advanced ones belonging to the nested intervals family (Farey algorithm, Continued Fractions, and other encodings).
I describe the advantages and pitfalls of each model, some proprietary solutions (e.g. Oracle's CONNECT BY) and one of the SQL Standard's upcoming features, Common Table Expressions.
has been working with large enterprise UK companies
for the past years and is now CTO at DataSift
He's an international conference speaker
and a long-time contributor
to many open source projects
, Book Review
, Cheat Sheet
, Data structures
, Firebird SQL
, Message Queues
, SQL Server
, Zend Framework