George A. Chernishev

dblp:64/2756 · DBLP profile ↗
← Back
10ranked-venue papers in the field
2as first author
5since 2021 · last 2025
0000-0002-4265-9642ORCID · verified

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 9 (2 first)Other / Interdisciplinary · 1
YearPublicationVenuePosition
2025 Speeding up SQL Subqueries via Decoupling of Non-correlated Predicate
Dmitrii Radivonchik, Yakov Kuzin, Anton Chizhov, Dmitriy Shcheka, Mikhail Firsov, Kirill Smirnov 0001, George A. Chernishev
MEDI7
2023 Finding a Second Wind: Speeding Up Graph Traversal Queries in RDBMSs Using Column-Oriented Processing
Mikhail Firsov, Michael Polyntsov, Kirill Smirnov 0001, George A. Chernishev
MEDI4
2022 A Comprehensive Study of Late Materialization Strategies for a Disk-Based Column-Store
George A. Chernishev, Vyacheslav Galaktionov, Valentin V. Grigorev, Evgeniy Klyuchikov, Kirill Smirnov 0001
DOLAP1
2021 Revisiting Data Compression in Column-Stores
Alexander Slesarev, Evgeniy Klyuchikov, Kirill Smirnov 0001, George A. Chernishev
MEDI4
2021 S3M: Siamese Stack (Trace) Similarity Measure
abstract
Automatic crash reporting systems have become a de-facto standard in software development. These systems monitor target software, and if a crash occurs they send details to a backend application. Later on, these reports are aggregated and used in the development process to 1) understand whether it is a new or an existing issue, 2) assign these bugs to appropriate developers, and 3) gain a general overview of the application's bug landscape. The efficiency of report aggregation and subsequent operations heavily depends on the quality of the report similarity metric. However, a distinctive feature of this kind of report is that no textual input from the user (i.e., bug description) is available: it contains only stack trace information. In this paper, we present S3M ("extreme") - the first approach to computing stack trace similarity based on deep learning. It is based on a siamese architecture that uses a biLSTM encoder and a fully-connected classifier to compute similarity. Our experiments demonstrate the superiority of our approach over the state-of-the-art on both open-sourced data and a private JetBrains dataset. Additionally, we review the impact of stack trace trimming on the quality of the results.
Aleksandr Khvorov, Roman Vasiliev, George A. Chernishev, Irving Muller Rodrigues, Dmitrij V. Koznov, Nikita Povarov
MSR3
2020 Making DBMSes Dependency-Aware
George A. Chernishev
CIDR1
2020 Position Caching in a Column-Store with Late Materialization: An Initial Study
Vyacheslav Galaktionov, Evgeniy Klyuchikov, George A. Chernishev
DOLAP3
2019 Implementing Window Functions in a Column-Store with Late Materialization
Nadezhda Mukhaleva, Valentin D. Grigorev, George A. Chernishev
MEDI3
2017 An Evaluation of TANE Algorithm for Functional Dependency Detection
Nikita Bobrov, George A. Chernishev, Dmitry A. Grigoriev, Boris Novikov 0001
MEDI2
2016 K-means Split Revisited: Well-grounded Approach and Experimental Evaluation
abstract
R-tree is a data structure used for multidimensional indexing. Essentially, it is a balanced tree consisting of nested hyper-rectangles which are used to locate the data. One of the most performance sensitive parts of this data structure is its split algorithm, which runs during node overflows. The split can be performed in multiple ways, according to many different criteria and in general the problem of finding an optimal solution is NP-hard. There are many heuristic split algorithms. In this paper we study an existing k-means node split algorithm. We describe a number of serious issues in its theoretical foundation, which made us to re-design k-means split. We propose several well-grounded solutions to the re-emerged problem of k-means split. Finally, we report the comparison results using PostgreSQL and contemporary benchmark for multidimensional structures.
Valentin D. Grigorev, George A. Chernishev
SIGMOD Conference2