Sciweavers

3225 search results - page 473 / 645
» Query Optimization by Stored Queries
Sort
View
ER
2004
Springer
84views Database» more  ER 2004»
15 years 12 months ago
Modeling Functional Data Sources as Relations
In this paper we present a model of functional access to data that, we argue, is suitable for modeling a class of data repositories characterized by functional access, such as web ...
Simone Santini, Amarnath Gupta
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 6 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
16 years 6 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
16 years 7 months ago
Diagnosing Estimation Errors in Page Counts Using Execution Feedback
Errors in estimating page counts can lead to poor choice of access methods and in turn to poor quality plans. Although there is past work in using execution feedback for accurate c...
Surajit Chaudhuri, Vivek R. Narasayya, Ravishankar...
ICML
2009
IEEE
16 years 7 months ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel