Mahmoud Abo Khamis : Publications

Journal papers

• [1]

  Maintaining Queries under Updates Using Heavy−Light Partitioning of the Input Relations

  Abo Khamis‚ Mahmoud‚ Eden Chmielewski‚ Andrei Draghici‚ Ahmet Kara and Dan Olteanu

  In Proc. ACM Manag. Data. Vol. 4. No. 2. May, 2026.

  Details about Maintaining Queries under Updates Using Heavy−Light Partitioning of the Input Relations | BibTeX data for Maintaining Queries under Updates Using Heavy−Light Partitioning of the Input Relations | DOI (10.1145/3801905) | Link to Maintaining Queries under Updates Using Heavy−Light Partitioning of the Input Relations

• [2]

  Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular−Width Time

  Abo Khamis‚ Mahmoud and Hubie Chen

  In Proc. ACM Manag. Data. Vol. 4. No. 2. May, 2026.

  Details about Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular−Width Time | BibTeX data for Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular−Width Time | DOI (10.1145/3801904) | Link to Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular−Width Time

• [3]

  Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries

  Abo Khamis‚ Mahmoud‚ Alexandru−Mihai Hurjui‚ Ahmet Kara‚ Dan Olteanu and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 4. No. 2. May, 2026.

  Details about Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | BibTeX data for Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | DOI (10.1145/3801891) | Link to Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries

• [4]

  PANDAExpress: A Simpler and Faster PANDA Algorithm

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 4. No. 2. May, 2026.

  Details about PANDAExpress: A Simpler and Faster PANDA Algorithm | BibTeX data for PANDAExpress: A Simpler and Faster PANDA Algorithm | DOI (10.1145/3801910) | Link to PANDAExpress: A Simpler and Faster PANDA Algorithm

• [5]

  CorrBound: Cardinality Estimation Accounting for Inter− and Intra−relation Correlations

  Christoph Mayer‚ Haozhe Zhang‚ Mahmoud Abo Khamis‚ Kyle Deeds‚ Dan Olteanu and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 4. No. 1. April, 2026.

  Details about CorrBound: Cardinality Estimation Accounting for Inter− and Intra−relation Correlations | BibTeX data for CorrBound: Cardinality Estimation Accounting for Inter− and Intra−relation Correlations | DOI (10.1145/3786633) | Link to CorrBound: Cardinality Estimation Accounting for Inter− and Intra−relation Correlations

• [6]

  Pessimistic Cardinality Estimation

  Abo Khamis‚ Mahmoud‚ Kyle Deeds‚ Dan Olteanu and Dan Suciu

  In SIGMOD Rec.. Vol. 53. No. 4. Pages 1–17. January, 2025.

  Details about Pessimistic Cardinality Estimation | BibTeX data for Pessimistic Cardinality Estimation | DOI (10.1145/3712311.3712313) | Link to Pessimistic Cardinality Estimation

• [7]

  Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation

  Abo Khamis‚ Mahmoud‚ Vasileios Nakos‚ Dan Olteanu and Dan Suciu

  In SIGMOD Rec.. Vol. 54. No. 1. Pages 7–15. April, 2025.

  Details about Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation | BibTeX data for Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation | DOI (10.1145/3733620.3733623) | Link to Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation

• [8]

  PANDA: Query Evaluation in Submodular Width

  Mahmoud Abo Khamis‚ Hung Q. Ngo and Dan Suciu

  In TheoretiCS. Vol. Volume 4. April, 2025.

  Details about PANDA: Query Evaluation in Submodular Width | BibTeX data for PANDA: Query Evaluation in Submodular Width | DOI (10.46298/theoretics.25.12) | Link to PANDA: Query Evaluation in Submodular Width

• [9]

  Output−Sensitive Evaluation of Regular Path Queries

  Abo Khamis‚ Mahmoud‚ Ahmet Kara‚ Dan Olteanu and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 3. No. 2. June, 2025.

  Details about Output−Sensitive Evaluation of Regular Path Queries | BibTeX data for Output−Sensitive Evaluation of Regular Path Queries | DOI (10.1145/3725242) | Link to Output−Sensitive Evaluation of Regular Path Queries

