Answering conjunctive queries with inequalities
From MaRDI portal
Publication:2402612
DOI10.1007/s00224-016-9684-2zbMath1370.68070arXiv1412.3869OpenAlexW2100859936MaRDI QIDQ2402612
Tova Milo, Paraschos Koutris, Dan Suciu, Sudeepa Roy
Publication date: 20 September 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3869
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Finding and counting given length cycles
- The complexity of querying indefinite data about linearly ordered domains
- Hypertree decompositions and tractable queries
- Analysis and design of algorithms for combinatorial problems. (A selected collection of papers based on the Workshop Analysis and design of algorithms for combinatorial problems, held at CISM, Udine, Italy, September 1982)
- Graph minors. III. Planar tree-width
- Generalized coloring for tree-like graphs
- Conjunctive query containment revisited
- On some coloring problems in grids
- Size Bounds and Query Plans for Relational Joins
- Query evaluation via tree-decompositions
- Constraint solving via fractional edge covers
- On conjunctive queries containing inequalities
- Finding Even Cycles Even Faster
- Color-coding
- Worst-case Optimal Join Algorithms
This page was built for publication: Answering conjunctive queries with inequalities
