Date: 05/03/06 (Algorithms) Keywords: mysql, database, sql I've got a large transition matrix (2000+ states) that is pretty sparse (most transitions are 0 probability). Right now I'm storing the thing in a MySQL database, and generating sequences based on the probability matrix is soooo slow. There must be a more compact way to represent these transition probabilities, so that I don't have to do a query on a 2000+ row x 2000+ column database table every iteration of the system. But I don't know how. Any thoughts? Source: http://community.livejournal.com/algorithms/75944.html
|