Revenue maximization for query pricing S Chawla, S Deep, P Koutris, Y Teng Proceedings of the VLDB Endowment 13 (1), 1-14, 2019 | 37 | 2019 |
QIRANA: A framework for scalable query pricing S Deep, P Koutris Proceedings of the 2017 ACM International Conference on Management of Data …, 2017 | 37 | 2017 |
The Design of Arbitrage-Free Data Pricing Schemes S Deep, P Koutris LIPIcs-Leibniz International Proceedings in Informatics 68, 2017 | 31 | 2017 |
Ranked enumeration of conjunctive query results S Deep, P Koutris 24th International Conference on Database Theory, 2021 | 28 | 2021 |
Compressed representations of conjunctive query results S Deep, P Koutris Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018 | 21 | 2018 |
Diametrics: benchmarking query engines at scale S Deep, A Gruenheid, K Nagaraj, H Naito, J Naughton, S Viglas ACM SIGMOD Record 50 (1), 24-31, 2021 | 14 | 2021 |
Fast join project query evaluation using matrix multiplication S Deep, X Hu, P Koutris Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020 | 14* | 2020 |
Enumeration algorithms for conjunctive queries with projection S Deep, X Hu, P Koutris 24th International Conference on Database Theory (ICDT 2021), 2021 | 13 | 2021 |
Comprehensive and efficient workload compression S Deep, A Gruenheid, P Koutris, J Naughton, S Viglas Proceedings of the VLDB Endowment 14 (3), 418-430, 2020 | 11 | 2020 |
Qirana demonstration: real time scalable query pricing S Deep, P Koutris, Y Bidasaria Proceedings of the VLDB Endowment 10 (12), 1949-1952, 2017 | 8 | 2017 |
Space-time tradeoffs for answering boolean conjunctive queries S Deep, X Hu, P Koutris arXiv preprint arXiv:2109.10889, 2021 | 2 | 2021 |
The Fine-Grained Complexity of CFL Reachability P Koutris, S Deep Proceedings of the ACM on Programming Languages 7 (POPL), 1713-1739, 2023 | | 2023 |
Ranked enumeration of join queries with projections S Deep, X Hu, P Koutris Proceedings of the VLDB Endowment 15 (5), 2022 | | 2022 |