EDBT 2026 Demo / reviewers in the wild / expert
Haoran Zhang 0006
dblp:95/4452-6
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-4641-0641ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Graph data management · 44% Knowledge graphs · 29% Database system architecture and tuning · 27% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph data management › graph storage
knowledge graph storage |
1.2 | 2 | 2023 | A Dual-Store Structure for Knowledge Graphs · IEEE Trans. Knowl. Data Eng. 2023 A Dual-Store Structure for Knowledge Graphs (Extended Abstract) · ICDE 2022 |
Knowledge graphs
knowledge graph querying |
0.8 | 2 | 2023 | A Dual-Store Structure for Knowledge Graphs · IEEE Trans. Knowl. Data Eng. 2023 A Dual-Store Structure for Knowledge Graphs (Extended Abstract) · ICDE 2022 |
Database system architecture and tuning › database design
physical database design |
0.8 | 2 | 2023 | A Dual-Store Structure for Knowledge Graphs (Extended Abstract) · ICDE 2022 A Dual-Store Structure for Knowledge Graphs · IEEE Trans. Knowl. Data Eng. 2023 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.2markov decision process · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | A Dual-Store Structure for Knowledge GraphsabstractTo effectively manage increasing knowledge graphs in various domains, a hot research topic, knowledge graph storage management, has emerged. Existing methods are classified to relational stores and native graph stores. Relational stores are able to store large-scale knowledge graphs and convenient in updating knowledge, but the query performance weakens obviously when the selectivity of a knowledge graph query is large. Native graph stores are efficient in processing complex knowledge graph queries due to its index-free adjacent property, but they are inapplicable to manage a large-scale knowledge graph due to limited storage budgets or inflexible updating process. Motivated by this, we propose a dual-store structure which leverages a graph store to accelerate the complex query process in the relational store. However, it is challenging to determine what data to transfer from relational store to graph store at what time. To address this problem, we formulate it as a Markov Decision Process and derive a physical design tuner DOTIL based on reinforcement learning. With DOTIL, the dual-store structure is adaptive to dynamic changing workloads. Experimental results on real knowledge graphs demonstrate that our proposed dual-store structure improves query performance up to average 43.72% compared with the most commonly used relational stores. Zhixin Qi, Hongzhi Wang 0001, Haoran Zhang 0006 |
IEEE Trans. Knowl. Data Eng. | 3 |
| 2022 | A Dual-Store Structure for Knowledge Graphs (Extended Abstract)abstractExisting knowledge graph stores are classified to relational stores and native graph stores. Relational stores are able to store large-scale knowledge graphs and convenient in updating data, but the query performance weakens obviously when the selectivity of a knowledge graph query is large. Graph stores are efficient in processing complex knowledge graph queries, but they are inapplicable to manage a large-scale knowledge graph due to limited storage budgets or inflexible updating process. Motivated by this, we propose a dual-store structure which leverages a graph store to accelerate the complex query process in the relational store. However, it is challenging to determine that when we transfer which data partitions from relational store to graph store. To address this problem, we derive a physical design tuner DOTIL based on reinforcement learning. Experimental results demonstrate that the dual-store structure improves query performance up to average 50.11% compared with the most commonly used relational stores. Zhixin Qi, Hongzhi Wang 0001, Haoran Zhang 0006 |
ICDE | 3 |