• [10]

  Fast Matrix Multiplication meets the Submodular Width

  Abo Khamis‚ Mahmoud‚ Xiao Hu and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 3. No. 2. June, 2025.

  Details about Fast Matrix Multiplication meets the Submodular Width | BibTeX data for Fast Matrix Multiplication meets the Submodular Width | DOI (10.1145/3725235) | Link to Fast Matrix Multiplication meets the Submodular Width

• [11]

  A Unifying Algorithm for Hierarchical Queries

  Abo Khamis‚ Mahmoud‚ Jesse Comer‚ Phokion G. Kolaitis‚ Sudeepa Roy and Val Tannen

  In Proc. ACM Manag. Data. Vol. 3. No. 5. November, 2025.

  Details about A Unifying Algorithm for Hierarchical Queries | BibTeX data for A Unifying Algorithm for Hierarchical Queries | DOI (10.1145/3767710) | Link to A Unifying Algorithm for Hierarchical Queries

• [12]

  LpBound: Pessimistic Cardinality Estimation Using ℓp−Norms of Degree Sequences

  Haozhe Zhang‚ Christoph Mayer‚ Mahmoud Abo Khamis‚ Dan Olteanu and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 3. No. 3. June, 2025.

  Details about LpBound: Pessimistic Cardinality Estimation Using ℓp−Norms of Degree Sequences | BibTeX data for LpBound: Pessimistic Cardinality Estimation Using ℓp−Norms of Degree Sequences | DOI (10.1145/3725321) | Link to LpBound: Pessimistic Cardinality Estimation Using ℓp−Norms of Degree Sequences

• [13]

  Join Size Bounds using lp−Norms on Degree Sequences

  Abo Khamis‚ Mahmoud‚ Vasileios Nakos‚ Dan Olteanu and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 2. No. 2. May, 2024.

  Details about Join Size Bounds using lp−Norms on Degree Sequences | BibTeX data for Join Size Bounds using lp−Norms on Degree Sequences | DOI (10.1145/3651597) | Link to Join Size Bounds using lp−Norms on Degree Sequences

• [14]

  Insert−Only versus Insert−Delete in Dynamic Query Evaluation

  Abo Khamis‚ Mahmoud‚ Ahmet Kara‚ Dan Olteanu and Dan Suciu

  In Proc. ACM Manag. Data. Vol. 2. No. 5. November, 2024.

  Details about Insert−Only versus Insert−Delete in Dynamic Query Evaluation | BibTeX data for Insert−Only versus Insert−Delete in Dynamic Query Evaluation | DOI (10.1145/3695837) | Link to Insert−Only versus Insert−Delete in Dynamic Query Evaluation

• [15]

  Convergence of datalog over (Pre−) Semirings

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo‚ Reinhard Pichler‚ Dan Suciu and Yisu Remy Wang

  In J. ACM. Vol. 71. No. 2. April, 2024.

  Details about Convergence of datalog over (Pre−) Semirings | BibTeX data for Convergence of datalog over (Pre−) Semirings | DOI (10.1145/3643027) | Link to Convergence of datalog over (Pre−) Semirings

• [16]

  Convergence of Datalog over (Pre−) Semirings

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo‚ Reinhard Pichler‚ Dan Suciu and Yisu Remy Wang

  In SIGMOD Rec.. Vol. 52. No. 1. Pages 75–82. June, 2023.

  Details about Convergence of Datalog over (Pre−) Semirings | BibTeX data for Convergence of Datalog over (Pre−) Semirings | DOI (10.1145/3604437.3604454) | Link to Convergence of Datalog over (Pre−) Semirings

• [17]

  Datalog in Wonderland

  Mahmoud Abo Khamis‚ Hung Q. Ngo‚ Reinhard Pichler‚ Dan Suciu and Yisu Remy Wang

  In SIGMOD Rec.. Vol. 51. No. 2. Pages 6–17. July, 2022.

  Details about Datalog in Wonderland | BibTeX data for Datalog in Wonderland | DOI (10.1145/3552490.3552492) | Link to Datalog in Wonderland

