optimizing the database queries is one of hard research problems. exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. the use of evolutionary methods, beca...

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

OF THE DISSERTATION Approximation and Search Optimization on Massive Data Bases and Data Streams

Probabilistic data bases are receiving an increasing interest as probabilistic expert syst ems are succeeding in managing uncertainty in diagnostic applications. Like relationa l data bases, the management of probabilistic data bases raises a lot of computational problems such as query optimization. We present some strategies and algorithms to s olve the problems of data joining and query answe...

The problem of computer assisted literature search is often misstated as the attempt to nd, in a repository of electronic literature, a paper which, according to title and keywords, contains the desired information. This assumes that the original author was correct and complete in assigning keywords, and that the search criteria are free of preconceived expectations on the context in which the ...