This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Information Source Tracking Method: Efficiency Issues
December 1995 (vol. 7 no. 6)
pp. 947-954
ASCII Text
x 
 
Fereidoon Sadri, "Information Source Tracking Method: Efficiency Issues," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 6, pp. 947-954, December, 1995.
 
 
BibTex
x
 
@article{ 10.1109/69.476500,
author = {Fereidoon Sadri},
title = {Information Source Tracking Method: Efficiency Issues},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {7},
number = {6},
issn = {1041-4347},
year = {1995},
pages = {947-954},
doi = {http://doi.ieeecomputersociety.org/10.1109/69.476500},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - Information Source Tracking Method: Efficiency Issues
IS - 6
SN - 1041-4347
SP947
EP954
EPD - 947-954
A1 - Fereidoon Sadri,
PY - 1995
KW - Database systems
KW - inaccurate and uncertain data
KW - information source tracking (IST) method
KW - query processing efficiency
KW - reliability of answers.
VL - 7
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 

Abstract—This paper is devoted to the study and analysis of query processing efficiency in the information source tracking (IST) technique, an approach to the representation and manipulation of uncertain and inaccurate data. We show that the efficiency depends on the average number of information sources confirming the same data in the database. If this number is close to unity, then the efficiency of query processing for the IST model is comparable to conventional relational database systems. For the case where multiple information sources confirm the same data in the database, we present a variation of IST, called the Dual IST method, which provides efficient query processing. Extended relational algebra operations are presented for Dual IST, and proven to be correct under the “alternate worlds” semantics interpretation. The complexity of reliability calculation in IST and Dual IST methods is also studied.

[1] D. Barbará, H. Garcia-Molina, and D. Porter, “The Management of Probabilistic Data,” IEEE Trans. Knowledge and Data Eng., vol. 4, pp. 487-501, 1992.
[2] J. Biskup,“Foundations of Codd’s relational maybe operations,” ACM Trans. Database Systems, vol. 8, no. 4, pp. 608-636, 1983.
[3] S. A. Cook,“The Complexity of Theorem-Proving Procedures,”Proc. 3rd Ann. ACM Symposium on Theory of Computing,New York: Association for Computing Machinery, 1971, pp. 151–155.
[4] L.G. Demichiel, “Resolving Database Incompatibility: An Approach to Performing Relational Operations over Mismatched Domains,” IEEE Trans. Knowledge and Data Eng., vol. 4, pp. 485-493, 1989.
[5] D.J. DeWitt, R.H. Katz, F. Olken, L.D. Shapiro, and M.R. Stonebraker, “Implementation Techniques for Main Memory Database Systems,” Proc. ACM SIGMOD, 1984.
[6] B. Doyon,“Reliability of answers to an SQL query,” Dept. of Computer Science, Concordia Univ., May 1990.
[7] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[8] T. Imielinski and W. Lipski Jr.,“Incomplete information in relational databases,” J. ACM, vol. 31, no. 4, pp. 761-791, 1984.
[9] A.M. Keller and M. Winslett-Wilkins,“On the use of an extended relational model to handle changing incompleteinformation.” IEEE Trans. Software Engineering, vol. 11, no. 7, pp. 620-633, July 1985.
[10] S.-K. Lee,“Imprecise and uncertain information in databases: An evidentialapproach.” Proc. IEEE Int’l Conf. Data Engineering, pp. 614-621, 1992.
[11] K.C. Liu and R. Sunderraman,“Indefinite and maybe information in relational databases,” ACM Trans. Database Systems, vol. 15, no. 1, pp. 1-39, 1990.
[12] K.C. Liu and R. Sunderraman,“A generalized relational model for indefinite and maybe information,” IEEE Trans. Knowledge and Data Engineering, vol. 3, no. 1, pp. 65-77, 1991.
[13] D. Maier,The Theory of Relational Databases. Computer Science Press, 1983.
[14] F. Sadri,“Reliability of Answers to Queries in Relational Databases,” IEEE Tran. on Knowledge and Data Engineering, vol. 3, no. 2, June 1991, pp 245-251.
[15] F. Sadri, “Modeling Uncertainty in Databases,” Proc. Seventh IEEE Int'l Conf. Data Eng., pp. 122-131, Apr. 1991.
[16] F. Sadri,“Integrity constraints in the information source tracking method,” IEEE Trans. Knowledge and Data Engineering, vol. 7, no. 1, pp. 106-119, Feb. 1995.
[17] F. Sadri,“Aggregate operations in the IST method,” Theoretical Computer Science, vol. 133, pp. 421-442, 1994.
[18] Readings in Uncertain Reasoning. G. Shafer and J. Pearl, eds., Morgan Kaufmann, 1990.
[19] L. Shapiro, "Join Processing in Database Systems with Large Main Memories," ACM Trans. Database Systems, vol. 11, no. 3, Sept. 1986.
[20] A. Silberschatz,M. Stonebraker, and J. D. Ullman (1991), “, Database Systems: Achievements and Opportunities,” Communications of the ACM, vol. 34, no. 10, pp. 110-120.
[21] L.A. Zadeh,“The role of fuzzy logic in the management of uncertainty in expertsystems,” Fuzzy Sets and Systems, vol. 11, pp. 199-228, 1983.
[22] M. Zemankova,“Implementing imprecision in information systems,” Information Science, vol. 37, pp. 107-141, 1985.

Index Terms:
Database systems, inaccurate and uncertain data, information source tracking (IST) method, query processing efficiency, reliability of answers.
Citation:
Fereidoon Sadri, "Information Source Tracking Method: Efficiency Issues," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 6, pp. 947-954, Dec. 1995, doi:10.1109/69.476500
Usage of this product signifies your acceptance of the Terms of Use.