You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
David Tanzer (Jul 01 2020 at 22:26):Abstract. This paper shows how concepts coming from category theory can help to improve the algorithms dealing with large sets of data. Data structures can be modeled by functors that are related by natural transformations usable both to reduce data size or to shift an algorithm applicable to a particular data structure to an equivalent algorithm for another data structure, i.e. results are the same but time required to get it can be different. As an illustration, the paper takes the example of queries on graph databases used by semantic web and big data communities.
Alas behind a paywall.
David Tanzer (Jul 01 2020 at 22:34):Even more interested to find references relating to optimization in the classical sense (which I see been touched upon in other topics).
Georgios Bakirtzis (Jul 02 2020 at 00:08):08334478.pdf Here you go
Georgios Bakirtzis (Jul 02 2020 at 00:09):It doesn't seem like much to me but I could merely be unprepared for this paper
David Tanzer (Jul 02 2020 at 00:35):Yeah it doesn't look like much. Sorry if there was a misunderstanding here - I was just sighing about the paywall, not actually asking for a download. I would remove the link, due to infringement concerns. Thanks.
David Tanzer (Jul 02 2020 at 00:35):Onward to more interesting references!