Search

Your search keyword '"Batko, Michal"' showing total 3 results
Start Over Author "Batko, Michal" Topic performance analysis
3 results on '"Batko, Michal"'

1. Performance Analysis of Distributed Stream Processing Applications Through Colored Petri Nets

Author

Nalepa, Filip, Batko, Michal, Zezula, Pavel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Kofroň, Jan, editor, and Vojnar, Tomáš, editor

Published
2016
Full Text
View/download PDF

2. Model for Performance Analysis of Distributed Stream Processing Applications

Author

Nalepa, Filip, Batko, Michal, Zezula, Pavel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Chen, Qiming, editor, Hameurlain, Abdelkader, editor, Toumani, Farouk, editor, Wagner, Roland, editor, and Decker, Hendrik, editor

Published
2015
Full Text
View/download PDF

3. M-Grid: Similarity Searching in Grids

Author

Batko Michal, Dohnal Vlastislav, and Zezula Pavel

Subjects
similarity searching, metric space, M-Grid, D-index, performance analysis
Abstract

The problem of similarity searching is nowadays attracting a lot of attention, because upcoming applications process complex data and the traditional exact match searching is not sufficient. There are efficient solutions, but they are tailored for the needs of specific data domains. General solutions, based on the metric space abstraction, are extensible, but they are designed to operate on a single computer only. Therefore, their scalability is limited and they cannot adapt to different performance requirements. In this paper, we propose a distributed access structure which is fully dynamic and exploits a Grid infrastructure. We study properties of this structure in numerous experiments. Besides, the performance tuning is analyzed with respect to user-specific requirements which include the maximum response time and the number of queries executed concurrently. The problem of similarity searching is nowadays attracting a lot of attention, because upcoming applications process complex data and the traditional exact match searching is not sufficient. There are efficient solutions, but they are tailored for the needs of specific data domains. General solutions, based on the metric space abstraction, are extensible, but they are designed to operate on a single computer only. Therefore, their scalability is limited and they cannot adapt to different performance requirements. In this paper, we propose a distributed access structure which is fully dynamic and exploits a Grid infrastructure. We study properties of this structure in numerous experiments. Besides, the performance tuning is analyzed with respect to user-specific requirements which include the maximum response time and the number of queries executed concurrently.

Published
2006

Catalog

Books, media, physical & digital resources
See catalog results