Better Routing Through Trees
summary
Argues that a routing tree (implemented as Ruby code) cuts duplicate setup and speeds routing; uses an open-source r10k benchmark at 10/100/1k/10k routes and shows Roa (named Roa in the slides) uses the least memory and is fastest among tree-based frameworks, with Roa-run test suites running ~50% faster than Sinatra and ~2× faster than Rails in migrated apps. Converts a real app: 79 routes, 36 branches, 25 branches share setup (70% elimination). Notes one tradeoff: loss of route introspection.
AI-written summary · about
chapters (8)
- 0:00Introduction to routing
- 1:09Evolution of routing
- 4:38The routing tree concept
- 8:53Performance benchmarks
- 13:38Implementation complexity
- 15:54Integrating request handling
- 23:25Considerations and trade-offs
- 25:54Conclusion and Roda
related talks
39mRoda: The Routing Tree Web Framework
27mHanami::API
01h 09mRails 3 ...and the real secret to high productivity
50mReitit, the Ancient Art of Routing
38mRe-graphing The Mental Model of The Rails Router
33mRails is Just Ruby
36mRiffing on Rails: sketch your way to better designed code
27mDynamic Routing with Circuit