Database geekery

[bluegargantua]

Hey,

So I'm reading up on how you can use nested sets to model a tree structure in SQL.

It's really neat. I don't think I'll get to apply it to this particular problem at work, but it was like "ooh! fun with math and SQL queries!". And I'm sure it'll be useful in the future.

hee
Tom

Comments

[purly.livejournal.com]

That's cool. Actually, most indexes are already stored as some kind of a tree inside of the db; and clustered indexes are b-trees, regular indexes depend on the db system you're using. But then, the SQL standard is set up such that the db handles all the data manip for you and you use the structured query language to retrieve and store the data... It's not like you really need to define your own trees if you're using a good system.

[bluegargantua]

If we were using a good system, I'd be out of a job so it's not too much of a burden. Selling my boss on this idea will be the tricky part.

later
Tom

[purly.livejournal.com]

Oracle XE is free:
http://www.oracle.com/technology/products/database/xe/index.html

[bluegargantua]

Thanks, but porting the application over to Oracle is unlikely to be a viable proposal. :)

later
Tom