Sciweavers

1015 search results - page 55 / 203
» The data locality of work stealing
Sort
View
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
15 years 11 months ago
Privacy-Preserving Top-K Queries
Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the sam...
Jaideep Vaidya, Chris Clifton
MOC
1998
111views more  MOC 1998»
15 years 5 months ago
The approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
David Levin
SIGMETRICS
2000
ACM
15 years 10 months ago
An analytical model of the working-set sizes in decision-support systems
This paper presents an analytical model to study how working sets scale with database size and other applications parameters in decision-support systems (DSS). The model uses appl...
Magnus Karlsson, Per Stenström
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ICDCS
2011
IEEE
14 years 5 months ago
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, Wenjing...