| Title | Author(s) | Conference/Journal | Year | Tag(s) |
|---|---|---|---|---|
| "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction" | Zhijie Zhang | SIGMOD | 2024 | SM |
| GPU-Accelerated Batch-Dynamic Subgraph Matching | Linshan Qiu | ICDE | 2024 | SM;CSM;GPU |
| A survey of continuous subgraph matching for dynamic graphs | Xi Wang | Knowledge and Information Systems | 2023 | CSM |
| Circinus: Fast Redundancy-Reduced Subgraph Matching | Tatiana Jin | SIGMOD | 2023 | SM |
| Cyclosa: Redundancy-Free Graph Pattern Mining via Set Dataflow | Chuangyi Gui | ATC | 2023 | GPM |
| DecoMine: A Compilation-Based Graph Pattern Mining System with Pattern Decomposition | Jingji Chen | ASPLOS | 2023 | |
| Efficient GPU-Accelerated Subgraph Matching | Xibo Sun | SIGMOD | 2023 | SM;GPU |
| FASI: FPGA-friendly Subgraph Isomorphism on Massive Graphs | Xunbin Su | ICDE | 2023 | SM;FPGA |
| Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction | Rongjian Yang | SIGMOD | 2023 | CSM |
| Fast subgraph query processing and subgraph matching via static and dynamic equivalences | Hyunjoon Kim | VLDBJ | 2023 | SM |
| Fine-Grained Re-Execution for Efficient Batched Commit of Distributed Transactions | Zhiyuan Dong | VLDB | 2023 | |
| GLogS: Interactive Graph Pattern Matching Query At Large Scale | Longbin Lai | ATC | 2023 | GPM |
| GraphSet: High Performance Graph Mining through Equivalent Set Transformations | Tianhui Shi | SC | 2023 | |
| GuP: Fast Subgraph Matching by Guard-based Pruning | Junya Arai | SIGMOD | 2023 | SM |
| Khuzdul: Efficient and Scalable Distributed Graph Pattern Mining Engine | Jingji Chen | ASPLOS | 2023 | SM |
| KUZU Graph Database Management System | Xiyang Feng | CIDR | 2023 | DB |
| PanguLU: A Scalable Regular Two-Dimensional Block-Cyclic Sparse Direct Solver on Distributed Heterogeneous Systems | Xu Fu | SC | 2023 | |
| Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph Streams | Kaixin Wang | ICDE | 2023 | |
| SUFF: Accelerating Subgraph Matching with Historical Data | Xun Jian | VLDB | 2023 | SM |
| The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores | Maciej Besta | SC | 2023 | DB |
| Transaction Scheduling: From Conflicts to Runtime Conflicts | Yang Cao | 2023 | ||
| An In-Depth Study of Continuous Subgraph Matching | Xibo Sun | VLDB | 2022 | CSM |
| ByteGraph: A High-Performance Distributed Graph Database in ByteDance | Changji Li | VLDB | 2022 | DB |
| Efficient and Scalable Graph Pattern Mining on GPUs | Xuhao Chen | OSDI | 2022 | SM;GPU |
| FINGERS: exploiting fine-grained parallelism in graph mining accelerators | Qihang Chen | ASPLOS | 2022 | |
| Graph Pattern Matching in GQL and SQL/PGQ | Alin Deutsch | SIGMOD | 2022 | DB |
| Neural Subgraph Counting with Wasserstein Estimator | Hanchen Wang | SIGMOD | 2022 | SM |
| ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations | Maciej Besta | SC | 2022 | |
| RapidFlow: An Efficient Approach to Continuous Subgraph Matching | Shixuan Sun | VLDB | 2022 | CSM |
| Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching | Hanchen Wang | ICDE | 2022 | |
| STMatch: Accelerating Graph Pattern Matching on GPU with Stack-Based Loop Optimizations | Yihua Wei | SC | 2022 | SM;GPU |
| Subgraph Matching over Graph Federation | Ye Yuan | VLDB | 2022 | SM |
| Subgraph Matching With Effective Matching Order and Indexing | Shixuan Sun | TKDE | 2022 | SM |
| Subgraph Query Generation with Fairness and Diversity Constraints | Hanchao Ma | ICDE | 2022 | |
| VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases | Kai Huang | VLDB | 2022 | |
| VSGM: View-Based GPU-Accelerated Subgraph Matching on Large Graphs | Guanxian Jiang | SC | 2022 | SM;GPU |
| A Learned Sketch for Subgraph Counting | Kangfei Zhao | SIGMOD | 2021 | SM |
| A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems | Amine Mhedhbi | ICDE | 2021 | DB |
| aDFS: An Almost Depth-First-Search Distributed Graph-Querying System | Vasileios Trigonakis | ATC | 2021 | |
| cuTS: scaling subgraph isomorphism on distributed multi-GPU systems using trie based data structure | Lizhi Xiang | SC | 2021 | SM;GPU |
| Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | Chi Thang Duong | VLDB | 2021 | |
| FAST: FPGA-based Subgraph Matching on Massive Graphs | Xin Jin | ICDE | 2021 | SM;FPGA |
| GraphZero: A High-Performance Subgraph Matching System | Daniel Mawhirter | ACM SIGOPS Operating Systems Review | 2021 | SM |
| HUGE: An Efficient and Scalable Subgraph Enumeration System | Zhengyi Yang | SIGMOD | 2021 | SM |
| Leveraging Temporal and Topological Selectivities in Temporal-clique Subgraph Query Processing | Kaijie Zhu | ICDE | 2021 | |
| Mycelium: Large-Scale Distributed Graph Queries with Differential Privacy | Edo Roth | SOSP | 2021 | |
| Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins | Amine Mhedhbi | ACM Transactions on Database Systems | 2021 | CSM;WCOJ |
| Privacy and efficiency guaranteed social subgraph matching | Kai Huang | VLDB | 2021 | SM |
| Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming | Seunghwan Min | VLDB | 2021 | CSM |
| "Tesseract: Distributed, General Graph Pattern Mining on Evolving Graphs" | Laurent Bindschaedler | EuroSys | 2021 | |
| Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | Hyunjoon Kim | SIGMOD | 2021 | SM |
| Distributed Subgraph Counting: A General Approach | Hao Zhang | VLDB | 2020 | SM |
| G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching | Yeonsu Park | SIGMOD | 2020 | |
| GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | Wentian Guo | SIGMOD | 2020 | SM;GPU |
| GraphPi: high performance graph pattern matching through effective redundancy elimination | Tianhui Shi | SC | 2020 | GPM |
| GSI: GPU-friendly Subgraph Isomorphism | Li Zeng | ICDE | 2020 | GPU |
| G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph | Da Yan | ICDE | 2020 | |
| In-Memory Subgraph Matching: An In-depth Study | Shixuan Sun | SIGMOD | 2020 | SM |
| IntersectX: An Efficient Accelerator for Graph Mining | Gengyu Rao | 2020 | ||
| Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU | Xuhao Chen | VLDB | 2020 | GPM |
| PEREGRINE: A Pattern-Aware Graph Mining System | Kasra Jamshidi | EuroSys | 2020 | GPM |
| RapidMatch: A Holistic Approach to Subgraph Query Processing | Shixuan Sun | VLDB | 2020 | SM |
| The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins | Oren Kalinsky | ASPLOS | 2020 | |
| AutoMine: harmonizing high-level abstraction and high performance for graph mining | Daniel Mawhirter | SOSP | 2019 | |
| Efficient Parallel Subgraph Enumeration on a Single Machine | Shixuan Sun | ICDE | 2019 | SM |
| "Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together" | Myoungji Han | SIGMOD | 2019 | SM |
| G-Finder: Approximate Attributed Subgraph Matching | Lihui Liu | IEEE Big Data | 2019 | aSM |
| Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins | Amine Mhedhbi | VLDB | 2019 | SM;WCOJ |
| Fast and Adaptive List Intersections on the GPU | James Fox | GPU | 2018 | |
| The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing: Extended Survey | Siddhartha Sahu | VLDB | 2018 | DB |
| TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data | Kyongmin Kim | SIGMOD | 2018 | CSM |
| VF2++: An improved subgraph isomorphism algorithm | Alpár Jüttner | 2018 | SM | |
| Worst-case Optimal Join Algorithms | Hung Q. Ngo | 2018 | DB | |
| An Empirical Evaluation of In-Memory Multi-Version Concurrency Control | Yingjun Wu | VLDB | 2017 | |
| EmptyHeaded: A Relational Engine for Graph Processing | Christopher R. Aberger | ACM Transactions on Database Systems | 2017 | SM |
| Graphflow: An Active Graph Database | Chathura Kankanamge | SIGMOD | 2017 | DB;SM;CSM |
| Efficient Subgraph Matching by Postponing Cartesian Products | Fei Bi | SIGMOD | 2016 | SM |
| Factorized Databases | Dan Olteanu | SIGMOD | 2016 | DB |
| A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs | Sutanay Choudhury | EDBT | 2015 | CSM |
| Fast Subgraph Matching on Large Graphs using Graphics Processors | Ha-Nguyen Tran | 2015 | SM;GPU | |
| Size Bounds for Factorised Representations of Query Results | Dan Olteanu | ACM Transactions on Database Systems | 2015 | DB |
| The LDBC Social Network Benchmark: Interactive Workload | Orri Erling | SIGMOD | 2015 | DB |
| Faster set intersection with SIMD instructions by reducing branch mispredictions | Hiroshi Inoue | VLDB | 2014 | |
| Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age | Viktor Leis | SIGMOD | 2014 | |
| A subgraph isomorphism algorithm and its application to biochemical data | Vincenzo Bonnici | BMC Bioinformatics | 2013 | SM |
| Differential dataflow | Frank McSherry | CIDR | 2013 | |
| Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | Takuya Akiba | SIGMOD | 2013 | |
| Incremental Graph Pattern Matching | Wenfei Fan | ACM Transactions on Database Systems | 2013 | CSM |
| Skew Strikes Back: New Developments in the Theory of Join Algorithms | Hung Q. Ngo | SIGMOD | 2013 | DB |
| "Leapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm" | Todd L. Veldhuizen | null | 2012 | DB;WCOJ |
| SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | Shijie Zhang | VLDB | 2010 | aSM |
| A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs | Luigi P. Cordella | 2004 | SM | |
| Join Processing in Relational Databases | Priti Mishra | 1992 | DB | |
| Join Processing in Database Systems with Large Main Memories | Leonard D. Shapiro | 1986 | DB | |
| An Algorithm for Subgraph Isomorphism | J. R. Ullmann | Journal of the ACM | 1976 | SM |
-
Notifications
You must be signed in to change notification settings - Fork 0
w20chen/paper-reading-list
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
paper reading list