Call for Paper - August 2020 Edition
IJCA solicits original research papers for the August 2020 Edition. Last date of manuscript submission is July 20, 2020. Read More

A Method of Computing with Words to Answer Queries in Relational Database

Print
PDF
International Journal of Computer Applications
© 2010 by IJCA Journal
Number 11 - Article 3
Year of Publication: 2010
Authors:
Smita Rajpal
10.5120/1628-2189

Smita Rajpal. Article:A Method of Computing with Words to Answer Queries in Relational Database. International Journal of Computer Applications 11(11):13–17, December 2010. Published By Foundation of Computer Science. BibTeX

@article{key:article,
	author = {Smita Rajpal},
	title = {Article:A Method of Computing with Words to Answer Queries in Relational Database},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {11},
	number = {11},
	pages = {13--17},
	month = {December},
	note = {Published By Foundation of Computer Science}
}

Abstract

In this paper we are proposing a new method of intelligent search based on the concept of computing with words introduced by Prof. Zadeh[1] in 1996 to find the most suitable match for the predicates to answer any imprecise query made by the database users. The method is based on the theory of Computing with Words (CW). It is also to be mentioned that the proposed method could be easily incorporated in the existing commercial query languages of DBMS to serve the lay users better. So in this Paper Author is suggesting a new method called as α-CW-equality Search to answer the queries of Relational database based on ranks.

Reference

  • .A. Zadeh, from computing with numbers to computing with words. From manipulation of measurements to manipulation of perceptions. IEEE Trans. Circuits and Systems 45 (1): 105-119, 1999
  • D. Barbara, H. Garcia-Molina and D. Porter (1992). ”The management of probabilistic data”. IEEE Trans. Knwl. Data Eng. 4,(5), 487-502.
  • V. Biazzo and A. Gilio (1999), ”A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments”. International Journal of Approximate Reasoning .
  • Biazzo V., Gilio A., and Sanfilippo G., Efficient Coherence Checking and Propagation of Imprecise Probability Assessments (working paper), 1999.
  • R. Cavallo and M. Pittarelli (1987). ”The theory of probabilistic database”. In Proceedings of the 13th VLBDB Conference. brighton, Eng., 71-78.
  • D. Dey and S. Sarkar (1996). ”A probabilistic relational model”. ACM Trans. Database Systems,21, (3), 394-405.
  • C. R´e, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In Proceedings of ICDE, 2007.
  • C. R´e and D. Suciu. Efficient evaluation of having queries on a probabilistic database. Technical Report TR2007-06-01, University of Washington, Seattle, Washington, June 2007
  • Smita Rajpal, M.N.Doja and Ranjit Biswas, A Method of Neutrosophic Logic to Answer Queries in Relational Database, JCS, Vol.4(4): 309-314 ,USA, 2008.
  • Smita Rajpal, M.N.Doja and Ranjit Biswas, A Method of Imprecise Query Solving, IJCSNS, Vol. 8 No. 6 pp. 133-139,South Korea,June2008.