Scalable community-driven data sharing in e-science grids

Future Generation Computer Systems

Volumn 25, Issue 3, 2009, Pages 290-300

  Scholl, Tobias ^a   Bauer, Bernhard ^a   Gufler, Benjamin ^a   Kuntschke, Richard ^a   Reiser, Angelika ^a   Kemper, Alfons ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Data sharing (H.3.5); Distributed databases (H.2.4); Scientific databases (H.2.8)

Indexed keywords

DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; FILE ORGANIZATION; MANAGEMENT INFORMATION SYSTEMS;

APPLICATION SPECIFICS; DATA GRIDS; DATA MANAGEMENTS; DATA OBJECTS; DATA SHARING; DATA SHARING (H.3.5); DATA VOLUMES; DATABASE RESEARCHES; DISTRIBUTED DATABASES (H.2.4); DISTRIBUTED NETWORKS; DISTRIBUTED SOURCES; DYNAMIC CORRELATIONS; E SCIENCES; EXPLORATION TASKS; LOAD BALANCING; PARALLEL DATABASES; PEER-TO-PEER NETWORKS; QUAD TREES; RESOURCE SHARING; SCALABILITY ISSUES; SCIENTIFIC DATABASES (H.2.8); SCIENTIFIC DATUMS; SCIENTIFIC RESULTS; SPATIAL DATA STRUCTURES; SPATIAL LOCALITIES;

DATA STRUCTURES;

EID: 55949107606     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2008.05.006     Document Type: Article

References (36)

