We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
Anand Kashyap, Samrat Ganguly, Samir R. Das, Suman...
We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query la...
Abstract. We introduce a query language over sensors, streams and relations and formally describe its semantics. Although the language was specifically designed for sensor network ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...