DKE
2006
14 years 1 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
CL
2010
Springer
14 years 1 months ago
2010
Springer
Autonomous mobile programs (AMPs) offer a novel decentralised load management technology where periodic use is made of cost models to decide where to execute in a network. In this...
STOC
1997
ACM
14 years 5 months ago
1997
ACM
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
EDBT
2010
ACM
14 years 6 months ago
2010
ACM
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
ADC
2003
Springer
14 years 6 months ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
ICDE
2007
IEEE
14 years 7 months ago
2007
IEEE
Most database query optimizers use cost models to identify good query execution plans. Inaccuracies in the cost models can cause query optimizers to select poor plans. In this pap...
IAT
2007
IEEE
14 years 7 months ago
2007
IEEE
To share resources in open distributed systems we have developed autonomous mobile programs, which periodically use a cost model to decide where to execute in a network. In additi...
WOSP
2010
ACM
14 years 8 months ago
2010
ACM
We propose a model-based methodology to size and plan enterprise applications under Service Level Agreements (SLAs). Our approach is illustrated using a real-world Enterprise Reso...