Sciweavers

24 search results - page 5 / 5
» Adaptive join processing in pipelined plans
Sort
View
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
13 years 4 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein

Publication
309views
15 years 4 months ago
SOLE: Scalable On-Line Execution of Continuous Queries on Spatio-temporal Data Streams
This paper presents the Scalable On-Line Execution algorithm (SOLE, for short) for continuous and on-line evaluation of concurrent continuous spatio- temporal queries over data str...
Mohamed F. Mokbel, Walid G. Aref
DPD
1998
141views more  DPD 1998»
13 years 4 months ago
Dynamic Query Operator Scheduling for Wide-Area Remote Access
Distributed databases operating over wide-area networks such as the Internet, must deal with the unpredictable nature of the performance of communication. The response times of acc...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
VLDB
2005
ACM
117views Database» more  VLDB 2005»
13 years 10 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