Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Andrey Balmin"'
Publikováno v:
Journal of Scheduling. 22:393-411
This paper provides a unified family of algorithms with performance guarantees for malleable scheduling problems on flows. A flow represents a set of jobs with precedence constraints. Each job has a speedup function that governs the rate at which wor
Publikováno v:
Proceedings of the VLDB Endowment. 7:193-204
To meet the challenge of processing rapidly growing graph and network data created by modern applications, a number of distributed graph processing systems have emerged, such as Pregel and GraphLab. All these systems divide input graphs into partitio
Publikováno v:
Scopus-Elsevier
Machine learning algorithms are widely used today for analytical tasks such as data cleaning, data categorization, or data filtering. At the same time, the rise of social media motivates recent uptake in large scale graph processing. Both categories
Autor:
Deepak Rajan, Rohit Khandekar, Kirsten W. Hildrum, Andrey Balmin, Sujay Parekh, Kun-Lung Wu, Joel L. Wolf, Rares Vernica
Publikováno v:
The VLDB Journal. 21:589-609
We consider MapReduce clusters designed to support multiple concurrent jobs, concentrating on environments in which the number of distinct datasets is modest relative to the number of jobs. In such scenarios, many individual datasets are likely to be
Autor:
Mohamed Y. Eltabakh, Kevin Scott Beyer, Rainer Gemulla, Vuk Ercegovac, Carl-Christian Kanne, Andrey Balmin, Fatma Ozcan, Eugene J. Shekita
Publikováno v:
Scopus-Elsevier
This paper describes Jaql, a declarative scripting language for analyzing large semistructured datasets in parallel using Hadoop's MapReduce framework. Jaql is currently used in IBM's InfoSphere BigInsights [5] and Cognos Consumer Insight [9] product
Autor:
Andrey Balmin, Latha S. Colby, Sharath Srinivas, Emiran Curtmola, Fatma Ozcan, Zografoula Vagena, Quanzhong Li
Publikováno v:
Proceedings of the VLDB Endowment. 1:1408-1411
Keyword search in XML repositories is a powerful tool for interactive data exploration. Much work has recently been done on making XML search aware of relationship information embedded in XML document structure, but without a clear winner in all data
Autor:
Frank van Ham, Akanksha Baid, Erik Nijkamp, Berthold Reinwald, Yannis Sismanis, Andrey Balmin, Alkis Simitsis, Heasoo Hwang, Jun Rao
Publikováno v:
Proceedings of the VLDB Endowment. 1:1456-1459
DBPubs is a system for effectively analyzing and exploring the content of database publications by combining keyword search with OLAP-style aggregations, navigation, and reporting. DBPubs starts with keyword search over the content of publications. T
Publikováno v:
ICDE
Shared-nothing systems such as Hadoop vastly simplify parallel programming when processing disk-resident data whose size exceeds aggregate cluster memory. Such systems incur a significant performance penalty, however, on the important class of “gro
Publikováno v:
ICDE
A large scale network of social interactions, such as mentions in Twitter, can often be modeled as a “dynamic interaction graph” in which new interactions (edges) are continually added over time. Existing systems for extracting timely insights fr
Autor:
Andrey Balmin, Lipyeow Lim, J. Hornibrook, M. Wang, Guy M. Lohman, David E. Simmen, Tom Eliaz, C. Zhang
Publikováno v:
IBM Systems Journal. 45:299-319
DB2 XML is a hybrid database system that combines the relational capabilities of DB2 Universal DatabaseTM (UDB) with comprehensive native XML support. DB2 XML augments DB2® UDB with a native XML store, XML indexes, and query processing capabilities