On the equivalence and rewriting of aggregate queries

Author： Grumbach Stéphane Rafanelli Maurizio Tininini Leonardo

ISSN： 0001-5903

Source： Acta Informatica, Vol.40, Iss.8, 2004-07, pp. : 529-584

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Negative Results for Equivalence Queries

By Angluin D.

Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. : 121-150

Springer Publishing Company

Access to resources Recommend Favorite

Equivalence of queries that are sensitive to multiplicities

By Cohen Sara

The VLDB Journal, Vol. 18, Iss. 3, 2009-06 ,pp. : 765-785

Springer Publishing Company

Access to resources Recommend Favorite

Rewriting Union Queries Using Views

By Wang J. Topor R. Maher M.

Constraints, Vol. 10, Iss. 3, 2005-07 ,pp. : 219-251

Springer Publishing Company

Access to resources Recommend Favorite

Equivalence of Keyed Relational Schemas by Conjunctive Queries

By Albert J. Ioannidis Y. Ramakrishnan R.

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 512-534

Academic Press

Access to resources Recommend Favorite

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

By Fischlin

Theoretical Computer Science, Vol. 268, Iss. 2, 2001-10 ,pp. : 199-219

Elsevier

Access to resources Recommend Favorite