Joseph M. Hellerstein
Skip Abstract Section
Abstract
A number of researchers have become interested in the design of global-scale networked systems and applications. Our thesis here is that the database community's principles and technologies have an important role to play in the design of these systems. The point of departure is at the roots of database research: we generalize Codd's notion of data independence to physical environments beyond storage systems. We note analogies between the development of database indexes and the new generation of structured peer-to-peer networks. We illustrate the emergence of data independence in networks by surveying a number of recent network facilities and applications, seen through a database lens. We present a sampling of database query processing techniques that can contribute in this arena, and discuss methods for adoption of these technologies.
- W. Adjie-Winoto, E. Schwartz, H. Balakrishnan, and J. Lilley. The design and implementation of an intentional naming system. In Proc. 17th ACM SOSP, Dec. 1999. Google Scholar
Digital Library
- A. Andrzejak and Z. Xu. Scalable, efficient range queries for grid information services. In Proc. Second IEEE International Conference on Peer-to-Peer Computing, Linkoping University, Sweden, Sept. 2002. Google ScholarDigital Library
- R. Avnur and J. M. Hellerstein. Eddies: Continuously adaptive query processing. In Proc. ACM SIGMOD, pages 261--272, May 2000. Google ScholarDigital Library
- H. Balakrishnan, S. Shenker, and M. Walfish. Semantic-free referencing in linked distributed systems. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Feb. 2003.Google ScholarCross Ref
- F. Cacace, S. Ceri, and M. A. W. Houtsma. A survey of parallel execution strategies for transitive closure and logic programs. Distributed and Parallel Databases, 1(4):337--382, 1993. Google ScholarDigital Library
- Y. Chawathe, S. Ratnasamy, L. Breslau, and N. Lanham. Making gnutella-like p2p systems scalable. In Proc. of ACM SIGCOMM, Aug. 2003. Google ScholarDigital Library
- E. F. Codd. A relational model of data for large shared data banks. CACM, 13(6):377--387, 1970. Google ScholarDigital Library
- C. J. Date and P. Hopewell. File definition and logical data independence. In Proc. ACM SIGFIDET, pages 117--138. ACM, 1971.Google ScholarDigital Library
- M. J. Flynn, J. Gray, A. K. Jones, K. Lagally, H. Opderbeck, G. J. Popek, B. Randell, J. H. Saltzer, and H.-R. Wiehle, editors. Operating Systems, An Advanced Course, volume 60 of Lecture Notes in Computer Science. Springer, 1978. Google ScholarDigital Library
- D. K. Gifford, P. Jouvelot, M. Sheldon, and J. O'Toole. Semantic file systems. In Proc. 13th ACM SOSP, Oct. 1991. Google ScholarDigital Library
- K. Gummadi, R. Gummadi, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of dht routing geometry on resilience and proximity. In ACM SIGCOMM, Aug. 2003. Google ScholarDigital Library
- A. Gupta, D. Agrawal, and A. E. Abbadi. Approximate range selection queries in peer-to-peer systems. In Proc. First Biennial Conference on Innovative Data Systems Research (CIDR 2003), Asilomar, CA, Jan. 2003.Google Scholar
- J. M. Hellerstein, W. Hong, S. Madden, and K. Stanek. Beyond average: Toward sophisticated sensing with queries. In Proc. Information Processing in Sensor Networks (IPSN), 2003. Google ScholarDigital Library
- R. Huebsch, J. M. Hellerstein, N. Lanham, B. T. Loo, S. Shenker, and I. Stoica. Querying the internet with PIER. In Proc. 29th International Conference on Very Large Data Bases (VLDB), 2003. Google ScholarDigital Library
- D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), 1997. Google ScholarDigital Library
- J. Li, B. T. Loo, J. M. Hellerstein, M. F. Kaashoek, D. Karger, and R. Morris. On the feasibility of peer-to-peer web indexing and search. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003.Google ScholarCross Ref
- W. Litwin. Trie hashing. In Proc. ACM SIGMOD International Conference on Management of Data, pages 19--29, Ann Arbor, Michigan, Apr. 1981. Google ScholarDigital Library
- S. R. Madden, M. A. Shah, J. M. Hellerstein, and V. Raman. Continuously adaptive continuous queries over streams. In Proc. ACM SIGMOD, 2002. Google ScholarDigital Library
- P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system based on the xor metric. In Proc. of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), Mar. 2002. Google ScholarDigital Library
- B. Oki, M. Pfluegl, A. Siegel, and D. Skeen. The information bus--an architecture for extensible distributed systems. In Proc. 14th ACM SOSP, pages 58--68, Dec. 1993. Google ScholarDigital Library
- C. H. Papadimitriou. Database metatheory: Asking the big queries. In Proc. 14th Symposium on Principles of Database Systems (PODS), pages 1--10, May 1995. Google ScholarDigital Library
- V. Paxson, J. Mahdavi, A. Adams, and M. Mathis. An architecture for large-scale internet measurement. IEEE Communications, 36(8):48--54, Aug. 1998. Google ScholarDigital Library
- C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1997. Google ScholarDigital Library
- V. Raman, A. Deshpande, and J. M. Hellerstein. Using state modules for adaptive query processing. In Proc. IEEE International Conference on Data Engineering (ICDE), 2003.Google Scholar
- S. Ratnasamay, J. M. Hellerstein, and S. Shenker. Range queries in DHTs. Technical Report IRB-TR-03-009, Intel Research, July 2003.Google Scholar
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proc. 2001 ACM SIGCOM Conference, August 2001. Google ScholarDigital Library
- A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218, 2001. Google ScholarDigital Library
- I. Stoica, D. Adkins, S. Zhaung, S. Shenker, and S. Surana. Internet indirection infrastructure. In Proc. ACM SIGCOMM, Aug. 2002. Google ScholarDigital Library
- I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: Scalable Peer-To-Peer lookup service for internet applications. In Proc. 2001 ACM SIGCOMM Conference, pages 149--160, 2001. Google ScholarDigital Library
- R. Wolski, N. Spring, and J. Hayes. The Network Weather Service: A distributed resource performance forecasting service for metacomputing. Journal of Future Generation Computing Systems, 15(5--6):757--768, Oct. 1999. Google ScholarDigital Library
- B. Yang and H. Garcia-Molina. Designing a super-peer network. In Proc. of the 19th International Conference on Data Engineering (ICDE), Mar. 2003.Google Scholar
- B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001. Google ScholarDigital Library
Index Terms
- Toward network data independence
Index terms have been assigned to the content through auto-classification.
Recommendations
Toward logical data independence: a relational query language without relations
SIGMOD '82: Proceedings of the 1982 ACM SIGMOD international conference on Management of dataOne of the main goals of database systems, relational systems in particular, is to provide a degree of physical data independence for users and programs. Users should not need to know the exact physical storage structures to use the database, and should ...
Achieving physical data independence in hypermedia databases
IW-MMDBMS '96: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96)As a large amount of hypermedia data is collected the question of storing these data in hypermedia databases arises. One of the problems encountered is how to separate applications from the data so that the same data can be used by many applications and ...
Toward Overlay Network Symbiosis
P2P '05: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer ComputingSimultaneous overlay networks compete for network resources and disrupt each other. If they cooperate with each other, the collective performance can be improved and they can coexist comfortably. Taking inspiration from biology, in this paper we present ...
Comments