Conjunctive queries with comparisons

DOI10.1145/3769424MaRDI QIDQ7227222zbMATH OpenFDO

Authors Qichen Wang, Ke Yi

Publication date 9 April 2026

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.1145/3769424

zbMATH Keywords

acyclic joinscomparisonsconjunctive queries

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• An algorithm for handling many relational calculus queries efficiently.
• Answering conjunctive queries with inequalities
• Boolean tensor decomposition for conjunctive queries with negation
• Computational geometry. Algorithms and applications.
• Fractional cascading. II: Applications
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Introduction to algorithms.
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Popular conjectures imply strong lower bounds for dynamic problems
• The complexity of querying indefinite data about linearly ordered domains
• Towards polynomial lower bounds for dynamic problems
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries

This page was built for publication: Conjunctive queries with comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227222)