Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Web caching with consistent hashing
WWW '99 Proceedings of the eighth international conference on World Wide Web
Interpreting Stale Load Information
IEEE Transactions on Parallel and Distributed Systems
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Query-Driven Data Allocation Algorithms for Distributed Database Systems
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
ACM Transactions on Computer Systems (TOCS)
Taming aggressive replication in the Pangaea wide-area file system
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Ivy: a read/write peer-to-peer file system
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Cache-and-query for wide area sensor databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
IrisNet: An Architecture for a Worldwide Sensor Web
IEEE Pervasive Computing
Multilevel circuit clustering for delay minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Wide-area sensing services enable users to query data collected from multitudes of widely distributed sensors. In this paper, we consider the novel distributed database workload characteristics of these services, and present IDP, an online, adaptive data placement and replication system tailored to this workload. Given a hierarchical database, IDP automatically partitions it among a set of networked hosts, and replicates portions of it. IDP makes decisions based on measurements of access locality within the database, read and write load for individual objects within the database, proximity between queriers and potential replicas, and total load on hosts participating in the database. Our evaluation of IDP under real and synthetic workloads, including flash crowds of queriers, demonstrates that in comparison with previously-studied replica placement techniques, IDP reduces average response times for user queries by up to a factor of 3 and reduces network traffic for queries, updates, and data movements by up to an order of magnitude.