Sciweavers

322 search results - page 23 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 10 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
CIKM
2010
Springer
13 years 6 months ago
Adaptive query execution for data management in the cloud
A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those...
Adrian Daniel Popescu, Debabrata Dash, Verena Kant...
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
14 years 3 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
14 years 14 days ago
Predicting and Optimizing Classifier Utility with the Power Law
When data collection is costly and/or takes a significant amount of time, an early prediction of the classifier performance is extremely important for the design of the data minin...
Mark Last
VLDB
2005
ACM
115views Database» more  VLDB 2005»
14 years 2 months ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...