Performance Trees are a unifying framework for the specification of performance queries involving measures and requirements. This paper describes an evaluation environment for Pe...
Darren K. Brien, Nicholas J. Dingle, William J. Kn...
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
This paper is mainly concerned with the extension of database management systems querying capabilities, so that users may address queries involving preferences and get discriminate...
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, ther...