| 713 | -- | 738 | Yuli Jiang, Xin Huang 0001, Hong Cheng 0001. I/O efficient k-truss community search in massive graphs |
| 739 | -- | 768 | Agathe Balayn, Christoph Lofi, Geert-Jan Houben. Managing bias and unfairness in data for decision support: a survey of machine learning and data engineering approaches to identify and mitigate bias and unfairness within data management and analytics systems |
| 769 | -- | 797 | Yingxia Shao, Shiyue Huang, Yawen Li, Xupeng Miao, Bin Cui 0001, Lei Chen 0002. Memory-aware framework for fast and scalable second-order random walk over billion-edge natural graphs |
| 799 | -- | 823 | You Peng, Xuemin Lin 0001, Ying Zhang 0001, Wenjie Zhang 0001, Lu Qin, Jingren Zhou. Efficient Hop-constrained s-t Simple Path Enumeration |
| 825 | -- | 858 | Ariel Debrouvier, Eliseo Parodi, MatÃas Perazzo, Valeria Soliani, Alejandro A. Vaisman. A model and query language for temporal graph databases |
| 859 | -- | 881 | Jin Wang 0007, Jiacheng Wu, Mingda Li, Jiaqi Gu 0001, Ariyam Das, Carlo Zaniolo. Formal semantics and high performance in declarative machine learning using Datalog |
| 883 | -- | 905 | Timo Kersten, Viktor Leis, Thomas Neumann 0001. Tidy Tuples and Flying Start: fast compilation and fast execution of relational queries in Umbra |
| 907 | -- | 0 | Chengcheng Yang, Dong Deng 0001, Shuo Shang, Fan Zhu 0001, Li Liu 0004, Ling Shao 0001. Correction to: Internal and external memory set containment join |