{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:31:25Z","timestamp":1742387485144},"reference-count":27,"publisher":"Elsevier","isbn-type":[{"value":"9780127224428","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1016\/b978-012722442-8\/50082-3","type":"book-chapter","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T12:42:39Z","timestamp":1188909759000},"page":"874-885","source":"Crossref","is-referenced-by-count":45,"title":["Locating Data Sources in Large Distributed Systems"],"prefix":"10.1016","author":[{"given":"Leonidas","family":"Galanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shawn R.","family":"Jeffery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"DeWitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-012722442-8\/50082-3_bib1","article-title":"Estimating the Selectivity of XML Path Expressions for Internet Scale Applications","author":"Aboulnaga","year":"2001","journal-title":"VLDB"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib2","series-title":"DNS and BIND","author":"Albitz","year":"2001"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib3","doi-asserted-by":"crossref","DOI":"10.1145\/362686.362692","article-title":"Space\/time trade-offs in hash coding with allowable errors","author":"Bloom","year":"1970","journal-title":"Communications of the ACM"},{"issue":"1","key":"10.1016\/B978-012722442-8\/50082-3_bib4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/s007780100043","article-title":"ObjectGlobe: Ubiquitous query processing on the Internet","volume":"10","author":"Braumandl","year":"2001","journal-title":"VLDB Journal"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib5","series-title":"WebDB","article-title":"What are Real DTDs Like","author":"Choi","year":"2002"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib6","article-title":"Routing Indices for Peer-to-Peer Systems","author":"Crespo","year":"2002","journal-title":"ICDCS"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib7","doi-asserted-by":"crossref","DOI":"10.1145\/502034.502054","article-title":"Wide-area cooperative storage with CFS","author":"Dabek","year":"2001","journal-title":"SOSP"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib10","series-title":"Processing Queries in a Large Peer-to-Peer System","author":"Galanis","year":"2003"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib11","unstructured":"J. Gray, P. Helland, P. O'Neil, D. Shasha. The Dangers of Replication and a Solution. Readings In Database Systems, 3rd edition p372."},{"key":"10.1016\/B978-012722442-8\/50082-3_bib12","unstructured":"M. Harren, J. M. Hellerstein, R. Huebsch, B. T. Loo, S. Shenker, I. Stoica. Complex Queries in DHT-based Peer-to-Peer Networks. IPTPS '02."},{"key":"10.1016\/B978-012722442-8\/50082-3_bib13","unstructured":"Y. Ioannidis, V. Poosala. Histogram-Based Solutions to Diverse Database Estimation Problems. Data Engineering Bulletin 18(3)."},{"key":"10.1016\/B978-012722442-8\/50082-3_bib14","series-title":"Queueing Systems, Volume 1: Theory","author":"Kleinrock","year":"1975"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib15","series-title":"Proc. ASPLOS","article-title":"OceanStore: An Architecture for Global-Scale Persistent Storage","author":"Kubiatowicz","year":"2000"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib16","series-title":"SIGMOD Conference","first-page":"327","article-title":"LH*-Linear Hashing for Distributed Files","author":"Litwin","year":"1993"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib18","series-title":"Principles of Distributed Database Systems","author":"\u00d6zsu","year":"1999"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib19","article-title":"Structure and Value Synopses for XML Data Graphs","author":"Polyzotis","year":"2002","journal-title":"VLDB"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib20","article-title":"Distributed Query Processing and Catalogs for Peer-to-Peer Systems","author":"Papadimos","year":"2003","journal-title":"CIDR"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib21","doi-asserted-by":"crossref","unstructured":"S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Schenker. A Scalable Content-Addressable Network. in Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications.","DOI":"10.1145\/383059.383072"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib22","unstructured":"A. Rowstron, P. Druschel, Pastry. Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP\/ACM Intl. Conference on Distributed Systems Platforms."},{"key":"10.1016\/B978-012722442-8\/50082-3_bib23","doi-asserted-by":"crossref","DOI":"10.1145\/502034.502053","article-title":"Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility","author":"Rowstron","year":"2001","journal-title":"SOSP"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib24","unstructured":"S. Saroiu, P. K. Gummadi, S. Gribble. Exploring the Design Space of Distributed and Peer-to-Peer Systems: Comparing the Web, TRIAD, and Chord\/CFS. IPTPS '02"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib25","series-title":"Proc. SIGCOMM","article-title":"Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications","author":"Stoica","year":"2001"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib26","unstructured":"TPC-C Benchmark Standard Specification Revision 5.0."},{"key":"10.1016\/B978-012722442-8\/50082-3_bib28","unstructured":"R. Williams, D. Daniels, L. Haas, G. Lapis, B. Linsey, P. Ng, R. Obermarck, P. Selinger, A. Walker, P. Wilms, R. Yost. R*: An Overview of the Architecture. IBM Research Report RJ3325."},{"key":"10.1016\/B978-012722442-8\/50082-3_bib30","series-title":"Proc. ICDCS","article-title":"Efficient Search in peer-to-peer networks","author":"Yang","year":"2002"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib31","series-title":"Proc. ICDE","article-title":"Designing a Super-Peer Network","author":"Yang","year":"2003"},{"key":"10.1016\/B978-012722442-8\/50082-3_bib32","unstructured":"B. Y. Zhao, J. Kubiatowicz, A. Joseph. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. UCB Tech. Report UCB\/CSD-01-1141."}],"container-title":["Proceedings 2003 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T08:21:45Z","timestamp":1587889305000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780127224428500823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9780127224428"],"references-count":27,"URL":"https:\/\/doi.org\/10.1016\/b978-012722442-8\/50082-3","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}