The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
A probabilistic relational algebra for the integration of information retrieval and database systems
Open accessAbstract
We present a probabilistic relational algebra (PRA) which is a generalization of standard relational algebra. In PRA, tuples are assigned probabilistic weights giving the probability that a tuple belongs to a relation. Based on intensional semantics, the tuple weights of the result of a PRA expression always conform to the underlying probabilistic model. We also show for which expressions extensional semantics yields the same results. Furthermore, we discuss complexity issues and indicate possibilities for optimization. With regard to databases, the approach allows for representing imprecise attribute values, whereas for information retrieval, probabilistic document indexing and probabilistic search term weighting can be modeled. We introduce the concept of vague predicates which yield probabilistic weights instead of Boolean values, thus allowing for queries with vague selection conditions. With these features, PRA implements uncertainty and vagueness in combination with the relational model.
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
(1988) · Cited by 16,582
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Query by image and video content: the QBIC system
Flickner, M., Sawhney, H., Niblack, W., Ashley, J., Huang, Q., Dom, B., Gorkani, M., Hafner, J., Lee, D., Petkovic, D., et al. (1995) · Computer · doi:10.1109/2.410146 · Cited by 3,060
Hawkes, J., & Billingsley, P. (1987) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982048 · Cited by 1,631
(1988) · doi:10.1016/b978-0-08-051489-5.50008-4 · Cited by 1,429
Incomplete Information in Relational Databases
Imieliński, T., & Lipski, W. (1984) · Journal of the ACM · doi:10.1145/1634.1886 · Cited by 1,013
Query Optimization in Database Systems
Jarke, M., & Koch, J. (1984) · ACM Computing Surveys · doi:10.1145/356924.356928 · Cited by 650
Towards a Logical Reconstruction of Relational Database Theory
Reiter, R. (1984) · Topics in information systems · doi:10.1007/978-1-4612-5196-5_8 · Cited by 585
On semantic issues connected with incomplete information databases
Lipski, W. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320088 · Cited by 512
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
A non-classical logic for information retrieval
van Rijsbergen, C. J. (1986) · The Computer Journal · doi:10.1093/comjnl/29.6.481 · Cited by 372
A Non-Classical Logic for Information Retrieval
van Rijsbergen, C. J. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5617-6_1 · Cited by 344
Probabilistic Models in Information Retrieval
Fuhr, N. (1992) · The Computer Journal · doi:10.1093/comjnl/35.3.243 · Cited by 315
Self-citationOverview of the Second Text Retrieval Conference (TREC-2)
Harman, D. (1995) · Information Processing & Management · doi:10.1016/0306-4573(94)00047-7 · Cited by 306
VAGUE: a user interface to relational databases that permits vague queries
Motro, A. (1988) · ACM Transactions on Information Systems · doi:10.1145/45945.48027 · Cited by 295
Implementation of the SMART Information Retrieval System
Buckley, C. (1985) · eCommons (Cornell University) · Cited by 289
The Theory of Probabilistic Databases
Cavallo, R. E., & Pittarelli, M. (1987) · Very Large Data Bases · Cited by 273
The use of phrases and structured queries in information retrieval
Croft, W. B., Turtle, H. R., & Lewis, D. D. (1991) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/122860.122864 · Cited by 262
A probabilistic learning approach for document indexing
Fuhr, N., & Buckley, C. (1991) · ACM Transactions on Information Systems · doi:10.1145/125187.125189 · Cited by 202
Self-citationQuery by Image and Video Content
Flickner, M. (1995) · Medical Entomology and Zoology · Cited by 198
Missing information (applicable and inapplicable) in relational databases
Codd, E. F. (1986) · ACM SIGMOD Record · doi:10.1145/16301.16303 · Cited by 174
Implementing imprecision in information systems
Zemankova, M., & Kandel, A. (1985) · Information Sciences · doi:10.1016/0020-0255(85)90008-8 · Cited by 161
Probabilistic Datalog---a logic for powerful retrieval methods
Fuhr, N. (1995) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/215206.215372 · Cited by 147
Self-citationRelevance feedback and inference networks
Haines, D., & Croft, W. B. (1993) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/160688.160689 · Cited by 122
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
Fuhr, N. (1990) · Cited by 110
Self-citationFour valued logic for relational database systems
Gessert, G. H. (1990) · ACM SIGMOD Record · doi:10.1145/382274.382401 · Cited by 47
A more general model for handling missing information in relational databases using a 3-valued logic
Yue, K.-B. (1991) · ACM SIGMOD Record · doi:10.1145/126482.126487 · Cited by 27
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
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
“To do this, Fuhr and R¨ollecke [17] and Zim´anyi [33] tuples are annotated with probabilistic events, and they gave a query answering algo-rithm for computing the events associated with tuples in the query output.”
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
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
Metadata
- Authors
- Fuhr, N., & Rölleke, T.
- Venue
- ACM Transactions on Information Systems
- Published
- 1997-01
- Volume
- 15
- Issue
- 1
- Pages
- 32-66
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W1992609556
- Cited by
- 396
- References
- 28
- FWCI
- 8.88
- 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.