Path querying using conjunctive grammars
Graphs are used as a data structure to represent large volumes of information in a compact and convenient for analysis form in many areas: bioinformatics, graph databases, static code analysis, etc. In these areas, it is necessary to evaluate a queries for large graphs in order to determine the depe...
Main Authors: | R. Sh. Azimov, S. V. Grigorev |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/486 |
Similar Items
-
Batch Symmetric Fully Homomorphic Encryption Using Matrix Polynomials
by: Ph. Burtyka
Published: (2018-10-01) -
Lazy source code analysis for C/C++ languages
by: V. O. Savitsky, et al.
Published: (2018-10-01) -
Improving quality of graph partitioning using multilevel optimization
by: R. Pastukhov, et al.
Published: (2018-10-01) -
GARDEN-PATH SENTENCES: DIFFICALTIES OF INTERPRETATION
by: V. E. Kagan, et al.
Published: (2017-12-01) -
Алгоритм оптимизации извлечения ключевых слов на основе применения лингвистического парсера
by: Daniil Kravchenko, et al.
Published: (2024-03-01)