Database Paper Browser

Back to papers

Query Shredding: Efficient Relational Evaluation of Queries over Nested Multisets

Summary: Proposes query shredding to evaluate nested queries by rewriting them into a fixed number of SQL queries with multiset semantics. Unlike prior work, it emits a SQL:1999 query directly from a nested-query normal form and shows competitive performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4919
Venue
SIGMOD
Year
2014
Pagerank
7.1565855e-05
Overall Rank
3,380 | 76.52%
DOI
10.1145/2588555.2612186

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
3 Pig Latin: A Not-So-Foreign Language for Data Processing 2008 SIGMOD 0.0024217964
201 LINQ: Reconciling Objects, Relations and XML in the .NET Framework 2006 SIGMOD 0.00034903121
2,333 XQuery on SQL Hosts 2004 VLDB 9.0127497e-05
4,208 FERRY - Database-Supported Program Execution 2009 SIGMOD 6.3511489e-05
5,112 Avalanche-Safe LINQ Compilation 2010 VLDB 5.6831818e-05
7,244 Positive Higher-Order Queries 2010 PODS 4.7856771e-05
Previous Page 1 / 1 Next

Semantically Similar Papers