837 search results - page 113 / 168 » Hard combinators |
190
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
205
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
162
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
Synchronous transactional logging is the central mechanism for ensuring data persistency and recoverability in database systems. Unfortunately, magnetic disks are ill-suited for t...
187
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
197
Voted
SIGMOD
2007
ACM
16 years 6 hour ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...