Nested set model: Difference between revisions

Revision as of 05:33, 2 October 2020

Revision as of 08:53, 1 September 2021

Line 54:

==Performance==

Queries using nested sets can be expected to be faster than queries using a [[stored procedure]] to traverse an adjacency list, and so are the faster option for databases which lack native recursive query constructs, such as [[MySQL]] 5.x.<ref>{{Citation

| title= Adjacency list vs. nested sets: MySQL

| author= Quassnoi

Line 82:

| url = http://explainextended.com/2009/09/25/adjacency-list-vs-nested-sets-sql-server/

| accessdate = 11 December 2010

}}</ref> [[MySQL]] used to lack recursive query constructs but added such features in version 8.<ref>{{Cite web|title=MySQL :: MySQL 8.0 Reference Manual :: 13.2.15 WITH (Common Table Expressions)|url=https://dev.mysql.com/doc/refman/8.0/en/with.html|access-date=2021-09-01|website=dev.mysql.com}}</ref>

}}</ref>

==Drawbacks==