Ayesha Banu

Learn More
The traditional Web stores huge amount of data in the form of Relational Databases (RDB) as it is good at storing objects and relationships between them. Relational Databases are dynamic in nature which allows bringing tables together helping user to search for related material across multiple tables. RDB are scalable to expand as the data grows. The RDB(More)
Semantic Similarity relates to computing the similarity between concepts of ontology. There exist four approaches to calculate the semantic similarity. The first approach is based on path length. Under this approach we studied and compared some of the measures on a bench mark dataset. Among the compared measures Wu & Palmer measure has the advantage of(More)
Semantic Similarity relates to computing the similarity between different ontological concepts .Various categories of semantic similarity measures have been proposed to determine how similar are they between any two concepts within ontology. Information Content (IC) measure is one such among the category of measures. We analyze different methods of(More)
Knowledge Representation is largely based on ontologies in the Semantic Web. One of the major difficulties to construct ontology such that it meets the requirements of users is the high cost incurred and time consumed in building them. Gathering complete knowledge about the domain of disclosure is time consuming and may not guarantee expected results too.(More)
The execution performances of the Sweeney, Robertson, Tocher (SRT) division algorithm depend on two parameters: the radix and the redundancy factor. In this paper, a study of the effect of these parameters on the division performances is presented. At each iteration, the SRT algorithm performs a multiplication by the quotient digit .This last can be just a(More)
  • 1