Nikolay Yakovets

Dr. Nikolay Yakovets


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 January 2024
Verified
Conference Paper
Open access
PDF file
ZCZeno Cauter
Zeno Cauter
NYNikolay Yakovets
Nikolay Yakovets
Zeno Cauter, Nikolay Yakovets. Proceedings of the 1st Workshop on Knowledge Graphs and Large Language Models (KaLLM 2024). 2024.


21 January 2025 in The VLDB Journal
Verified
Journal Article
Open access
PDF file
TMThomas Mulder
Thomas Mulder
GFGeorge Fletcher
George Fletcher
NYNikolay Yakovets
Nikolay Yakovets
We study the optimization of navigational graph queries in the form of the Regular Queries, i.e., queries which combine recursive and pattern-matching fragments. Current approaches to their evaluation are not effective in practice. Towards addressing this, we present a number of novel powerful optimization techniques which aim to constrain the intermediate results during query evaluation. We show how these techniques can be planned effectively and executed efficiently towards the first practical evaluation solution for complex navigational queries on real-world workloads. Indeed, our experimental results show several orders of magnitude improvement in query evaluation performance over state-of-the-art techniques on a wide range of queries on diverse datasets.

21 October 2024
Verified
Conference Paper
Open access
LSLarissa C. Shimomura
Larissa C. Shimomura
NYNikolay Yakovets
Nikolay Yakovets
GFGeorge Fletcher
George Fletcher
Knowledge graphs have soared in popularity by supporting different types of applications and domains. In this context, the property graph data model has become an emerging standard in industry and academia. With its widespread use, there is also an increasing interest in investigating constraints for property graph data and their applications in data profiling. Graph Generating Dependencies (GGDs) are a class of property graph data dependencies that can express constraints on topology and properties of nodes and edges of the graph, making them a suitable candidate to expose an overview of the property graph to the user (profile graph data). However, GGDs can be difficult to set manually. To solve this issue, we propose a framework for discovering GGDs automatically from the property graph to profile graph data. Our framework has three main steps: (1) pre-processing, (2) candidate generation, and, (3) GGD extraction. Our results show that the discovered set of GGDs can give an overview of the input graph, including schema-level information between the graph patterns and attributes.

20 February 2019
Verified
Book Chapter
Closed access
PDF file
SSS. Salihoglu
S. Salihoglu
NYNikolay Yakovets
Nikolay Yakovets

10 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
DGDaan de Graaf
Daan de Graaf
RBRobert Brijder
Robert Brijder
SCSoham Chakraborty
Soham Chakraborty
GFGeorge Fletcher
George Fletcher
BWBram van de Wall
Bram van de Wall
NYNikolay Yakovets
Nikolay Yakovets
Graph database query languages cannot express algorithms like PageRank, forcing costly data wrangling, while existing solutions such as algorithm libraries, vertex-centric APIs, and recursive CTEs lack the necessary combination of expressiveness, performance, and usability. We present GraphAlg: a domain-specific language for graph algorithms that compiles to relational algebra, enabling seamless integration with query processing pipelines. Built on linear algebra foundations, GraphAlg provides intuitive matrix operations that are amenable to aggressive optimization including sparsity analysis, loop-invariant code motion, and in-place aggregation. Our implementation in AvantGraph demonstrates significant code complexity reduction compared to SQL/Python and Pregel while achieving excellent performance on LDBC Graphalytics benchmarks. GraphAlg establishes that graph databases can serve as unified platforms for both queries and analytics.