Sciweavers

141 search results - page 1 / 29
» Equivalence of queries combining set and bag-set semantics
Sort
View
PODS
2006
ACM
177views Database» more  PODS 2006»
14 years 5 months ago
Equivalence of queries combining set and bag-set semantics
The query equivalence problem has been studied extensively for set-semantics and, more recently, for bag-set semantics. However, SQL queries often combine set and bag-set semantic...
Sara Cohen
ICDT
2012
ACM
235views Database» more  ICDT 2012»
11 years 7 months ago
Equivalence and minimization of conjunctive queries under combined semantics
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Rada Chirkova
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 5 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan
DBPL
1993
Springer
141views Database» more  DBPL 1993»
13 years 9 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
AMW
2011
12 years 8 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green