157 citations · 157 across the 4 of their papers we have counts for
7 papers · 1 filter
Making RDBMSs Efficient on Graph Workloads Through Predefined Joins
Guodong Jin, Semih Salihoglu
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…
Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs
Jeremy Chen, Yuqing Huang, Mushi Wang +2
We study two classes of summary-based cardinality estimators that use statistics about input relations and small-size joins in the context of graph database management systems: (i)…
Columnar Storage and List-based Processing for Graph Database Management Systems
Pranjal Gupta, Amine Mhedhbi, Semih Salihoglu
We revisit column-oriented storage and query processing techniques in the context of contemporary graph database management systems (GDBMSs). Similar to column-oriented RDBMSs, GDB…
Graphsurge: Graph Analytics on View Collections Using Differential Computation
Siddhartha Sahu, Semih Salihoglu
This paper presents the design and implementation of a new open-source view-based graph analytics system called Graphsurge. Graphsurge is designed to support applications that anal…
A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems
Amine Mhedhbi, Pranjal Gupta, Shahid Khaliq +1
Graph database management systems (GDBMSs) are highly optimized to perform fast traversals, i.e., joins of vertices with their neighbours, by indexing the neighbourhoods of vertice…
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing
Kaleb Alway, Eric Blais, Semih Salihoglu
Recent beyond worst-case optimal join algorithms Minesweeper and its generalization Tetris have brought the theory of indexing and join processing together by developing a geometri…