Sciweavers

11321 search results - page 2011 / 2265
» Improvements to Turing's method
Sort
View
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
16 years 6 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
PODS
2002
ACM
168views Database» more  PODS 2002»
16 years 6 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 6 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
ICDE
2010
IEEE
283views Database» more  ICDE 2010»
16 years 6 months ago
Personalized Web Search with Location Preferences
As the amount of Web information grows rapidly, search engines must be able to retrieve information according to the user's preference. In this paper, we propose a new web sea...
Kenneth Wai-Ting Leung, Dik Lun Lee, Wang-Chien Le...
PPOPP
2010
ACM
16 years 4 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
« Prev « First page 2011 / 2265 Last » Next »