Is it possible to query a tree structure table in MySQL in a single query, to any depth?

by

Yes, this is possible, it’s a called a Modified Preorder Tree Traversal, as best described here

Joe Celko’s Trees and Hierarchies in SQL for Smarties

A working example (in PHP) is provided here

http://www.sitepoint.com/article/hierarchical-data-database/2/

More Related Contents:

  1. How to create a MySQL hierarchical recursive query?
  2. MySQL – Conditional Foreign Key Constraints
  3. Entity-Attribute-Value Table Design
  4. Remove Primary Key in MySQL
  5. Getting all parent rows in one SQL query
  6. Fetching linked list in MySQL database
  7. Difference between two table structure
  8. Strings as Primary Keys in MYSQL Database [closed]
  9. When to use a left outer join?
  10. i have an error which i dont understand. can you help me? [closed]
  11. In SQL Server how to get the count of child if both parent and child are available [closed]
  12. Rank function in MySQL
  13. MySQL select 10 random rows from 600K rows fast
  14. Get a list of dates between two dates
  15. Find nearest latitude/longitude with an SQL query
  16. Simulate lag function in MySQL
  17. Get record counts for all tables in MySQL database
  18. Best data type for storing currency values in a MySQL database
  19. Datetime equal or greater than today in MySQL
  20. How to get the next auto-increment id in mysql
  21. MySQL dynamic-pivot
  22. How do I decide when to use right joins/left joins or inner joins Or how to determine which table is on which side?
  23. MySQL Workbench: How to keep the connection alive
  24. Deleting duplicate rows from a table
  25. Modeling Product Variants
  26. How create json format with group-concat mysql?
  27. MySQL LIKE query with underscore
  28. What is the difference between SQL and MySQL? [closed]
  29. how to use a like with a join in sql?
  30. Inventory management with stock options

Leave a Comment