DBScholar

Back to papers

Computing Cores for Data Exchange: New Algorithms and Practical Solutions

Summary: Hypertree-decomposition-based algorithms for computing cores of relational instances with labeled nulls, plus a fixed-parameter intractability result when parameterized by instance block size. Prove tractability for two broad target-constraint classes—FDs with weakly-acyclic IDs and full TGDs with arbitrary EGDs—and NP-hardness if a NULL(x) system predicate is present. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1348
Venue
PODS
Year
2005
Pagerank
8.4290753e-05
Overall Rank
2,550 | 82.51%
DOI
10.1145/1065167.1065187

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gottlob_pods05,
        address = {New York, NY, USA},
        series = {{PODS} '05},
        title = {{Computing Cores for Data Exchange: New Algorithms and Practical Solutions}},
        url = {https://dl.acm.org/doi/10.1145/1065167.1065187},
        doi = {10.1145/1065167.1065187},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gottlob, Georg},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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