Sessions at PHP Barcelona Conference 2009 about Data Structures

Your current filters are…

Friday 30th October 2009

  • Trees in the database: Advanced data structures

    by Lorenzo Alberton

    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.

    At 11:30am to 12:30pm, Friday 30th October

    Coverage slide deck

Schedule incomplete?

Add a new session

Filter by Day

Filter by coverage

Filter by Topic