Elena V. Ivanova

Elena V. Ivanova

Auto-generated profile, based on publicly available information

Elena V. Ivanova

South Ural State University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 July 2022
Verified
Book Chapter
Closed access
PDF file
NDNatalya Dolganina
Natalya Dolganina
EIElena Ivanova
Elena Ivanova
RBRoman Bilenko
Roman Bilenko
ARAlexander Rekachinsky
Alexander Rekachinsky

3 September 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Mikhail ZymblerMikhail Zymbler
Mikhail Zymbler
EIElena Ivanova
Elena Ivanova
Currently, big sensor data arise in a wide spectrum of Industry 4.0, Internet of Things, and Smart City applications. In such subject domains, sensors tend to have a high frequency and produce massive time series in a relatively short time interval. The data collected from the sensors are subject to mining in order to make strategic decisions. In the article, we consider the problem of choosing a Time Series Database Management System (TSDBMS) to provide efficient storing and mining of big sensor data. We overview InfluxDB, OpenTSDB, and TimescaleDB, which are among the most popular state-of-the-art TSDBMSs, and represent different categories of such systems, namely native, add-ons over NoSQL systems, and add-ons over relational DBMSs (RDBMSs), respectively. Our overview shows that, at present, TSDBMSs offer a modest built-in toolset to mine big sensor data. This leads to the use of third-party mining systems and unwanted overhead costs due to exporting data outside a TSDBMS, data conversion, and so on. We propose an approach to managing and mining sensor data inside RDBMSs that exploits the Matrix Profile concept. A Matrix Profile is a data structure that annotates a time series through the index of and the distance to the nearest neighbor of each subsequence of the time series and serves as a basis to discover motifs, anomalies, and other time-series data mining primitives. This approach is implemented as a PostgreSQL extension that allows an application programmer both to compute matrix profiles and mining primitives and to represent them as relational tables. Experimental case studies show that our approach surpasses the above-mentioned out-of-TSDBMS competitors in terms of performance since it assumes that sensor data are mined inside a TSDBMS at no significant overhead costs.

25 May 2016 in Lobachevskii Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
EIE. Ivanova
E. Ivanova
Leonid B. SokolinskyLeonid B. Sokolinsky
Leonid B. Sokolinsky
The paper is devoted to the issue of decomposition of the join relational operator with the aid of distributed column indices. Such decomposition allows one to utilize the modern manycore...

26 May 2017 in Programming and Computer Software
Verified
Journal Article
Closed access
PDF file
EIE. V. Ivanova
E. V. Ivanova
Leonid B. SokolinskyLeonid B. Sokolinsky
Leonid B. Sokolinsky
The development and investigation of efficient methods of parallel processing of very large databases using the columnar data representation designed for computer cluster is discussed. An approach that combines the advantages of relational and column-oriented DBMSs is proposed. A new type of distributed column indexes fragmented based on the domain-interval principle is introduced. The column indexes are auxiliary structures that are constantly stored in the distributed main memory of a computer cluster. To match the elements of a column index to the tuples of the original relation, surrogate keys are used. Resource hungry relational operations are performed on the corresponding column indexes rather than on the original relations of the database. As a result, a precomputation table is obtained. Using this table, the DBMS reconstructs the resulting relation. For basic relational operations on column indexes, methods for their parallel decomposition that do not require massive data exchanges between the processor nodes are proposed. This approach improves the class OLAP query performance by hundreds of times.

4 July 2023
Verified
Book Chapter
Closed access
PDF file
TBTatyana V. Bodrova
Tatyana V. Bodrova
EBElvira N. Borisova
Elvira N. Borisova
EZElena V. Zubareva
Elena V. Zubareva
EIElena V. Ivanova
Elena V. Ivanova
NMNatalia B. Morozova
Natalia B. Morozova

4 December 2021
Verified
Book Chapter
Closed access
PDF file
EBElvira N. Borisova
Elvira N. Borisova
TBTatyana V. Bodrova
Tatyana V. Bodrova
EIElena V. Ivanova
Elena V. Ivanova
AZAlexander M. Zarubetskiy
Alexander M. Zarubetskiy
EZElena V. Zubareva
Elena V. Zubareva