• [18]

  Instance Optimal Join Size Estimation

  Mahmoud Abo−Khamis‚ Sungjin Im‚ Benjamin Moseley‚ Kirk Pruhs and Alireza Samadian

  In Procedia Computer Science. Vol. 195. Pages 135−144. 2021.

  Proceedings of the XI Latin and American Algorithms‚ Graphs and Optimization Symposium.

  Details about Instance Optimal Join Size Estimation | BibTeX data for Instance Optimal Join Size Estimation | DOI (https://doi.org/10.1016/j.procs.2021.11.019) | Link to Instance Optimal Join Size Estimation

• [19]

  Bag Query Containment and Information Theory

  Mahmoud Abo Khamis‚ Phokion G. Kolaitis‚ Hung Q. Ngo and Dan Suciu

  In ACM Trans. Database Syst.. Vol. 46. No. 3. September, 2021.

  Details about Bag Query Containment and Information Theory | BibTeX data for Bag Query Containment and Information Theory | DOI (10.1145/3472391) | Link to Bag Query Containment and Information Theory

• [20]

  Functional Aggregate Queries with Additive Inequalities

  Mahmoud Abo Khamis‚ Ryan R. Curtin‚ Benjamin Moseley‚ Hung Q. Ngo‚ Xuanlong Nguyen‚ Dan Olteanu and Maximilian Schleich

  In ACM Trans. Database Syst.. Vol. 45. No. 4. December, 2020.

  Details about Functional Aggregate Queries with Additive Inequalities | BibTeX data for Functional Aggregate Queries with Additive Inequalities | DOI (10.1145/3426865) | Link to Functional Aggregate Queries with Additive Inequalities

• [21]

  Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies

  Mahmoud Abo Khamis‚ Hung Q. Ngo‚ Xuanlong Nguyen‚ Dan Olteanu and Maximilian Schleich

  In ACM Trans. Database Syst.. Vol. 45. No. 2. June, 2020.

  Details about Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies | BibTeX data for Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies | DOI (10.1145/3375661) | Link to Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies

• [22]

  Juggling Functions Inside a Database

  Mahmoud Abo Khamis‚ Hung Q. Ngo and Atri Rudra

  In SIGMOD Rec.. Vol. 46. No. 1. Pages 6–13. May, 2017.

  Details about Juggling Functions Inside a Database | BibTeX data for Juggling Functions Inside a Database | DOI (10.1145/3093754.3093757) | Link to Juggling Functions Inside a Database

• [23]

  Joins via Geometric Resolutions: Worst Case and Beyond

  Mahmoud Abo Khamis‚ Hung Q. Ngo‚ Christopher Ré and Atri Rudra

  In ACM Trans. Database Syst.. Vol. 41. No. 4. November, 2016.

  Details about Joins via Geometric Resolutions: Worst Case and Beyond | BibTeX data for Joins via Geometric Resolutions: Worst Case and Beyond | DOI (10.1145/2967101) | Link to Joins via Geometric Resolutions: Worst Case and Beyond

Conference papers

• [1]

  Output−Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries

  Abo Khamis‚ Mahmoud‚ Alexandru−Mihai Hurjui‚ Ahmet Kara‚ Dan Olteanu‚ Dan Suciu and Zilu Tian

  In Balder ten Cate and Maurice Funk, editors, 29th International Conference on Database Theory (ICDT 2026). Vol. 365 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 18:1–18:20. Dagstuhl‚ Germany. 2026. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.

  Details about Output−Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries | BibTeX data for Output−Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries | DOI (10.4230/LIPIcs.ICDT.2026.18) | Link to Output−Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries

• [2]

  Query Optimization and Evaluation via Information Theory

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo and Dan Suciu

  In Companion of the 45th Symposium on Principles of Database Systems. Pages 2–17. New York‚ NY‚ USA. 2026. Association for Computing Machinery.

  Details about Query Optimization and Evaluation via Information Theory | BibTeX data for Query Optimization and Evaluation via Information Theory | DOI (10.1145/3788852.3805595) | Link to Query Optimization and Evaluation via Information Theory

• [3]

  LpBound in Action: Cardinality Estimation with One−Sided Guarantees

  Christoph Mayer‚ Haozhe Zhang‚ Mahmoud Abo Khamis‚ Dan Olteanu and Dan Suciu

  In Companion of the 2025 International Conference on Management of Data. Pages 187–190. New York‚ NY‚ USA. 2025. Association for Computing Machinery.

  Details about LpBound in Action: Cardinality Estimation with One−Sided Guarantees | BibTeX data for LpBound in Action: Cardinality Estimation with One−Sided Guarantees | DOI (10.1145/3722212.3725114) | Link to LpBound in Action: Cardinality Estimation with One−Sided Guarantees

• [4]

  The Complexity of Boolean Conjunctive Queries with Intersection Joins

  Abo Khamis‚ Mahmoud‚ George Chichirim‚ Antonia Kormpa and Dan Olteanu

  In Proceedings of the 41st ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 53–65. New York‚ NY‚ USA. 2022. Association for Computing Machinery.

  Details about The Complexity of Boolean Conjunctive Queries with Intersection Joins | BibTeX data for The Complexity of Boolean Conjunctive Queries with Intersection Joins | DOI (10.1145/3517804.3524156) | Link to The Complexity of Boolean Conjunctive Queries with Intersection Joins

• [5]

  Optimizing Recursive Queries with Program Synthesis

  Yisu Remy Wang‚ Mahmoud Abo Khamis‚ Hung Q. Ngo‚ Reinhard Pichler and Dan Suciu

  In Proceedings of the 2022 International Conference on Management of Data. Pages 79–93. New York‚ NY‚ USA. 2022. Association for Computing Machinery.

  Details about Optimizing Recursive Queries with Program Synthesis | BibTeX data for Optimizing Recursive Queries with Program Synthesis | DOI (10.1145/3514221.3517827) | Link to Optimizing Recursive Queries with Program Synthesis

• [6]

  Convergence of Datalog over (Pre−) Semirings

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo‚ Reinhard Pichler‚ Dan Suciu and Yisu Remy Wang

  In Proceedings of the 41st ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 105–117. New York‚ NY‚ USA. 2022. Association for Computing Machinery.

  Details about Convergence of Datalog over (Pre−) Semirings | BibTeX data for Convergence of Datalog over (Pre−) Semirings | DOI (10.1145/3517804.3524140) | Link to Convergence of Datalog over (Pre−) Semirings

• [7]

  Approximate Aggregate Queries Under Additive Inequalities

  Mahmoud Abo−Khamis‚ Sungjin Im‚ Benjamin Moseley‚ Kirk Pruhs and Alireza Samadian

  In Symposium on Algorithmic Principles of Computer Systems (APOCS). Pages 85–99. SIAM. 2021.

  Details about Approximate Aggregate Queries Under Additive Inequalities | BibTeX data for Approximate Aggregate Queries Under Additive Inequalities | DOI (10.1137/1.9781611976489.7) | Link to Approximate Aggregate Queries Under Additive Inequalities

• [8]

  A Relational Gradient Descent Algorithm For Support Vector Machine Training

  Mahmoud Abo−Khamis‚ Sungjin Im‚ Benjamin Moseley‚ Kirk Pruhs and Alireza Samadian

  In Symposium on Algorithmic Principles of Computer Systems (APOCS). Pages 100–113. SIAM. 2021.

  Details about A Relational Gradient Descent Algorithm For Support Vector Machine Training | BibTeX data for A Relational Gradient Descent Algorithm For Support Vector Machine Training | DOI (10.1137/1.9781611976489.8) | Link to A Relational Gradient Descent Algorithm For Support Vector Machine Training

• [9]

  An Approximation Algorithm for the Matrix Tree Multiplication Problem

  Mahmoud Abo−Khamis‚ Ryan Curtin‚ Sungjin Im‚ Benjamin Moseley‚ Hung Ngo‚ Kirk Pruhs and Alireza Samadian

  In Filippo Bonchi and Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Vol. 202 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 6:1–6:14. Dagstuhl‚ Germany. 2021. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.

  Details about An Approximation Algorithm for the Matrix Tree Multiplication Problem | BibTeX data for An Approximation Algorithm for the Matrix Tree Multiplication Problem | DOI (10.4230/LIPIcs.MFCS.2021.6) | Link to An Approximation Algorithm for the Matrix Tree Multiplication Problem

• [10]

  Bag Query Containment and Information Theory

  Abo Khamis‚ Mahmoud‚ Phokion G. Kolaitis‚ Hung Q. Ngo and Dan Suciu

  In Proceedings of the 39th ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 95–112. New York‚ NY‚ USA. 2020. Association for Computing Machinery.

  Details about Bag Query Containment and Information Theory | BibTeX data for Bag Query Containment and Information Theory | DOI (10.1145/3375395.3387645) | Link to Bag Query Containment and Information Theory

• [11]

  Decision Problems in Information Theory

  Abo Khamis‚ Mahmoud‚ Phokion G. Kolaitis‚ Hung Q. Ngo and Dan Suciu

  In Artur Czumaj‚ Anuj Dawar and Emanuela Merelli, editors, 47th International Colloquium on Automata‚ Languages‚ and Programming (ICALP 2020). Vol. 168 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 106:1–106:20. Dagstuhl‚ Germany. 2020. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.

  Details about Decision Problems in Information Theory | BibTeX data for Decision Problems in Information Theory | DOI (10.4230/LIPIcs.ICALP.2020.106) | Link to Decision Problems in Information Theory

• [12]

  Boolean Tensor Decomposition for Conjunctive Queries with Negation

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo‚ Dan Olteanu and Dan Suciu

  In Pablo Barcelo and Marco Calautti, editors, 22nd International Conference on Database Theory (ICDT 2019). Vol. 127 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 21:1–21:19. Dagstuhl‚ Germany. 2019. Schloss Dagstuhl – Leibniz−Zentrum für Informatik.

  Details about Boolean Tensor Decomposition for Conjunctive Queries with Negation | BibTeX data for Boolean Tensor Decomposition for Conjunctive Queries with Negation | DOI (10.4230/LIPIcs.ICDT.2019.21) | Link to Boolean Tensor Decomposition for Conjunctive Queries with Negation

• [13]

  A Layered Aggregate Engine for Analytics Workloads

  Maximilian Schleich‚ Dan Olteanu‚ Mahmoud Abo Khamis‚ Hung Q. Ngo and XuanLong Nguyen

  In Proceedings of the 2019 International Conference on Management of Data. Pages 1642–1659. New York‚ NY‚ USA. 2019. Association for Computing Machinery.

  Details about A Layered Aggregate Engine for Analytics Workloads | BibTeX data for A Layered Aggregate Engine for Analytics Workloads | DOI (10.1145/3299869.3324961) | Link to A Layered Aggregate Engine for Analytics Workloads

• [14]

  Learning Models over Relational Data: A Brief Tutorial

  Maximilian Schleich‚ Dan Olteanu‚ Mahmoud Abo−Khamis‚ Hung Q. Ngo and XuanLong Nguyen

  In Ben Amor‚ Nahla‚ Benjamin Quost and Martin Theobald, editors, Scalable Uncertainty Management. Pages 423–432. Cham. 2019. Springer International Publishing.

  Details about Learning Models over Relational Data: A Brief Tutorial | BibTeX data for Learning Models over Relational Data: A Brief Tutorial

• [15]

  On Functional Aggregate Queries with Additive Inequalities

  Abo Khamis‚ Mahmoud‚ Ryan R. Curtin‚ Benjamin Moseley‚ Hung Q. Ngo‚ XuanLong Nguyen‚ Dan Olteanu and Maximilian Schleich

  In Proceedings of the 38th ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 414–431. New York‚ NY‚ USA. 2019. Association for Computing Machinery.

  Details about On Functional Aggregate Queries with Additive Inequalities | BibTeX data for On Functional Aggregate Queries with Additive Inequalities | DOI (10.1145/3294052.3319694) | Link to On Functional Aggregate Queries with Additive Inequalities

• [16]

  AC/DC: In−Database Learning Thunderstruck

  Mahmoud Abo Khamis‚ Hung Q. Ngo‚ XuanLong Nguyen‚ Dan Olteanu and Maximilian Schleich

  In Proceedings of the Second Workshop on Data Management for End−To−End Machine Learning. New York‚ NY‚ USA. 2018. Association for Computing Machinery.

  Details about AC/DC: In−Database Learning Thunderstruck | BibTeX data for AC/DC: In−Database Learning Thunderstruck | DOI (10.1145/3209889.3209896) | Link to AC/DC: In−Database Learning Thunderstruck

• [17]

  In−Database Learning with Sparse Tensors

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo‚ XuanLong Nguyen‚ Dan Olteanu and Maximilian Schleich

  In Proceedings of the 37th ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 325–340. New York‚ NY‚ USA. 2018. Association for Computing Machinery.

  Details about In−Database Learning with Sparse Tensors | BibTeX data for In−Database Learning with Sparse Tensors | DOI (10.1145/3196959.3196960) | Link to In−Database Learning with Sparse Tensors

• [18]

  What Do Shannon−type Inequalities‚ Submodular Width‚ and Disjunctive Datalog Have to Do with One Another?

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo and Dan Suciu

  In Proceedings of the 36th ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 429–444. New York‚ NY‚ USA. 2017. Association for Computing Machinery.

  Details about What Do Shannon−type Inequalities‚ Submodular Width‚ and Disjunctive Datalog Have to Do with One Another? | BibTeX data for What Do Shannon−type Inequalities‚ Submodular Width‚ and Disjunctive Datalog Have to Do with One Another? | DOI (10.1145/3034786.3056105) | Link to What Do Shannon−type Inequalities‚ Submodular Width‚ and Disjunctive Datalog Have to Do with One Another?

• [19]

  Computing Join Queries with Functional Dependencies

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo and Dan Suciu

  In Proceedings of the 35th ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 327–342. New York‚ NY‚ USA. 2016. Association for Computing Machinery.

  Details about Computing Join Queries with Functional Dependencies | BibTeX data for Computing Join Queries with Functional Dependencies | DOI (10.1145/2902251.2902289) | Link to Computing Join Queries with Functional Dependencies

• [20]

  FAQ: Questions Asked Frequently

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo and Atri Rudra

  In Proceedings of the 35th ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 13–28. New York‚ NY‚ USA. 2016. Association for Computing Machinery.

  Details about FAQ: Questions Asked Frequently | BibTeX data for FAQ: Questions Asked Frequently | DOI (10.1145/2902251.2902280) | Link to FAQ: Questions Asked Frequently

• [21]

  Joins via Geometric Resolutions: Worst−case and Beyond

  Abo Khamis‚ Mahmoud‚ Hung Q. Ngo‚ Christopher Ré and Atri Rudra

  In Proceedings of the 34th ACM SIGMOD−SIGACT−SIGAI Symposium on Principles of Database Systems. Pages 213–228. New York‚ NY‚ USA. 2015. Association for Computing Machinery.

  Details about Joins via Geometric Resolutions: Worst−case and Beyond | BibTeX data for Joins via Geometric Resolutions: Worst−case and Beyond | DOI (10.1145/2745754.2745776) | Link to Joins via Geometric Resolutions: Worst−case and Beyond

Theses

• [1]

  FAQ: Questions Asked Frequently

  Abo Khamis and Mahmoud

  PhD Thesis State University of New York at Buffalo. 2016.

  Details about FAQ: Questions Asked Frequently | BibTeX data for FAQ: Questions Asked Frequently | Link to FAQ: Questions Asked Frequently