Re-occurrence of the same problem is very common in many large software products. By matching the symptoms of a new problem to those in a database of known problems, automated dia...
Natwar Modani, Rajeev Gupta, Guy M. Lohman, Tanvee...
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
When hosting XML information on relational backends, a mapping has to be established between the schemas of the information source and the target storage repositories. A rich body ...