Sciweavers

91 search results - page 13 / 19
» Scalable computation of acyclic joins
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 1 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
ICA3PP
2010
Springer
14 years 12 days ago
Strategy-Proof Dynamic Resource Pricing of Multiple Resource Types on Federated Clouds
Abstract. There is growing interest in large-scale resource sharing with emerging architectures such as cloud computing, where globally distributed and commoditized resources can b...
Marian Mihailescu, Yong Meng Teo
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 2 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
IEEESCC
2005
IEEE
14 years 1 months ago
Efficient Information Service Management Using Service Club in CROWN Grid
The main goal of our key project, CROWN Grid, is to empower in-depth integration of resources and cooperation of researchers nationwide and worldwide. In CROWN, Information Servic...
Chunming Hu, Jinpeng Huai, Yanmin Zhu, Yunhao Liu,...