Sciweavers

986 search results - page 59 / 198
» Efficient Processing of the Cube Operator
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 5 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
AMAST
1998
Springer
15 years 8 months ago
Scheduling Algebra
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
Rob J. van Glabbeek, Peter Rittgen
PPOPP
2009
ACM
16 years 4 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
121
Voted
ANCS
2005
ACM
15 years 9 months ago
Framework for supporting multi-service edge packet processing on network processors
Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-servic...
Arun Raghunath, Aaron R. Kunze, Erik J. Johnson, V...
DIGITALCITIES
2003
Springer
15 years 9 months ago
Map-Based Range Query Processing for Geographic Web Search Systems
In order to utilize geographic web information for digital city applications, we have been developing a geographic web search system, KyotoSEARCH. When users retrieve geographic in...
Ryong Lee, H. Shiina, Taro Tezuka, Yusuke Yokota, ...