Sciweavers

374 search results - page 19 / 75
» Evaluating path queries over route collections
Sort
View
SEMWEB
2007
Springer
14 years 1 months ago
YARS2: A Federated Repository for Querying Graph Structured Data from the Web
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...
Andreas Harth, Jürgen Umbrich, Aidan Hogan, S...
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 7 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
CN
2007
154views more  CN 2007»
13 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
INFOCOM
1999
IEEE
13 years 11 months ago
Performance Analysis on Path Rerouting Algorithms for Handoff Control in Mobile ATM Networks
This paper studies mobile-generated traffic distributions in mobile ATM networks and evaluates the performance of path rerouting algorithms for handoff control. In mobile ATM netwo...
Jun Li, Roy D. Yates, Dipankar Raychaudhuri
DEBS
2008
ACM
13 years 9 months ago
On static determination of temporal relevance for incremental evaluation of complex event queries
Evaluation of complex event queries over time involves storing information about those events that are relevant for, i.e., might contribute to, future answers. We call the period ...
François Bry, Michael Eckert