Standard

Multiple-Source Context-Free Path Querying in Terms of Linear Algebra. / Терехов, Арсений Константинович; Погожельская, Влада Владимировна; Абзалов, Вадим Игоревич; Зиннатулин, Тимур Раифович; Григорьев, Семен Вячеславович.

In: OpenProceedings, 2021, p. 487-492.

Research output: Contribution to journal › Conference article › peer-review

Harvard

Терехов, АК, Погожельская, ВВ, Абзалов, ВИ, Зиннатулин, ТР & Григорьев, СВ 2021, 'Multiple-Source Context-Free Path Querying in Terms of Linear Algebra', OpenProceedings, pp. 487-492. https://doi.org/10.5441/002/edbt.2021.56

APA

Терехов, А. К., Погожельская, В. В., Абзалов, В. И., Зиннатулин, Т. Р., & Григорьев, С. В. (2021). Multiple-Source Context-Free Path Querying in Terms of Linear Algebra. OpenProceedings, 487-492. https://doi.org/10.5441/002/edbt.2021.56

Vancouver

Терехов АК, Погожельская ВВ, Абзалов ВИ, Зиннатулин ТР, Григорьев СВ. Multiple-Source Context-Free Path Querying in Terms of Linear Algebra. OpenProceedings. 2021;487-492. https://doi.org/10.5441/002/edbt.2021.56

Author

Терехов, Арсений Константинович ; Погожельская, Влада Владимировна ; Абзалов, Вадим Игоревич ; Зиннатулин, Тимур Раифович ; Григорьев, Семен Вячеславович. / Multiple-Source Context-Free Path Querying in Terms of Linear Algebra. In: OpenProceedings. 2021 ; pp. 487-492.

BibTeX

@article{43d73b8a08f94ca9bf2ee24161eb3393,
title = "Multiple-Source Context-Free Path Querying in Terms of Linear Algebra",
abstract = "Context-Free Path Querying (CFPQ) allows one to express path constraints in navigational graph queries as context-free grammars. Although there are many algorithms for CFPQ developed, no graph database provides full-stack support of CFPQ. The Azimov's CFPQ algorithm is applicable for real-world graph analyses, as shown by Arseniy Terekhov. In this work we provide a modification to Azimov's algorithm for multiple-source CFPQ which makes the algorithm more practical and eases the integration into RedisGraph graph database. We also implement a Cypher graph query language extension for context-free constraints. Thus we provide the first full-stack support of CFPQ for graph databases. Our evaluation shows that the provided solution is suitable for real-world graph analyses.",
author = "Терехов, {Арсений Константинович} and Погожельская, {Влада Владимировна} and Абзалов, {Вадим Игоревич} and Зиннатулин, {Тимур Раифович} and Григорьев, {Семен Вячеславович}",
note = "Publisher Copyright: {\textcopyright} 2021 Copyright held by the owner/author(s).; 24th International Conference on Extending Database Technology, EDBT 2021 ; Conference date: 23-03-2021 Through 26-03-2021",
year = "2021",
doi = "10.5441/002/edbt.2021.56",
language = "English",
pages = "487--492",
journal = "Advances in database technology",
issn = "2367-2005",

}

RIS

TY - JOUR

T1 - Multiple-Source Context-Free Path Querying in Terms of Linear Algebra

AU - Терехов, Арсений Константинович

AU - Погожельская, Влада Владимировна

AU - Абзалов, Вадим Игоревич

AU - Зиннатулин, Тимур Раифович

AU - Григорьев, Семен Вячеславович

N1 - Publisher Copyright: © 2021 Copyright held by the owner/author(s).

PY - 2021

Y1 - 2021

N2 - Context-Free Path Querying (CFPQ) allows one to express path constraints in navigational graph queries as context-free grammars. Although there are many algorithms for CFPQ developed, no graph database provides full-stack support of CFPQ. The Azimov's CFPQ algorithm is applicable for real-world graph analyses, as shown by Arseniy Terekhov. In this work we provide a modification to Azimov's algorithm for multiple-source CFPQ which makes the algorithm more practical and eases the integration into RedisGraph graph database. We also implement a Cypher graph query language extension for context-free constraints. Thus we provide the first full-stack support of CFPQ for graph databases. Our evaluation shows that the provided solution is suitable for real-world graph analyses.

AB - Context-Free Path Querying (CFPQ) allows one to express path constraints in navigational graph queries as context-free grammars. Although there are many algorithms for CFPQ developed, no graph database provides full-stack support of CFPQ. The Azimov's CFPQ algorithm is applicable for real-world graph analyses, as shown by Arseniy Terekhov. In this work we provide a modification to Azimov's algorithm for multiple-source CFPQ which makes the algorithm more practical and eases the integration into RedisGraph graph database. We also implement a Cypher graph query language extension for context-free constraints. Thus we provide the first full-stack support of CFPQ for graph databases. Our evaluation shows that the provided solution is suitable for real-world graph analyses.

UR - http://www.scopus.com/inward/record.url?scp=85110011618&partnerID=8YFLogxK

U2 - 10.5441/002/edbt.2021.56

DO - 10.5441/002/edbt.2021.56

M3 - Conference article

SP - 487

EP - 492

JO - Advances in database technology

JF - Advances in database technology

SN - 2367-2005

T2 - 24th International Conference on Extending Database Technology

Y2 - 23 March 2021 through 26 March 2021

ER -

ID: 84502422