Sciweavers

1669 search results - page 64 / 334
» Efficient Data Distribution for DWS
Sort
View
ICNP
2006
IEEE
14 years 1 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
CLOUDCOM
2010
Springer
13 years 5 months ago
Using Global Behavior Modeling to Improve QoS in Cloud Data Storage Services
Abstract--The cloud computing model aims to make largescale data-intensive computing affordable even for users with limited financial resources, that cannot invest into expensive i...
Jesús Montes, Bogdan Nicolae, Gabriel Anton...
GIS
2002
ACM
13 years 7 months ago
Remote access to large spatial databases
Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of ...
Egemen Tanin, Frantisek Brabec, Hanan Samet
DPD
2006
141views more  DPD 2006»
13 years 7 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...