We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
Fausto Giunchiglia, Mikalai Yatskevich, Pavel Shva...
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Semantic caching is an important technology for improving the response time of future user queries specified over remote servers. This paper deals with the fundamental query conta...