Sciweavers

95 search results - page 17 / 19
» Well-formed data warehouse structures
Sort
View
DOLAP
2000
ACM
13 years 11 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
SIGKDD
2000
150views more  SIGKDD 2000»
13 years 7 months ago
KDD-Cup 2000 Organizers' Report: Peeling the Onion
We describe KDD-Cup 2000, the yearly competition in data mining. For the first time the Cup included insight problems in addition to prediction problems, thus posing new challenge...
Ron Kohavi, Carla E. Brodley, Brian Frasca, Llew M...
DOLAP
2003
ACM
14 years 20 days ago
Hierarchical dwarfs for the rollup cube
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
Yannis Sismanis, Antonios Deligiannakis, Yannis Ko...
DAWAK
2001
Springer
13 years 12 months ago
Matchmaking for Structured Objects
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
Thomas Eiter, Daniel Veit, Jörg P. Mülle...
HPDC
2010
IEEE
13 years 8 months ago
Distributing the power of OLAP
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...