 | Monter d'un niveau |
Mhedhbi, A. (2023). GraphflowDB : scalable query processing on graph-structured relation Lien externe
Mhedhbi, A., & Salihoğlu, S. (2022). Modern techniques for querying graph-structured relations: foundations, system implementations, and open challenges. Proceedings of the VLDB Endowment, 15(12), 3762-3765. Lien externe
Mhedhbi, A., Gupta, P., Khaliq, S., & Salihoglu, S. (avril 2021). A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems [Communication écrite]. 37th IEEE International Conference on Data Engineering (ICDE 2021), Chania, Greece. Lien externe
Gupta, P., Mhedhbi, A., & Salihoglu, S. (2021). Columnar storage and list-based processing for graph database management systems. Proceedings of the VLDB Endowment, 14(11), 2491-2504. Lien externe
Mhedhbi, A., Lissandrini, M., Kuiper, L., Waudby, J., & Szárnyas, G. (juin 2021). LSQB: a large-scale subgraph query benchmark [Communication écrite]. 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES 2021) and Network Data Analytics (NDA 2021) (11 pages). Lien externe
Mhedhbi, A., Kankanamge, C., & Salihoglu, S. (2021). Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins. ACM Transactions on Database Systems, 46(2), 6 (45 pages). Lien externe
Sahu, S., Mhedhbi, A., Salihoglu, S., Lin, J., & Özsu, M. T. (2020). The ubiquity of large graphs and surprising challenges of graph processing: extended survey. The VLDB Journal, 29(2), 595-618. Lien externe
Mhedhbi, A., & Salihoglu, S. (2019). Optimizing subgraph queries by combining binary and worst-case optimal joins. Proceedings of the VLDB Endowment, 12(11), 1692-1704. Lien externe
Kankanamge, C., Sahu, S., Mhedhbi, A., Chen, J., & Salihoglu, S. (mai 2017). Graphflow: An Active Graph Database [Communication écrite]. ACM International Conference on Management of Data (SIGMOD 2017), Chicago, Illinois, USA. Lien externe
Sahu, S., Mhedhbi, A., Salihoglu, S., Lin, J., & Özsu, M. T. (2017). The ubiquity of large graphs and surprising challenges of graph processing. Proceedings of the VLDB Endowment, 11(4), 420-431. Lien externe
