Sciweavers

1675 search results - page 23 / 335
» Implementing Data Cubes Efficiently
Sort
View
DAWAK
1999
Springer
14 years 2 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
OOPSLA
2004
Springer
14 years 3 months ago
Efficient data race and deadlock prevention in concurrent object-oriented programs
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
Piotr Nienaltowski
DEBU
2002
161views more  DEBU 2002»
13 years 9 months ago
Indexing and Retrieval of Historical Aggregate Information about Moving Objects
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Jun Zhang, Nikos Mam...
DOLAP
2004
ACM
14 years 3 months ago
Evaluating XML-extended OLAP queries based on a physical algebra
In today’s OLAP systems, integrating fast changing data, e.g., stock quotes, physically into a cube is complex and time-consuming. The widespread use of XML makes it very possib...
Xuepeng Yin, Torben Bach Pedersen
CCGRID
2003
IEEE
14 years 3 months ago
Parallel Multi-Dimensional ROLAP Indexing
This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to imple...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...