Sciweavers

157 search results - page 16 / 32
» Constrained Optimalities in Query Personalization
Sort
View
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 7 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
DLS
2010
204views Languages» more  DLS 2010»
13 years 5 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 8 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 22 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang