Sciweavers

1031 search results - page 161 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
DAWAK
2006
Springer
15 years 4 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
215
Voted
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
16 years 2 months ago
Recursive Computation of Regions and Connectivity in Networks
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
97
Voted
IUI
2006
ACM
15 years 6 months ago
SWISH: semantic analysis of window titles and switching history
Information workers are often involved in multiple tasks and activities that they must perform in parallel or in rapid succession. In consequence, task management itself becomes y...
Nuria Oliver, Greg Smith, Chintan Thakkar, Arun C....
CIKM
2006
Springer
15 years 4 months ago
Constrained subspace skyline computation
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...
Evangelos Dellis, Akrivi Vlachou, Ilya Vladimirski...
100
Voted
PPOPP
2009
ACM
16 years 1 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn