| FPTree: A hybrid SCM-DRAM persistent and concurrent B-tree for storage class memory I Oukid, J Lasperas, A Nica, T Willhalm, W Lehner Proceedings of the 2016 International Conference on Management of Data, 371-386, 2016 | 395 | 2016 |
| Evaluating persistent memory range indexes L Lersch, X Hao, I Oukid, T Wang, T Willhalm Proceedings of the VLDB Endowment 13 (4), 574-587, 2019 | 127 | 2019 |
| SOFORT: A hybrid SCM-DRAM storage engine for fast data recovery I Oukid, D Booss, W Lehner, P Bumbulis, T Willhalm Proceedings of the Tenth International Workshop on Data Management on New …, 2014 | 110 | 2014 |
| Vectorizing Database Column Scans with Complex Predicates. T Willhalm, I Oukid, I Müller, F Faerber ADMS@ VLDB, 1-12, 2013 | 110 | 2013 |
| Memory management techniques for large-scale persistent-main-memory systems I Oukid, D Booss, A Lespinasse, W Lehner, T Willhalm, G Gomes Proceedings of the VLDB Endowment 10 (11), 1166-1177, 2017 | 86 | 2017 |
| Instant Recovery for Main Memory Databases. I Oukid, W Lehner, T Kissinger, T Willhalm, P Bumbulis CIDR, 2015 | 64 | 2015 |
| Bridging the latency gap between NVM and DRAM for latency-bound operations G Psaropoulos, I Oukid, T Legler, N May, A Ailamaki Proceedings of the 15th International Workshop on Data Management on New …, 2019 | 50 | 2019 |
| Enabling low tail latency on multicore key-value stores L Lersch, I Schreter, I Oukid, W Lehner Proceedings of the VLDB Endowment 13 (7), 1091-1104, 2020 | 32 | 2020 |
| Pruning indexes to enhance database query processing T Cruanes, B Dageville, I Oukid, S Richter US Patent 10,769,150, 2020 | 28 | 2020 |
| Data structure engineering for byte-addressable non-volatile memory I Oukid, W Lehner Proceedings of the 2017 ACM International Conference on Management of Data …, 2017 | 26 | 2017 |
| Hybrid SCM-DRAM transactional storage engine for fast data recovery D Booss, P Bumbulis, W Lehner, I Oukid, T Willhalm US Patent 10,162,716, 2018 | 24 | 2018 |
| Secondary data structures for storage class memory (scm) enables main-memory databases J Lasperas, I Oukid, A Nica US Patent 10,019,382, 2018 | 23 | 2018 |
| Database query processing using a pruning index T Cruanes, B Dageville, I Oukid, S Richter US Patent 10,942,925, 2021 | 22 | 2021 |
| Scan set pruning for pattern matching queries T Cruanes, B Dageville, I Oukid, S Richter US Patent 11,016,975, 2021 | 21 | 2021 |
| Pruning index for optimization of pattern matching queries T Cruanes, B Dageville, I Oukid, S Richter US Patent 10,997,179, 2021 | 21 | 2021 |
| Generation of pruning index for pattern matching queries T Cruanes, B Dageville, I Oukid, S Richter US Patent 11,113,286, 2021 | 20 | 2021 |
| Database query processing using a pruning index T Cruanes, B Dageville, I Oukid, S Richter US Patent 11,086,875, 2021 | 19 | 2021 |
| Fast & strong: The case of compressed string dictionaries on modern CPUs R Lasch, I Oukid, R Dementiev, N May, SS Demirsoy, KU Sattler Proceedings of the 15th International Workshop on Data Management on New …, 2019 | 19 | 2019 |
| Persistent buffer management with optimistic consistency L Lersch, W Lehner, I Oukid Proceedings of the 15th International Workshop on Data Management on New …, 2019 | 17 | 2019 |
| On the diversity of memory and storage technologies I Oukid, L Lersch Datenbank-Spektrum 18 (2), 121-127, 2018 | 17 | 2018 |
