The design and analysis of spatial data structures
The design and analysis of spatial data structures
Parallel database systems: the future of high performance database systems
Communications of the ACM
Improved histograms for selectivity estimation of range predicates
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Parallel Database Techniques
The SDSS skyserver: public access to the sloan digital sky server data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
A taxonomy of Data Grids for distributed data sharing, management, and processing
ACM Computing Surveys (CSUR)
Grid-Based Data Stream Processing in e-Science
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
HiSbase: histogram-based P2P main memory data management
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Community Training: Partitioning Schemes in Good Shape for Federated Data Grids
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Scalable community-driven data sharing in e-science grids
Future Generation Computer Systems
GrayWulf: Scalable Clustered Architecture for Data Intensive Computing
HICSS '09 Proceedings of the 42nd Hawaii International Conference on System Sciences
Workload-aware data partitioning in community-driven data grids
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
| Hi-index | 0.00 |
E-science communities face huge data management challenges due to large existing data sets and expected data rates from forthcoming projects. Community-driven data grids provide a scalable, high-throughput oriented data management solution for scientific federations by employing domain-specific partitioning schemes and parallelism. In this paper, we present how community-driven data grids can adapt their query coordination strategies in the face of different typical submission scenarios. We explore the impact of submitting queries uniformly or having submission hot spots. By an extensive evaluation of five strategies on simulated and distributed setups, we show that some coordination strategies are preferable to others, regardless of submission skew. Based on our results, we can improve the usability and scalability of community-driven data grids for data-intensive applications.