Query shredding: Efficient relational evaluation of queries over nested multisets (extended version)
arXiv:1404.7078 · doi:10.1145/2588555.2612186
Abstract
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 major 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 recent alternative approach on a range of examples.
Extended version of SIGMOD 2014 conference paper
Cited by in corpus (6)
- Language-integrated provenance by trace analysis
- Query Lifting: Language-integrated query for heterogeneous nested collections
- Heuristic and Cost-based Optimization for Diverse Provenance Tasks
- Optimizing Provenance Computations
- Cross-tier web programming for curated databases: A case study
- The Optics of Language-Integrated Query