Approaches to Speed up Data Processing in Relational Databases

被引:2
|
作者
Shichkina, Yulia [1 ]
机构
[1] St Petersburg Electrotech Univ LETI, Prof Popova Str,5, St Petersburg 197376, Russia
关键词
database; query; parallel computing; information graph; optimization;
D O I
10.1016/j.procs.2019.02.026
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The increasing of data volumes and the tightening of requirements by the time of data processing actualize the problem of finding methods for optimizing data structures and queries in databases. This article presents a set of methods that can help speed up the processing of data. These include the method of restructuring a completed database, a method for obtaining a parallel query plan, and methods for optimizing queries. The presented methods can be used both in a complex and independently of each other. At the end of the article, are shown the results of the experiments, which were carried out on a test database for approbation of optimization methods for a parallel query plan. (C) 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/) Peer-review under responsibility of the scientific committee of the 13th International Symposium "Intelligent Systems" (INTELS'18).
引用
收藏
页码:131 / 139
页数:9
相关论文
共 50 条
  • [1] A new way to speed up recursion in relational databases
    Chen, YJ
    ISSUES AND TRENDS OF INFORMATION TECHNOLOGY MANAGEMENT IN CONTEMPORARY ORGANIZATIONS, VOLS 1 AND 2, 2002, : 356 - 360
  • [2] Path signatures: A way to speed up recursion in relational databases
    Teuhola, J
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (03) : 446 - 454
  • [3] ANALYZING THE PERFORMANCE OF DATA LOADING AND PROCESSING IN RELATIONAL DATABASES
    Lungu, Ion
    Bara, Adela
    Diaconita, Vlad
    Paraschiv, Corina
    ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, 2010, 44 (03): : 109 - 121
  • [4] Classification Approaches on Relational Databases
    Hemalatha, T.
    Samatha, J.
    Priyanka, Ch. Vani
    Lavanya, A.
    Kumar, Ch. Ranjith
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2013, 13 (04): : 60 - 65
  • [5] JOIN PROCESSING IN RELATIONAL DATABASES
    MISHRA, P
    EICH, MH
    COMPUTING SURVEYS, 1992, 24 (01) : 63 - 113
  • [6] Query Processing over Data Warehouse using Relational Databases and NoSQL
    Carniel, Anderson Chaves
    Sa, Aried de Aguiar
    Porto Brisighello, Vinicius Henrique
    Ribeiro, Marcela Xavier
    Bueno, Renato
    Ciferri, Ricardo Rodrigues
    de Aguiar Ciferri, Cristina Dutra
    2012 XXXVIII CONFERENCIA LATINOAMERICANA EN INFORMATICA (CLEI), 2012,
  • [7] A scalable bottom-up data mining algorithm for relational databases
    Giuffrida, G
    Cooper, LG
    Chu, WW
    TENTH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT - PROCEEDINGS, 1998, : 206 - 209
  • [8] Parallel processing of nested relational databases
    El-Shehaby, Saleh
    Abougabal, Mohamed S.
    Eldin, Alaa
    Youssef, Alaa S.
    AEJ - Alexandria Engineering Journal, 1995, 34 (02):
  • [9] Processing XPath expressions in relational databases
    Pankowski, T
    SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 265 - 276
  • [10] Processing sequential patterns in relational databases
    Shang, XQ
    Sattler, KU
    DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2005, 3589 : 438 - 447