Sciweavers

2635 search results - page 379 / 527
» Algorithms for the Database Layout Problem
Sort
View
DOLAP
2005
ACM
15 years 6 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
DOLAP
2005
ACM
15 years 6 months ago
Optimizing the incremental maintenance of multiple join views
Materialized views are nowadays commonly used in the data warehouse environment. Materialized views need to be updated when data sources change. Since the update of the views may ...
Ki Yong Lee, Myoung-Ho Kim
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 4 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
PRL
2002
91views more  PRL 2002»
15 years 4 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen
VLDB
2002
ACM
126views Database» more  VLDB 2002»
15 years 4 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh