Sciweavers

737 search results - page 69 / 148
» Optimization approach for data allocation in multidisk datab...
Sort
View
VLDB
1995
ACM
132views Database» more  VLDB 1995»
14 years 20 days ago
Coloring Away Communication in Parallel Query Optimization
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
Waqar Hasan, Rajeev Motwani
SIGMOD
2007
ACM
124views Database» more  SIGMOD 2007»
14 years 9 months ago
Query suspend and resume
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
Badrish Chandramouli, Christopher N. Bond, Shivnat...
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
13 years 11 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
DASFAA
2008
IEEE
105views Database» more  DASFAA 2008»
14 years 3 months ago
Redundant Array of Inexpensive Nodes for DWS
The DWS (Data Warehouse Striping) technique is a round-robin data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables ar...
Jorge Vieira, Marco Vieira, Marco Costa, Henrique ...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 1 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...