Sciweavers

374 search results - page 11 / 75
» Evaluating path queries over route collections
Sort
View
INFOCOM
1997
IEEE
13 years 11 months ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
Ehud Aharoni, Reuven Cohen
EDBT
2004
ACM
133views Database» more  EDBT 2004»
14 years 7 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
XSYM
2007
Springer
150views Database» more  XSYM 2007»
14 years 1 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
SIGMETRICS
2003
ACM
115views Hardware» more  SIGMETRICS 2003»
14 years 18 days ago
Measuring the effects of internet path faults on reactive routing
Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path per...
Nick Feamster, David G. Andersen, Hari Balakrishna...
ADHOCNOW
2008
Springer
14 years 1 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...