The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The management of probabilistic data
Abstract
It is often desirable to represent in a database, entities whose properties cannot be deterministically classified. The authors develop a data model that includes probabilities associated with the values of the attributes. The notion of missing probabilities is introduced for partially specified probability distributions. This model offers a richer descriptive language allowing the database to more accurately reflect the uncertain real world. Probabilistic analogs to the basic relational operators are defined and their correctness is studied. A set of operators that have no counterpart in conventional relational systems is presented.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Fusion, propagation, and structuring in belief networks
Pearl, J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90072-x · Cited by 2,127
Zadeh, L. A. (1988) · Computer · doi:10.1109/2.53 · Cited by 1,824
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
An introduction to database systems
Shneiderman, B. (1976) · Information Processing & Management · doi:10.1016/0306-4573(76)90015-7 · Cited by 1,024
Incomplete Information in Relational Databases
Imieliński, T., & Lipski, W. (1984) · Journal of the ACM · doi:10.1145/1634.1886 · Cited by 1,013
Cited by
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
A survey of top- k query processing techniques in relational database systems
Ilyas, I. F., Beskales, G., & Soliman, M. A. (2008) · ACM Computing Surveys · doi:10.1145/1391729.1391730 · Cited by 825
Data Mining and Knowledge Discovery
Cios, K. J., Pedrycz, W., & Swiniarski, R. W. (1998) · Data Mining Methods for Knowledge Discovery · doi:10.1007/978-1-4615-5589-6_1 · Cited by 689
A Survey of Uncertain Data Algorithms and Applications
Aggarwal, C. C., & Yu, P. S. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.190 · Cited by 475
ULDBs: databases with uncertainty and lineage
Benjelloun, O., Sarma, A. D., Halevy, A. Y., & Widom, J. (2006) · doi:10.5555/1182635.1164209 · Cited by 447
A probabilistic relational algebra for the integration of information retrieval and database systems
Fuhr, N., & Rölleke, T. (1997) · ACM Transactions on Information Systems · doi:10.1145/239041.239045 · Cited by 396
Cohen, W. W. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276323 · Cited by 379
Principles of dataspace systems
Halevy, A., Franklin, M., & Maier, D. (2006) · Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1142351.1142352 · Cited by 346
Working Models for Uncertain Data
Sarma, A. D., Benjelloun, O., Halevy, A., & Widom, J. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.174 · Cited by 344
ProbView: a flexible probabilistic database system
Lakshmanan, L. V. S., Leone, N., Ross, R., & Subrahmanian, V. S. (1997) · ACM Transactions on Database Systems · doi:10.1145/261124.261131 · Cited by 338
Multi-source information fusion based on rough set theory: A review
Zhang, P., Li, T., Wang, G., Luo, C., Chen, H., Zhang, J., Wang, D., & Yu, Z. (2021) · Information Fusion · doi:10.1016/j.inffus.2020.11.004 · Cited by 296
Managing and Mining Uncertain Data
(2009) · Advances in Database Systems · doi:10.1007/978-0-387-09690-2 · Cited by 287
Metadata
- Authors
- Barbara, D., Garcia-Molina, H., & Porter, D.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1992
- Volume
- 4
- Issue
- 5
- Pages
- 487-502
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2125791539
- Cited by
- 449
- References
- 18
- FWCI
- 8.15
- Type
- journal article
- 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
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.