Sciweavers

128 search results - page 8 / 26
» Plan Selection Based on Query Clustering
Sort
View
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 3 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim
WEBI
2005
Springer
15 years 5 months ago
A Semi-Supervised Document Clustering Algorithm Based on EM
Document clustering is a very hard task in Automatic Text Processing since it requires to extract regular patterns from a document collection without a priori knowledge on the cat...
Leonardo Rigutini, Marco Maggini
CIKM
2005
Springer
15 years 5 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
80
Voted
DASFAA
2008
IEEE
118views Database» more  DASFAA 2008»
15 years 6 months ago
RAIN: Always on Data Warehousing
Abstract. The Redundant Arrays of Inexpensive DWS Nodes (RAIN) technique is a node-level data replication approach that introduces failover capabilities to DWS (Data Warehouse Stri...
Jorge Vieira, Marco Vieira, Marco Costa, Henrique ...
CIKM
2005
Springer
15 years 5 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...