1. M. Aly, K. Pruhs, P.K. Chrysanthis, KDDCS: A load-balanced in-network data-centric storage scheme for sensor networks, in: Proc. of the ACM Intl. Conf. on Information and Knowledge Management, Arlington, VA, USA, 2006
2. J. Aspnes, J. Kirsch, A. Krishnamurthy, Load balancing and locality in range-queriable data structures, in: Proc. of ACM Symposium on Principles of Distributed Computing, St. John's, Newfoundland, Canada, 2004
3. J. Aspnes, G. Shah, Skip graphs, in: Proc. of the ACM/SIAM Symposium on Descrete Algorithms, Baltimore, MD, USA, 2003
4. F. Banaei-Kashani, C. Shahabi, SWAM: A family of access methods for similarity-search in peer-to-peer data networks, in: Proc. of the ACM Intl. Conf. on Information and Knowledge Management, Washington, DC, USA, 2004
5. Braumandl R., Kemper A., and Kossmann D. Quality of service in an information economy. ACM Transactions on Internet Technology 3 4 (2003) 291-333
6. A. Carlson, H. Böhringer, T. Scholl, W. Voges, Finding galaxy clusters using grid computing technology, in: Proc. of the IEEE Intl. Conf. on e-Science and Grid Computing (demo), Bangalore, India, 2007
7. A. Crainiceanu, P. Linga, A. Machanavajjhala, J. Gehrke, J. Shanmugasundaram, P-Ring: An efficient and robust P2P range index structure, in: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Beijing, China, 2007
8. H. Enke, M. Steinmetz, T. Radke, A. Reiser, T. Röblitz, M. Högqvist, AstroGrid-D: Enhancing astronomic science with grid technology, in: Proc. of the German e-Science Conference, Baden-Baden, Germany, 2007
9. Finkel R.A., and Bentley J.L. Quad trees: A data structure for retrieval on composite keys. Acta Informatica 4 (1974) 1-9
10. Gaede V., and Günther O. Multidimensional access methods. ACM Computing Surveys 30 2 (1998) 170-231
11. P. Ganesan, M. Bawa, H. Garcia-Molina, Online balancing of range-partitioned data with applications to peer-to-peer systems, in: Proc. of the Intl. Conf. on Very Large Data Bases, Toronto, Canada, 2004
12. P. Ganesan, B. Yang, H. Garcia-Molina, One torus to rule them all: Multi-dimensional queries in P2P systems, in: Proc. of the Intl. Workshop on the Web and Databases, Maison de la Chimie, Paris, France, 2004
13. Gargantini I. An effective way to represent quadtrees. Communications of the ACM 25 12 (1982) 905-910
14. J. Gray, M.A.N. Santisteban, A.S. Szalay, The Zones algorithm for finding points-near-point or cross-matching spatial datasets, Tech. Rep. MSR-TR-2006-52, Microsoft Research, Microsoft Cooperation, Redmond, WA, USA, Apr. 2006
15. Gray J., and Szalay A. The world-wide telescope. Communications of the ACM 45 11 (2002) 50-55
16. Hilbert D. Über die stetige Abbildung einer Linie auf ein Flächenstück. Mathematische Annalen 38 (1891) 459-460
17. R. Huebsch, J.M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker, I. Stoica, Querying the internet with PIER, in: Proc. of the Intl. Conf. on Very Large Data Bases, Berlin, Germany, 2003
18. Kossmann D. The state of the art in distributed query processing. ACM Computing Surveys 32 4 (2000) 422-469
19. R. Kuntschke, T. Scholl, S. Huber, A. Kemper, A. Reiser, H.-M. Adorf, G. Lemson, W. Voges, Grid-based data stream processing in e-Science, in: Proc. of the IEEE Intl. Conf. on e-Science and Grid Computing, Amsterdam, The Netherlands, 2006
20. W. O'Mullane, N. Li, M. Nieto-Santisteban, A. Szalay, A. Thakar, J. Gray, Batch is back: CasJobs, serving multi-TB data on the Web, in: Proc. of the Intl. Conf. on Web Services, Orlando, FL, USA, 2005
21. J. Orenstein, T. Merrett, A class of data structures for associative searching, in: Proc. of the ACM SIGACT-SIGMOD Symp. on Principles of Database Sys., Waterloo, Ontario, Canada, 1984
22. Pentaris F., and Ioannidis Y. Query optimization in distributed networks of autonomous database systems. ACM Transactions on Database Systems 31 2 (2006) 537-583
23. T. Pitoura, N. Ntarmos, P. Triantafillou, Replication, load balancing, and efficient range query processing in DHT data networks, in: Proc. of the Intl. Conf. on Extending Database Technology, Munich, Germany, 2006
24. V. Poosala, Y.E. Ioannidis, P.J. Haas, E.J. Shekita, Improved histograms for selectivity estimation of range predicates, in: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Montreal, Quebec, Canada, 1996
25. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: Proc. of the ACM SIGCOMM Intl. Conf. on Data Communication, 2001
26. A.I.T. Rowstron, P. Druschel, Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems., in: Proc. of the IFIP/ACM Intl. Conf. on Distributed Systems Platforms (Middleware), Heidelberg, Germany, 2001
27. Samet H. The Design and Analysis of Spatial Data Structures (1990), Addison Wesley
28. Samet H. Foundations of Multidimensional and Metric Data Structures (2006), Morgan Kaufmann
29. T. Scholl, B. Bauer, B. Gufler, R. Kuntschke, D. Weber, A. Reiser, A. Kemper, HiSbase: Histogram-based p2p main memory data management, in: Proc. of the Intl. Conf. on Very Large Data Bases (demo), Vienna, Austria, 2007
30. T. Scholl, R. Kuntschke, A. Reiser, A. Kemper, Community training: Partitioning schemes in good shape for federated data grids, in: Proc. of the IEEE Intl. Conf. on e-Science and Grid Computing, Bangalore, India, 2007
31. Schücker P., Böhringer H., and Voges W. Detection of X-ray clusters of galaxies by matching RASS photons and SDSS galaxies within GAVO. Astronomy & Astrophysics 420 (2004) 61-74
32. Y. Shu, B.C. Ooi, K.-L. Tan, A. Zhou, Supporting multi-dimensional range queries in peer-to-peer systems, in: Proc. of the IEEE Intl. Conf. on Peer-to-Peer Computing, Konstanz, Germany, 2005
33. I. Stoica, R. Morris, D.R. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, in: Proc. of the ACM SIGCOMM Intl. Conf. on Data Communication, San Diego, CA, USA, 2001
34. Tanin E., Harwood A., and Samet H. Using a distributed quadtree index in peer-to-peer networks. VLDB Journal 16 (2007) 165-178
35. Venugopal S., Buyya R., and Ramamohanarao K. A taxonomy of data grids for distributed data sharing, management, and processing. ACM Computing Surveys 38 1 (2006) 3
36. Zhao B., Huang L., Stribling J., Rhea S., Joseph A., and Kubiatowicz J. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22 1 (2004) 41-53