The “Search from General to Particular” (SGP) Problem in Document Databases
The amount of information stored in databases doubled at every 20 months. There is important knowledge stored in text databases. The aim of these article was to solve the problem of “searching from general to particular” (SGP) in document databases. As a result of the research we gave the “two level” algorithm and we illustrate this algorithm on an example.