Sciweavers

191 search results - page 26 / 39
» Online Aggregation over Trees
Sort
View
152
Voted
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
15 years 9 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
GI
1998
Springer
15 years 1 months ago
An Efficient Strategy for Tiling Multidimensional OLAP Data Cubes
Computing aggregates over selected categories of multidimensional discrete data (MDD) cubes is the core operation of many on-line analytical processing (OLAP) systems. In order to...
Paolo Marques, Paula Furtado, Peter Baumann
DATE
2007
IEEE
102views Hardware» more  DATE 2007»
15 years 4 months ago
Use of statistical timing analysis on real designs
A vast literature has been published on Statistical Static Timing Analysis (SSTA), its motivations, its different implementations and their runtime/accuracy trade-offs. However, v...
A. Nardi, Emre Tuncer, S. Naidu, A. Antonau, S. Gr...
IPPS
2002
IEEE
15 years 2 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
Srinivasan Parthasarathy, Arun Ramakrishnan
JNCA
2008
123views more  JNCA 2008»
14 years 9 months ago
Edge-limited scalable QoS flow set-up
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up with...
James Lembke, Byung Kyu Choi