The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Verifying completeness of relational query results in data publishing
Abstract
In data publishing, the owner delegates the role of satisfy-ing user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produce incorrect query results. In this paper, we introduce a scheme for users to verify that their query results are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values originated from the owner). The scheme sup-ports range selection on key and non-key attributes, project as well as join queries on relational databases. Moreover, the proposed scheme complies with access control policies, is computationally secure, and can be implemented efficiently. 1.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
Kerberos: an authentication service for computer networks
Neuman, B. C., & Ts'o, T. (1994) · IEEE Communications Magazine · doi:10.1109/35.312841 · Cited by 1,337
Fedeli, L., & Huebl, A. (2022) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.6464240 · Cited by 1,319
Access control: principle and practice
Sandhu, R. S., & Samarati, P. (1994) · IEEE Communications Magazine · doi:10.1109/35.312842 · Cited by 1,292
Cited by
Dynamic authenticated index structures for outsourced databases
Li, F., Hadjieleftheriou, M., Kollios, G., & Reyzin, L. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142488 · Cited by 415
Smart Meter Data Privacy: A Survey
Asghar, M. R., Dan, G., Miorandi, D., & Chlamtac, I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2720195 · Cited by 307
Metadata
- Authors
- Pang, H., Jain, A., Ramamritham, K., & Tan, K.-L.
- Venue
- Proceedings of the 2005 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2005-06-14
- Pages
- 407-418
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2052388228
- Cited by
- 267
- References
- 21
- FWCI
- 8.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Verifying completeness of relational query results in data publishing. https://app.cochat.ai/papers/10.1145/1066157.1066204
- The paper
- Pang, H., Jain, A., Ramamritham, K., & Tan, K.-L. (2005). Verifying completeness of relational query results in data publishing. Proceedings of the 2005 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/1066157.1066204
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.