●Home ●CFP ●Schedule ●Friday, February 22, 2013 ●Saturday, February 23, 2013 ●Sunday, February 24, 2013 ●Special Events ●Information ●Venue ●Exhibitors ●Sponsors ●Speakers ●Presentations ●Video ●Registration ●Promote SCALE The Eleventh Annual Southern California Linux Expo February 22-24, 2013 Hilton Los Angeles International Airport ●Home ●CFP ●Schedule ●Special Events ●Information ●Video ●Registration ●Promote SCALE

RDBMS for puzzle solving

Solomon Chang Audience: Everyone Topic: MySQL Can you use a Relational Database to solve a Rubiks Cube or Pyraminx or Sudoku? Does it require a brute force approach? What are the maximum number of moves required to solve a puzzle, and how much disk space and memory will you need to solve it? This talk leverages the relational nature of an RDBMS to solve many classic puzzles, but more importantly, will make you think about the way you encode and retrieve large data sets, as storing every possible state a puzzle can be in can start get unwieldy. Room: Century CD Time: Friday, February 22, 2013 - 13:30to14:30