Sciweavers

1390 search results - page 30 / 278
» Self-Sizing of Clustered Databases
Sort
View
VLDB
1995
ACM
66views Database» more  VLDB 1995»
14 years 17 days ago
A Performance Evaluation of OID Mapping Techniques
In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct ma...
André Eickler, Carsten Andreas Gerlhof, Don...
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 10 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
SADM
2008
165views more  SADM 2008»
13 years 8 months ago
Global Correlation Clustering Based on the Hough Transform
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
Elke Achtert, Christian Böhm, Jörn David...
DEXA
2006
Springer
121views Database» more  DEXA 2006»
14 years 21 days ago
DCF: An Efficient Data Stream Clustering Framework for Streaming Applications
Streaming applications, such as environment monitoring and vehicle location tracking require handling high volumes of continuously arriving data and sudden fluctuations in these vo...
Kyungmin Cho, SungJae Jo, Hyukjae Jang, Su Myeon K...
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 8 months ago
FAS - A Freshness-Sensitive Coordination Middleware for a Cluster of OLAP Components
Data warehouses offer a compromise between freshness of data and query evaluation times. However, a fixed preference ratio between these two variables is too undifferentiated. Wit...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...