Sciweavers

624 search results - page 47 / 125
» Mutant Query Plans
Sort
View
BNCOD
2011
356views Database» more  BNCOD 2011»
12 years 11 months ago
Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries
Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams - resul...
Abhishek Mukherji, Elke A. Rundensteiner, Matthew ...
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
15 years 16 days ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
VLDB
2005
ACM
117views Database» more  VLDB 2005»
14 years 4 months ago
Parallel Querying with Non-Dedicated Computers
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
Vijayshankar Raman, Wei Han, Inderpal Narang
EDBTW
2004
Springer
14 years 4 months ago
Semantic Query Routing and Processing in P2P Database Systems: The ICS-FORTH SQPeer Middleware
Abstract. Peer-to-peer (P2P) computing is currently attracting enormous attention. In P2P systems a very large number of autonomous computing nodes (the peers) pool together their ...
Giorgos Kokkinidis, Vassilis Christophides
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
14 years 3 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe