Sciweavers

7 search results - page 1 / 2
» Declustering Large Multidimensional Data Sets for Range Quer...
Sort
View
SSDBM
2003
IEEE
98views Database» more  SSDBM 2003»
13 years 9 months ago
Declustering Large Multidimensional Data Sets for Range Queries over Heterogeneous Disks
Jonghyun Lee, Marianne Winslett, Xiaosong Ma, Shen...
DPD
2006
141views more  DPD 2006»
13 years 4 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
EDBT
2004
ACM
131views Database» more  EDBT 2004»
14 years 4 months ago
Declustering Two-Dimensional Datasets over MEMS-Based Storage
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
Hailing Yu, Divyakant Agrawal, Amr El Abbadi
ICDT
2005
ACM
124views Database» more  ICDT 2005»
13 years 9 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
IDEAS
1999
IEEE
123views Database» more  IDEAS 1999»
13 years 8 months ago
Improving OLAP Performance by Multidimensional Hierarchical Clustering
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
Volker Markl, Frank Ramsak, Rudolf Bayer