Sciweavers

2514 search results - page 300 / 503
» On the Computation of Approximations of Database Queries
Sort
View
CHI
2009
ACM
16 years 7 months ago
Predicting query reformulation during web searching
This paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
BTW
2007
Springer
154views Database» more  BTW 2007»
16 years 29 days ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 6 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
IIE
2008
123views more  IIE 2008»
15 years 6 months ago
A Methodological Review of the Program Evaluations in K-12 Computer Science Education
Because of the potential for methodological reviews to improve practice, this article presents the results of a methodological review, and meta-analysis, of kindergarten through 12...
Justus J. Randolph
WWW
2009
ACM
16 years 7 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...