ACM Home Page
Please provide us with feedback. Feedback
Equivalence of nested queries with mixed semantics
Full text PdfPdf (576 KB)
Source
Symposium on Principles of Database Systems archive
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Providence, Rhode Island, USA
SESSION: Query evaluation and optimization table of contents
Pages 207-216  
Year of Publication: 2009
ISBN:978-1-60558-553-6
Author
David DeHaan  University of Waterloo, Waterloo, ON, Canada
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 56,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1559795.1559828
What is a DOI?

ABSTRACT

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 types. Using an encoding of nested objects as flat relations, we translate the problem to deciding the equivalence between encodings output by relational conjunctive queries. This encoding equivalence cleanly unifies and generalizes previous results for deciding equivalence of conjunctive queries evaluated under various processing semantics. As part of our characterization of encoding equivalence, we define a normal form for encoding queries and contend that this normal form offers new insight into the fundamental principles governing the behaviour of nested aggregation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.
 
2
 
3
 
4
5
6
7
8
9
 
10
 
11
David DeHaan. Equivalence of nested queries with mixed semantics. Technical Report CS-2009-12, D.R. Cheriton School of Computer Science, University of Waterloo, 2009. Available at http://www.cs.uwaterloo.ca/research/tr/2009/.
12
 
13
 
14
15
 
16
17
18
 
19
D.S. Johnson and A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167--189, 1984.
20
21
22
 
23
 
24
25
26
 
27
28
29
30
31
 
32
33
 
34
 
35
 
36
Stan J. Thomas and Patrick C. Fischer. Nested relational structures. In Paris C. Kanellakis, editor, Advances in Computing Research: The Theory of Databases, pages 269--307. JAI Press, 1986.
 
37
 
38
39
 
40
41