Cycle ORM and Graphs
summary
Explains why ORMs are useful and compares the ActiveRecord and DataMapper approaches. Presents a solution for topological sorting of ORM dependencies using iterative depth-first sorting and gives an overview of the Cycle ORM project and its functionality.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 1:05Why use ORM
- 2:51Active Record vs Data Mapper
- 4:40Active Record or Data Mapper
- 7:08Testing ORM code
- 10:00ORM approach differences
- 11:42Building custom ORM
- 13:26Persist layer sorting
- 17:40Topological sort algorithm
- 19:26Persist layer in Cycle ORM
- 23:23Cyclic dependencies in graphs
- 25:51Cycle ORM features
- 29:46Dynamic schema in Cycle ORM
- 33:18Cycle ORM performance
- 34:01Cycle ORM history
- 35:46Cycle ORM limitations
- 36:06Q&A
related talks
59mDoctrine ORM Good Practices and Tricks
59mHow much database abstraction do I need?
40mDoctrine: More Than Just an ORM
54mHexagonal Architecture in DDD
01h 03mUnbreakable Domain Models
21mLaravel Doctrine: A Data Mapper Approach
47mAn introduction to Graph Databases in PHP, using Neo4j
40mDDD, CQRS, Hexagonal, Onion,... Putting it together