Loading...
Please wait, while we are loading the content...
Similar Documents
Query shredding: efficient relational evaluation of queries over nested multisets (2014)
| Content Provider | CiteSeerX |
|---|---|
| Author | Cheney, James Lindley, Sam Wadler, Philip |
| Description | Nested relational query languages have been explored extensively, and underlie industrial language-integrated query systems such as Microsoft’s LINQ. However, relational databases do not natively support nested collections in query results. This can lead to ma-jor performance problems: if programmers write queries that yield nested results, then such systems typically either fail or generate a large number of queries. We present a new approach to query shredding, which converts a query returning nested data to a fixed number of SQL queries. Our approach, in contrast to prior work, handles multiset semantics, and generates an idiomatic SQL:1999 query directly from a normal form for nested queries. We provide a detailed description of our translation and present experiments showing that it offers comparable or better performance than a re-cent alternative approach on a range of examples. 1. In SIGMOD |
| File Format | |
| Language | English |
| Publisher | ACM |
| Publisher Date | 2014-01-01 |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
