The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
On semantic issues connected with incomplete information databases
Open accessAbstract
Various approaches to interpreting queries in a database with incomplete information are discussed. A simple model of a database is described, based on attributes which can take values in specified attribute domains. Information incompleteness means that instead of having a single value of an attribute, we have a subset of the attribute domain, which represents our knowledge that the actual value, though unknown, is one of the values in this subset. This extends the idea of Codd's null value, corresponding to the case when this subset is the whole attribute domain. A simple query language to communicate with such a system is described and its various semantics are precisely defined. We emphasize the distinction between two different interpretations of the query language—the external one, which refers the queries directly to the real world modeled in an incomplete way by the system, and the internal one, under which the queries refer to the system's information about this world, rather than to the world itself. Both external and internal interpretations are provided with the corresponding sets of axioms which serve as a basis for equivalent transformations of queries. The technique of equivalent transformations of queries is then extensively exploited for evaluating the interpretation of (i.e. the response to) a query.
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
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
SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
Chamberlin, D. D., Astrahan, M. M., Eswaran, K. P., Griffiths, P. P., Lorie, R. A., Mehl, J. W., Reisner, P., & Wade, B. W. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.206.0560 · Cited by 523
Mathematical Foundations of Computer Science 1977
(1977) · Lecture notes in computer science · doi:10.1007/3-540-08353-7 · Cited by 137
Information systems: On queries involving cardinalities
Lipski, W., & Marek, W. (1979) · Information Systems · doi:10.1016/0306-4379(79)90008-5 · Cited by 5
Self-citation
Cited by
The Discernibility Matrices and Functions in Information Systems
Skowron, A., & Rauszer, C. (1992) · Intelligent Decision Support · doi:10.1007/978-94-015-7975-9_21 · Cited by 1,653
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
Self-citationLogic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 733
Information systems theoretical foundations
Pawlak, Z. (1981) · Information Systems · doi:10.1016/0306-4379(81)90023-5 · Cited by 665
Rules in incomplete information systems
Kryszkiewicz, M. (1999) · Information Sciences · doi:10.1016/s0020-0255(98)10065-8 · Cited by 637
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
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Consistency in a partitioned network: a survey
Davidson, S. B., Garcia-Molina, H., & Skeen, D. (1985) · ACM Computing Surveys · doi:10.1145/5505.5508 · Cited by 550
An Outline of a Theory of Three-Way Decisions
Yao, Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32115-3_1 · Cited by 502
The 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
Interval Neutrosophic Sets and Logic: Theory and Applications in Computing
Wang, H., Smarandache, F., Zhang, Y.-Q., & Sunderraman, R. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0505014 · Cited by 444
Fuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems
Raju, K. V. S. V. N., & Majumdar, A. K. (1988) · ACM Transactions on Database Systems · doi:10.1145/42338.42344 · Cited by 406
Reasoning about naming systems
Bowman, M., Debray, S. K., & Peterson, L. L. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/161468.161471 · Cited by 402
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
Foundations of a functional approach to knowledge representation
Levesque, H. J. (1984) · Artificial Intelligence · doi:10.1016/0004-3702(84)90009-2 · Cited by 352
On Databases with Incomplete Information
Lipski, W. (1981) · Journal of the ACM · doi:10.1145/322234.322239 · Cited by 275
Self-citationDatabase relations with null values
Zaniolo, C. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90080-1 · Cited by 263
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
SQL’s Three-Valued Logic and Certain Answers
Libkin, L. (2016) · ACM Transactions on Database Systems · doi:10.1145/2877206 · Cited by 83
Metadata
- Authors
- Lipski, W.
- Venue
- ACM Transactions on Database Systems
- Published
- 1979-09
- Volume
- 4
- Issue
- 3
- Pages
- 262-296
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2003017562
- Cited by
- 512
- References
- 5
- FWCI
- 14.79
- Type
- journal article
- Language
- en
- Open access
- bronze
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.