Database Paper Browser

Back to papers

Lossless Regular Views

Summary: Losslessness for semistructured data when both views and queries are regular path queries (RPQs), tackling recursion that breaks prior approaches. Decidability results for materialized and for-all-databases cases via automata-theoretic reduction to CSP, plus complexity bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1269
Venue
PODS
Year
2002
Pagerank
7.003412e-05
Overall Rank
3,531 | 75.44%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
48 Data Integration: A Theoretical Perspective 2002 PODS 0.00069720859
2,034 Views and Queries: Determinacy and Rewriting 2005 PODS 9.7156155e-05
2,370 Query-Based Data Pricing 2012 PODS 8.9488834e-05
4,553 View-Based Query Containment 2003 PODS 6.091702e-05
5,809 Queries Determined by Views: Pack Your Views 2007 PODS 5.3185501e-05
6,652 Information Preserving XML Schema Embedding 2005 VLDB 4.9761854e-05
11,558 On Monotonic Determinacy and Rewritability For Recursive Queries and Views 2020 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

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

Semantically Similar Papers