We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property.

Abstract. We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property.

Jun 7, 2010 · We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property. Tree- ...

It is shown that query evaluation is NP-hard and, unless P = NP, these queries do not admit enumeration algorithms with a combined polynomial time delay, ...

We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X-underbar property.

Abstract. We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property. Tree-like.

May 25, 2010 · 1 X-underbar Relations. 2 Enumeration of CQ(X-underbar). 3 Enumeration of ACQ(X-underbar). 4 Enumeration of CQ(X-underbar,6=) 5 Conclusion.

We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...

May 21, 2015 · Gauwin. Efficient Enumeration for Conjunctive Queries over X-underbar Structures. In Conf. on Computer Science Logic (CSL), pages 80--94, 2010.