Database Paper Browser

Back to papers

Rewriting of Plain SO Tgds into Nested Tgds

Summary: Algorithmic rewriting of plain SO tgds into nested tgds, with a precise characterization of rewritable cases via source predicates and Skolem terms. Produces one or more nested tgds when possible, exceeding prior work by covering a larger subset and offering efficient rewriting despite exponential worst-case complexity. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11844
Venue
VLDB
Year
2019
Pagerank
4.1945683e-05
Overall Rank
11,674 | 18.79%
DOI
10.14778/3342263.3342631

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
2,399 Query Rewriting for Semistructured Data 1999 SIGMOD 8.8973689e-05
4,978 Towards a Theory of Schema-Mapping Optimization 2008 PODS 5.7881299e-05
2,904 Nested Mappings: Schema Mapping Reloaded 2006 VLDB 7.9355829e-05
11,386 Rewriting the Infinite Chase 2022 VLDB 4.1945683e-05
5,249 Value Invention in Data Exchange 2013 SIGMOD 5.6054145e-05
4,752 Normalization and Optimization of Schema Mappings 2009 VLDB 5.9481448e-05
11,762 Stable Model Semantics for Tuple-Generating Dependencies Revisited 2017 PODS 4.1945683e-05
1,742 Composition of Mappings Given by Embedded Dependencies 2005 PODS 0.00010708408
822 Composing Schema Mappings: Second-Order Dependencies to the Rescue 2004 PODS 0.00016255689
9,422 Nested Dependencies: Structure and Reasoning 2014 PODS 4.3441378e-05