Making RDBMSs efficient on graph workloads through predefine…
Emerging
6
Citations45
Refs2022
Year
Search Works
Work Details
- DOI 10.14778/3510397.3510400
- OpenAlex ID W3193493045
- Type Article
- Language EN
- Published 01 Jan 2022
- Volume 15 (5)
- Pages 1011–1023
- Source Proceedings of the VLDB Endowment
- Publisher Association for Computing Machinery
- FWCI 0.66
- Countries 2
- Institutions 2
- Added 10 Oct 2025
- Updated 16 Oct 2026
External Links
MENU
0
Making RDBMSs efficient on graph workloads through predefined joins
Article 2022 EN Green
Joins in native graph database management systems (GDBMSs) are predefined to the system as edges, which are indexed in adjacency list indices and serve as pointers. This contrasts with and can be more performant than value-based joins in RDBMSs. Existing approaches to integrate predefined joins into RDBMSs adopt a strict separation of graph and relational data and processors, where a graph-specifi…
6
Citations
45
References
2
Authors
0.66
FWCI
Citations by Year
Last 4 yearsTopics
Keywords
Authors & Affiliations
2 authors| # | Author | Institutions | ORCID |
|---|---|---|---|
| 1 | Guodong Jin | Renmin University of China (CN) | — |
| 2 | Semih Salihoğlu | University of Waterloo (CA) |
Related Works
10Data: OpenAlex