[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Reliability of Answers to Queries in Relational Databases

Published: 01 June 1991 Publication History

Abstract

The author studies the problem of determining the reliability of answers to queries in a relational database system, where the information in the database comes from various sources with varying degrees of reliability. An extended relational model is proposed in which each tuple in a relation is associated with an information source vector which identifies the information source(s) that contributed to that tuple. The author shows how relational algebra operations can be extended, and implemented using information source vectors, to calculate the vector corresponding to each tuple in the answer to a query, and hence, to identify information source(s) contributing to each tuple in the answer. This also enables the database system to calculate the reliability of each tuple in the answer to a query as a function of the reliability of information sources.

References

[1]
{1} A.M. Keller and M. Winslett-Wilkins, "On the use of an extended relational model to handle changing incomplete information," IEEE Trans. Software Eng., vol. SE-11, no. 7, pp. 620-633, July 1985.
[2]
{2} M. Winslett, "Updating logical databases with null values," in Proc. 1st Int. Conf. Database Theory, Rome, Sept. 1986.
[3]
{3} T. Imielinski and W. Lipski, "On representing incomplete information in a relational database," in Proc. 7th Int. Conf. Very Large Databases, 1981.
[4]
{4} W. Lipski, "On semantic issues connected with incomplete information databases," ACM Trans. Database Syst., vol. 4, no. 3, pp. 262-296, Sept. 1979.
[5]
{5} Biskup, "A foundation of Codd's relational maybe operations," ACM Trans. Database Syst., vol. 8, no. 4, pp. 608-636, 1983.
[6]
{6} K-C. Liu and R. Sunderraman, "On representing indefinite and maybe information in relational databases," in Proc. IEEE Fourth Int. Conf. Data Eng., pp. 250-257, Feb. 1988.
[7]
{7} C.L. Lu, Introduction to Combinatorial Mathematics. New York: McGraw-Hill, 1968, ch. 4.
[8]
{8} B.C. Desai, P. Goyal, and F. Sadri, "Fact structure and its application to updates in relational databases," Inform. Syst., vol. 12, no. 2, pp. 215-221, 1987.

Cited By

View all
  • (2018)Crowd enabled curation and querying of large and noisy text mined protein interaction dataDistributed and Parallel Databases10.1007/s10619-017-7209-x36:1(9-45)Online publication date: 1-Mar-2018
  • (2016)Hierarchical Crowd Curation of Very Large and Predicted Protein-Protein Interaction DataProceedings of the 20th International Database Engineering & Applications Symposium10.1145/2938503.2938530(316-321)Online publication date: 11-Jul-2016
  • (2011)Cost-efficient repair in inconsistent probabilistic databasesProceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2063826(1731-1736)Online publication date: 24-Oct-2011
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering  Volume 3, Issue 2
June 1991
148 pages

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 June 1991

Author Tags

  1. database system
  2. database theory
  3. extended relational model
  4. information retrieval systems
  5. information source vector
  6. relational algebra operations
  7. relational database system
  8. relational databases
  9. reliability
  10. tuple

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2018)Crowd enabled curation and querying of large and noisy text mined protein interaction dataDistributed and Parallel Databases10.1007/s10619-017-7209-x36:1(9-45)Online publication date: 1-Mar-2018
  • (2016)Hierarchical Crowd Curation of Very Large and Predicted Protein-Protein Interaction DataProceedings of the 20th International Database Engineering & Applications Symposium10.1145/2938503.2938530(316-321)Online publication date: 11-Jul-2016
  • (2011)Cost-efficient repair in inconsistent probabilistic databasesProceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2063826(1731-1736)Online publication date: 24-Oct-2011
  • (2010)Consistent query answers in inconsistent probabilistic databasesProceedings of the 2010 ACM SIGMOD International Conference on Management of data10.1145/1807167.1807202(303-314)Online publication date: 6-Jun-2010
  • (2007)Efficient query evaluation on probabilistic databasesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-006-0004-316:4(523-544)Online publication date: 1-Oct-2007
  • (2001)Integration of Biological Data and Quality-Driven Source NegotiationProceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling10.5555/647524.728339(256-269)Online publication date: 27-Nov-2001
  • (1995)Semantics of extended relational model for managing uncertain informationProceedings of the fourth international conference on Information and knowledge management10.1145/221270.221578(234-240)Online publication date: 2-Dec-1995
  • (1995)Information Source Tracking MethodIEEE Transactions on Knowledge and Data Engineering10.1109/69.4765007:6(947-954)Online publication date: 1-Dec-1995
  • (1995)Integrity Constraints in the Information Source Tracking MethodIEEE Transactions on Knowledge and Data Engineering10.1109/69.3685157:1(106-119)Online publication date: 1-Feb-1995

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media