Database Paper Browser

Back to papers

On the Equivalence of Database Restructurings Involving Object Identifiers

Summary: Equivalence of ILOG programs that create OIDs via Skolem functors, distinguishing exposed (Skolem visible) vs obscured (opaque fresh OIDs). Undecidable with negation or recursion; exposed-equivalence decidable for nrec ILOG; obscured-equivalence decidable for a broad class and one special case, full nrec obscured remains open. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
949
Venue
PODS
Year
1991
Pagerank
5.9614713e-05
Overall Rank
4,729 | 67.14%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
2,396 Containment and Minimization of Positive Conjunctive Queries in OODB's (Extended Abstract) 1992 PODS 8.8892825e-05
2,397 Query Rewriting for Semistructured Data 1999 SIGMOD 8.8888995e-05
8,324 New Data Models and Languages - the Challenge 1992 PODS 4.5392079e-05
8,442 Static Analysis of Graph Database Transformations 2023 PODS 4.5043421e-05
8,567 Semi-determinism (extended abstract) 1992 PODS 4.4893996e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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