Sciweavers

14078 search results - page 2577 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 4 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
16 years 4 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
SOSP
2003
ACM
16 years 21 days ago
Capriccio: scalable threads for internet services
This paper presents Capriccio, a scalable thread package for use with high-concurrency servers. While recent work has advocated event-based systems, we believe that threadbased sy...
J. Robert von Behren, Jeremy Condit, Feng Zhou, Ge...
133
Voted
EDBT
2010
ACM
237views Database» more  EDBT 2010»
15 years 10 months ago
BronzeGate: real-time transactional data obfuscation for GoldenGate
Data privacy laws have appeared recently, such as the HIPAA laws for protecting medical records, and the PCI guidelines for protecting Credit Card information. Data privacy can be...
Shenoda Guirguis, Alok Pareek
CIKM
2009
Springer
15 years 10 months ago
Analyzing and evaluating query reformulation strategies in web search logs
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
Jeff Huang, Efthimis N. Efthimiadis
« Prev « First page 2577 / 2816 Last » Next »