A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Processing information requests over heterogeneous dataspaces is very challenging because aimed at guaranteeing user satisfaction with respect to conflicting requirements on result quality and response time. In  , it has been argued that, in dynamic contexts preventing substantial user involvement in interpreting requests, information on similar requests recurring over time can be exploited during query processing. In this paper, referring to a graph-based modeling of dataspaces anddblp:conf/edbt/CataniaFG17 fatcat:vacnfgwpn5amxcq6xtaspxymaa