Trees in the Database: advanced data structures

Lorenzo Alberton (13.Jun.2009 at 02:00)
Talk at Dutch PHP Conference 2009 (English - US)

Rating: 4 of 5

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'll 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 (MPTT, Continued Fractions, Farey algorithm and other encodings).
I'll 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.

Who are you?

Claim talk

By clicking this button you are declaring that you are the speaker responsible for it and a claim request will be sent to the administrator of the event.

If the claim is approved you will be able to edit the information for this talk.

Are you sure?

 
Comments closed.

Comments

Rating: 5 of 5

13.Jun.2009 at 13:55 by Harro van der Klauw

At the beginning you where a bit hard to understand, try to articulate better.

I liked the whole explanation about what a tree actually is, and the examples about solutions on how to handle inner node deletions was very nice.

Wow, good thing I knew a bit about adjacency list and the nested set, because it got rather complex with the nested interval model.

Rating: 5 of 5

13.Jun.2009 at 13:57 by Ian Barber

Great stuff on the nested interval model and the sql standard way of using trees, neither of which I'd used before.

Rating: 4 of 5

13.Jun.2009 at 14:04 by Marcel Blok

Really interesting stuff. Sometimes it was a bit hard to keep up, but all in all a good talk.

Rating: 4 of 5

13.Jun.2009 at 14:32 by Jacob Christiansen

Very interesting stuff. Probably need to read up on this when I get home...

Rating: 4 of 5

13.Jun.2009 at 14:44 by Gerben

This was a good one, nice to get an overview of all the various tree-structures. Proceeding at top speed, which was good I think, but would like to review all of this at home on my own time... Maybe some more links next time? In terms of content: grrreat!

Rating: 5 of 5

13.Jun.2009 at 23:36 by Vincenzo Russo

Definitely good. Not many people use to talk about alternative trees representation. That was good and very interesting to know that some DMBS already have some of those things implemented.

Rating: 3 of 5

14.Jun.2009 at 13:50 by Gerard van Helden

Relatively good content, not so easy to listen to.

Rating: 4 of 5

14.Jun.2009 at 20:58 by Derick Rethans

Good talk, but I think the nested intervals was perhaps a bit too complex to explain in such a small time frame.

Rating: 4 of 5

14.Jun.2009 at 21:24 by Rick Buitenman

Part of this stuff went way over my head, especially at this late point in the con. Somewhat nervous, flat presentation made it even harder to follow.

But the talk was well prepared, well structured and extremely informative by a speaker who clearly knows what he's talking about.

Rating: 5 of 5

15.Jun.2009 at 07:38 by Mark van der Velden

Most of the structures I knew about, but never used it. Seeing some examples was actually quite helpful. You where a bit nervous but still the talk was very good. Your presenting skills exceed those of a few speakers I've seen that have more experience. Really good !

Rating: 4 of 5

15.Jun.2009 at 08:32 by Miha Hribar

English was a bit of a problem, but other than that very nicely presented. Thanks for all the great ideas regarding tree structures. I'm sure I would not found most of the ideas you presented on my own. Was a nice ending to a great conference!

Cloud server hosting by Combell Combell      © Joind.in 2012