{"push_id":2624950985,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c3f8128f46711d1a06671b1e9a99fa5e4e09262f","before":"05141fb07e2fa9d9a3f87e1c1468275325409fc9","commits":[{"sha":"c3f8128f46711d1a06671b1e9a99fa5e4e09262f","author":{"name":"jogli5er","email":"2210368018c4a747394d50cad0cec443c3fa09b0@student.ethz.ch"},"message":"Introduces denormalized column for efficient prioritization\n\nWe introduced an incoming column of links, such that we scrape the most\nimportant pages first. This column is important, since it is not\nfeasible to calculate the data dynamically (even after optimization of\nthe request, indexes and similar, it takes up to 1.5 minutes, if we\nwant to get 2000 entries). If we update only the paths we just found,\nit is much cheaper (typically only a few dozen entries to update), and\nsince we can sort cheaply (index on the column) and limit fast, this\nsmall amount of storage seems well spent space in contrast to the time\nsavings.\n[#20]","distinct":true,"url":"https://api.github.com/repos/decrypto-org/spider/commits/c3f8128f46711d1a06671b1e9a99fa5e4e09262f"}]}
{"actor":{"display_login":"jogli5er"}}