This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
In the demonstration, we will present the concepts and an implementation of an inductive database ? as proposed by Imielinski and Mannila ? in the relational model. The goal is to...
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...