Trees in the Database: Advanced Data Structures

A session at Dutch PHP Conference 2009

Saturday 13th June, 2009

3:00pm to 4:00pm (AMT)

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.

About the speaker

This person is speaking at this event.
Lorenzo Alberton

Chief Tech Architect at DataSift bio from Twitter

Coverage of this session

Sign in to add slides, notes or videos to this session

Tell your friends!

When

Time 3:00pm4:00pm AMT

Date Sat 13th June 2009

Short URL

lanyrd.com/syfm

Official event site

www.phpconference.nl

View the schedule

Share

Topics

See something wrong?

Report an issue with this session