ā We compare the performance of various dynamic query abolishment mechanisms in different unstructured overlay network topologies such as found in several P2P systems. We speciļ¬...
Most people have long term information interests. Current Web search engines satisfy immediate information needs. Speciļ¬c sites support tracking of long term interests. We prese...
This paper uses a knowledge-based approach to querying heterogeneous spatial databases based on an ontology and conceptual and attribute similarities. The ontology, which may be in...
We study extensions of ļ¬rst-order logic over the reals with diļ¬erent types of transitive-closure operators as query languages for constraint databases that can be described by...
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...