Sciweavers

374 search results - page 5 / 75
» Evaluating path queries over route collections
Sort
View
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
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...
INFOCOM
2007
IEEE
14 years 1 months ago
VoIP on Wireless Meshes: Models, Algorithms and Evaluation
—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...
SIGMOD
2001
ACM
115views Database» more  SIGMOD 2001»
14 years 7 months ago
Efficient Evaluation of XML Middle-ware Queries
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...
Mary F. Fernandez, Atsuyuki Morishima, Dan Suciu
BNCOD
2008
129views Database» more  BNCOD 2008»
13 years 8 months ago
A Semantics for a Query Language over Sensors, Streams and Relations
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...
CIKM
2008
Springer
13 years 9 months ago
Peer-to-peer similarity search over widely distributed document collections
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...
Christos Doulkeridis, Kjetil Nørvåg, ...