The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Working Models for Uncertain Data
Abstract
This paper explores an inherent tension in modeling and querying uncertain data: simple, intuitive representations of uncertain data capture many application requirements, but these representations are generally incomplete―standard operations over the data may result in unrepresentable types of uncertainty. Complete models are theoretically attractive, but they can be nonintuitive and more complex than necessary for many applications. To address this tension, we propose a two-layer approach to managing uncertain data: an underlying logical model that is complete, and one or more working models that are easier to understand, visualize, and query, but may lose some information. We explore the space of incomplete working models, place several of them in a strict hierarchy based on expressive power, and study their closure properties. We describe how the two-layer approach is being used in our prototype DBMS for uncertain data, and we identify a number of interesting open problems to fully realize the approach.
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
(1988) · Cited by 16,582
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
The Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
(1995) · Choice Reviews Online · doi:10.5860/choice.33-0359 · Cited by 1,754
Extending the database relational model to capture more meaning
Codd, E. F. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320109 · Cited by 1,559
Incomplete Information in Relational Databases
Imieliński, T., & Lipski, W. (1984) · Journal of the ACM · doi:10.1145/1634.1886 · Cited by 1,013
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
Learning Probabilistic Relational Models
Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_13 · Cited by 933
A fuzzy representation of data for relational databases
Buckles, B. P., & Petry, F. E. (1982) · Fuzzy Sets and Systems · doi:10.1016/0165-0114(82)90052-5 · Cited by 605
Trio: A System for Integrated Management of Data, Accuracy, and Lineage
Widom, J. (2004) · Cited by 474
Self-citationThe management of probabilistic data
Barbara, D., Garcia-Molina, H., & Porter, D. (1992) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.166990 · Cited by 449
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
Tversky, A., & Kahneman, D. (1993) · Readings in Philosophy and Cognitive Science · doi:10.7551/mitpress/5782.003.0006 · Cited by 348
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
Knowledge compilation and theory approximation
Selman, B., & Kautz, H. (1996) · Journal of the ACM · doi:10.1145/226643.226644 · Cited by 295
Edrei, A., Saff, E. B., & Varga, R. S. (1983) · Lecture Notes in Mathematics · doi:10.1007/bfb0070484 · Cited by 276
On the representation and querying of sets of possible worlds
Abiteboul, S., Kanellakis, P., & Grahne, G. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(51)90007-2 · Cited by 250
Learning probabilistic relational models
Schmidt, D. C. (2001) · Springer eBooks · Cited by 209
Learning Probabilistic Relational Models
Getoor, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44914-0_25 · Cited by 152
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
Fuhr, N. (1990) · Cited by 110
Indefinite and maybe information in relational databases
Liu, K., & Sunderraman, R. (1990) · ACM Transactions on Database Systems · doi:10.1145/77643.77644 · Cited by 105
Incomplete object---a data model for design and planning applications
Imieliński, T., Naqvi, S. A., & Vadaparty, K. V. (1991) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/115790.115838 · Cited by 64
Dynamic probabilistic relational models
Sanghai, S. K., Domingos, P., & Weld, D. S. (2003) · Cited by 61
Cited by
Green, T. J., Karvounarakis, G., & Tannen, V. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265535 · Cited by 812
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
Self-citation
Metadata
- Authors
- Sarma, A. D., Benjelloun, O., Halevy, A., & Widom, J.
- Venue
- 22nd International Conference on Data Engineering (ICDE'06)
- Publisher
- IEEE
- Published
- 2006
- Pages
- 7-7
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2129035130
- Cited by
- 344
- References
- 23
- FWCI
- 47.44
- 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
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.