The design and analysis of spatial data structures
The design and analysis of spatial data structures
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)
An effective way to represent quadtrees
Communications of the ACM
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Communications of the ACM
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Quality of service in an information economy
ACM Transactions on Internet Technology (TOIT)
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Batch is Back: CasJobs, Serving Multi-TB Data on the Web
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
A taxonomy of Data Grids for distributed data sharing, management, and processing
ACM Computing Surveys (CSUR)
Query optimization in distributed networks of autonomous database systems
ACM Transactions on Database Systems (TODS)
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Grid-Based Data Stream Processing in e-Science
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 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
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
The design and implementation of OGSA-DQP: A service-based distributed query processor
Future Generation Computer Systems
Workload-aware data partitioning in community-driven data grids
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Collaborative query coordination in community-driven data grids
Proceedings of the 18th ACM international symposium on High performance distributed computing
Using economic regulation to prevent resource congestion in large-scale shared infrastructures
Future Generation Computer Systems
Editorial: Special section: Peer-to-peer grid technologies
Future Generation Computer Systems
eSciGrid: A P2P-based e-science Grid for scalable and efficient data sharing
Future Generation Computer Systems
Perspectives on grid computing
Future Generation Computer Systems
Grid-enabled Spatial Data Infrastructure for environmental sciences: Challenges and opportunities
Future Generation Computer Systems
| Hi-index | 0.00 |
E-science projects of various disciplines face a fundamental challenge: thousands of users want to obtain new scientific results by application-specific and dynamic correlation of data from globally distributed sources. Considering the involved enormous and exponentially growing data volumes, centralized data management reaches its limits. Since scientific data are often highly skewed and exploration tasks exhibit a large degree of spatial locality, we propose the locality-aware allocation of data objects onto a distributed network of interoperating databases. HiSbase is an approach to data management in scientific federated Data Grids that addresses the scalability issue by combining established techniques of database research in the field of spatial data structures (quadtrees), histograms, and parallel databases with the scalable resource sharing and load balancing capabilities of decentralized Peer-to-Peer (P2P) networks. The proposed combination constitutes a complementary e-science infrastructure enabling load balancing and increased query throughput.