際際滷shows by User: KonstantinOsipov / http://www.slideshare.net/images/logo.gif 際際滷shows by User: KonstantinOsipov / Fri, 18 Aug 2017 15:23:01 GMT 際際滷Share feed for 際際滷shows by User: KonstantinOsipov 仂于仂亳仄 仂 弌丕 磶从仂仄 HR /slideshow/hr-78958128/78958128 hrdbms1-170818152301
弍亢亟舒亠仄 从舒从 仆舒仆亳仄舒 仗亠亳舒仍亳仂于 于 仂弍仍舒亳 弌丕 仆舒 HR IT meetup]]>
弍亢亟舒亠仄 从舒从 仆舒仆亳仄舒 仗亠亳舒仍亳仂于 于 仂弍仍舒亳 弌丕 仆舒 HR IT meetup]]> Fri, 18 Aug 2017 15:23:01 GMT /slideshow/hr-78958128/78958128 KonstantinOsipov@slideshare.net(KonstantinOsipov) 仂于仂亳仄 仂 弌丕 磶从仂仄 HR KonstantinOsipov 弍亢亟舒亠仄 从舒从 仆舒仆亳仄舒 仗亠亳舒仍亳仂于 于 仂弍仍舒亳 弌丕 仆舒 HR IT meetup <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/hrdbms1-170818152301-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> 弍亢亟舒亠仄 从舒从 仆舒仆亳仄舒 仗亠亳舒仍亳仂于 于 仂弍仍舒亳 弌丕 仆舒 HR IT meetup
仂于仂亳仄 仂 弌丕 磶从仂仄 HR from Konstantin Osipov
]]> 625 4 https://cdn.slidesharecdn.com/ss_thumbnails/hrdbms1-170818152301-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 vinyl /slideshow/vinyl-75591297/75591297 vinylpercona2017-170502075051
This is my talk on Vinyl storage engine internals at Percona Live Santa Clara 2017. Vinyl is a write opitmized storage engine based on log structured merge tree data structure that we delivered in Tarantool 1.7. ]]>
This is my talk on Vinyl storage engine internals at Percona Live Santa Clara 2017. Vinyl is a write opitmized storage engine based on log structured merge tree data structure that we delivered in Tarantool 1.7. ]]> Tue, 02 May 2017 07:50:51 GMT /slideshow/vinyl-75591297/75591297 KonstantinOsipov@slideshare.net(KonstantinOsipov) vinyl KonstantinOsipov This is my talk on Vinyl storage engine internals at Percona Live Santa Clara 2017. Vinyl is a write opitmized storage engine based on log structured merge tree data structure that we delivered in Tarantool 1.7. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/vinylpercona2017-170502075051-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> This is my talk on Vinyl storage engine internals at Percona Live Santa Clara 2017. Vinyl is a write opitmized storage engine based on log structured merge tree data structure that we delivered in Tarantool 1.7.
vinyl from Konstantin Osipov
]]> 1512 5 https://cdn.slidesharecdn.com/ss_thumbnails/vinylpercona2017-170502075051-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 My talk about Tarantool and Lua at Percona Live 2016 /slideshow/my-talk-about-tarantool-and-lua-at-percona-live-2016/61165990 percona2016-160420220451
In my talk I will focus on a practical use case: task queue application, using Tarantool as an application server and a database. The idea of the task queue is that producers put tasks (objects) into a queue, and consumers take tasks, perform them, mark as completed. The queue must guarantee certain properties: if a consumer failed, a task should return to the queue automatically, a task can't be taken by more than one consumer, priorities on tasks should be satisfied. With Tarantool, a task queue is a distributed networked application: there are multiple consumer/producer endpoints (hosts) through which a user can interact with the queue. The queue itself is a fault-tolerant distributed database: every task is stored in Tarantool database and replicated in multiple copies. If a machine goes down, the state of a task is tracked on a replica, and the user can continue working with the queue through a replica. Total power failure is also not an issue, since tasks are stored persistently on disk with transactional semantics. Performance of such an application is in hundreds of thousands of transactions per second. At the same time, the queue is highly customizable, since it's written entirely in Lua, is a Lua rock, but the code is running inside the database. This is the strength of Lua: one size doesn't have to fit all, and you don't have to sacrifice performance if you need customization. The second part of the talk will be about implementation details, performance numbers, a performance comparison with other queue products (beanstalkd, rabbitmq) in particular, and an overview of the implementation from language bindings point of view: how we make database API available in Lua, what are the challenges and performance hurdles of such binding.]]>
In my talk I will focus on a practical use case: task queue application, using Tarantool as an application server and a database. The idea of the task queue is that producers put tasks (objects) into a queue, and consumers take tasks, perform them, mark as completed. The queue must guarantee certain properties: if a consumer failed, a task should return to the queue automatically, a task can't be taken by more than one consumer, priorities on tasks should be satisfied. With Tarantool, a task queue is a distributed networked application: there are multiple consumer/producer endpoints (hosts) through which a user can interact with the queue. The queue itself is a fault-tolerant distributed database: every task is stored in Tarantool database and replicated in multiple copies. If a machine goes down, the state of a task is tracked on a replica, and the user can continue working with the queue through a replica. Total power failure is also not an issue, since tasks are stored persistently on disk with transactional semantics. Performance of such an application is in hundreds of thousands of transactions per second. At the same time, the queue is highly customizable, since it's written entirely in Lua, is a Lua rock, but the code is running inside the database. This is the strength of Lua: one size doesn't have to fit all, and you don't have to sacrifice performance if you need customization. The second part of the talk will be about implementation details, performance numbers, a performance comparison with other queue products (beanstalkd, rabbitmq) in particular, and an overview of the implementation from language bindings point of view: how we make database API available in Lua, what are the challenges and performance hurdles of such binding.]]> Wed, 20 Apr 2016 22:04:51 GMT /slideshow/my-talk-about-tarantool-and-lua-at-percona-live-2016/61165990 KonstantinOsipov@slideshare.net(KonstantinOsipov) My talk about Tarantool and Lua at Percona Live 2016 KonstantinOsipov In my talk I will focus on a practical use case: task queue application, using Tarantool as an application server and a database. The idea of the task queue is that producers put tasks (objects) into a queue, and consumers take tasks, perform them, mark as completed. The queue must guarantee certain properties: if a consumer failed, a task should return to the queue automatically, a task can't be taken by more than one consumer, priorities on tasks should be satisfied. With Tarantool, a task queue is a distributed networked application: there are multiple consumer/producer endpoints (hosts) through which a user can interact with the queue. The queue itself is a fault-tolerant distributed database: every task is stored in Tarantool database and replicated in multiple copies. If a machine goes down, the state of a task is tracked on a replica, and the user can continue working with the queue through a replica. Total power failure is also not an issue, since tasks are stored persistently on disk with transactional semantics. Performance of such an application is in hundreds of thousands of transactions per second. At the same time, the queue is highly customizable, since it's written entirely in Lua, is a Lua rock, but the code is running inside the database. This is the strength of Lua: one size doesn't have to fit all, and you don't have to sacrifice performance if you need customization. The second part of the talk will be about implementation details, performance numbers, a performance comparison with other queue products (beanstalkd, rabbitmq) in particular, and an overview of the implementation from language bindings point of view: how we make database API available in Lua, what are the challenges and performance hurdles of such binding. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/percona2016-160420220451-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> In my talk I will focus on a practical use case: task queue application, using Tarantool as an application server and a database. The idea of the task queue is that producers put tasks (objects) into a queue, and consumers take tasks, perform them, mark as completed. The queue must guarantee certain properties: if a consumer failed, a task should return to the queue automatically, a task can&#39;t be taken by more than one consumer, priorities on tasks should be satisfied. With Tarantool, a task queue is a distributed networked application: there are multiple consumer/producer endpoints (hosts) through which a user can interact with the queue. The queue itself is a fault-tolerant distributed database: every task is stored in Tarantool database and replicated in multiple copies. If a machine goes down, the state of a task is tracked on a replica, and the user can continue working with the queue through a replica. Total power failure is also not an issue, since tasks are stored persistently on disk with transactional semantics. Performance of such an application is in hundreds of thousands of transactions per second. At the same time, the queue is highly customizable, since it&#39;s written entirely in Lua, is a Lua rock, but the code is running inside the database. This is the strength of Lua: one size doesn&#39;t have to fit all, and you don&#39;t have to sacrifice performance if you need customization. The second part of the talk will be about implementation details, performance numbers, a performance comparison with other queue products (beanstalkd, rabbitmq) in particular, and an overview of the implementation from language bindings point of view: how we make database API available in Lua, what are the challenges and performance hurdles of such binding.
My talk about Tarantool and Lua at Percona Live 2016 from Konstantin Osipov
]]> 772 4 https://cdn.slidesharecdn.com/ss_thumbnails/percona2016-160420220451-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 https://cdn.slidesharecdn.com/profile-photo-KonstantinOsipov-48x48.jpg?cb=1619021765 https://cdn.slidesharecdn.com/ss_thumbnails/hrdbms1-170818152301-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/hr-78958128/78958128 仂于仂亳仄 仂 弌丕 磶从仂仄 HR https://cdn.slidesharecdn.com/ss_thumbnails/vinylpercona2017-170502075051-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/vinyl-75591297/75591297 vinyl https://cdn.slidesharecdn.com/ss_thumbnails/percona2016-160420220451-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/my-talk-about-tarantool-and-lua-at-percona-live-2016/61165990 My talk about Tarantoo...