Sciweavers

713 search results - page 128 / 143
» Saving Space by Algebraization
Sort
View
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
15 years 10 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...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
15 years 7 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
IRI
2009
IEEE
15 years 4 months ago
Using 4KB Page Size for Virtual Memory is Obsolete
A 4KB page size has been used for Virtual Memory since the sixties. In fact, today, the most common page size is still 4KB. Choosing a page size is finding the middle ground betwe...
Pinchas Weisberg, Yair Wiseman
CCGRID
2007
IEEE
15 years 4 months ago
Integrated Data Reorganization and Disk Mapping for Reducing Disk Energy Consumption
Increasing power consumption of high-performance systems leads to reliability, survivability, and cooling related problems. Motivated by this observation, several recent efforts f...
Seung Woo Son, Mahmut T. Kandemir
ISCA
2006
IEEE
133views Hardware» more  ISCA 2006»
15 years 3 months ago
TRAP-Array: A Disk Array Architecture Providing Timely Recovery to Any Point-in-time
RAID architectures have been used for more than two decades to recover data upon disk failures. Disk failure is just one of the many causes of damaged data. Data can be damaged by...
Qing Yang, Weijun Xiao, Jin Ren