{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:43Z","timestamp":1759205323097,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1376616.1376646","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"265-278","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Paths to stardom"],"prefix":"10.1145","author":[{"given":"Mihai","family":"Lupu","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Y. C.","family":"Tay","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646747.701489"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2005.38"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676983"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007627"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00095-4"},{"key":"e_1_3_2_1_6_1","volume-title":"Node Bisectors of Cayley Graphs. Theory of Computing Systems, 29(6)","author":"Blackburn S. R.","year":"1996","unstructured":"S. R. Blackburn . Node Bisectors of Cayley Graphs. Theory of Computing Systems, 29(6) , 1996 .]] S. R. Blackburn. Node Bisectors of Cayley Graphs. Theory of Computing Systems, 29(6), 1996.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247537"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247507"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_3"},{"key":"e_1_3_2_1_10_1","volume-title":"Connectivity of Minimal Cayley Graphs. Archiv der Mathematik, 37(1)","author":"Godsil C. D.","year":"1981","unstructured":"C. D. Godsil . Connectivity of Minimal Cayley Graphs. Archiv der Mathematik, 37(1) , 1981 .]] C. D. Godsil. Connectivity of Minimal Cayley Graphs. Archiv der Mathematik, 37(1), 1981.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of USITS","author":"Harvey N. J. A.","year":"2003","unstructured":"N. J. A. Harvey , M. B. Jones , S. Saroiu , M. Theimer , and A. Wolman . SkipNet: A Scalable Overlay Network with Practical Locality Properties . In Proc. of USITS , 2003 .]] N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In Proc. of USITS, 2003.]]"},{"key":"e_1_3_2_1_13_1","volume-title":"E77-A(4)","author":"Hsu D. F.","year":"1994","unstructured":"D. F. Hsu . On Container Width and Length in Graphs, Groups and Networks. IEICE TFECCS , E77-A(4) , 1994 .]] D. F. Hsu. On Container Width and Length in Graphs, Groups and Networks. IEICE TFECCS, E77-A(4), 1994.]]"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of CIDR","author":"Huebsch R.","year":"2005","unstructured":"R. Huebsch , B. Chun , J. M. Hellerstein , B. T. Loo , P. Maniatis , T. Roscoe , S. Shenker , I. Stoica , and A. R. Yumerefendi . The Architecture of PIER: an Internet-Scale Query Processor . In Proc. of CIDR , 2005 .]] R. Huebsch, B. Chun, J. M. Hellerstein, B. T. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. R. Yumerefendi. The Architecture of PIER: an Internet-Scale Query Processor. In Proc. of CIDR, 2005.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of VLDB","author":"Jagadish H. V.","year":"2005","unstructured":"H. V. Jagadish , B. C. Ooi , and Q. H. Vu . BATON: A Balanced Tree Structure for P2P Networks . In Proc. of VLDB , 2005 .]] H. V. Jagadish, B. C. Ooi, and Q. H. Vu. BATON: A Balanced Tree Structure for P2P Networks. In Proc. of VLDB, 2005.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142475"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. of SOSDI","author":"Jannotti J.","year":"2000","unstructured":"J. Jannotti , D. K. Gifford , K. L. Johnson , M. F. Kaashoek , and J. W. O'Toole , Jr. Overcast : Reliable Multicasting with an Overlay Network . In Proc. of SOSDI , 2000 .]] J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole, Jr. Overcast: Reliable Multicasting with an Overlay Network. In Proc. of SOSDI, 2000.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of SPDP","author":"Jwo J.-S.","year":"1990","unstructured":"J.-S. Jwo , S. Lakshmivarahan , and S.K. Dhall . Embedding of Cycles and Grids in Star Graphs . In Proc. of SPDP , 1990 .]] J.-S. Jwo, S. Lakshmivarahan, and S.K. Dhall. Embedding of Cycles and Grids in Star Graphs. In Proc. of SPDP, 1990.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872798"},{"key":"e_1_3_2_1_20_1","volume-title":"Trees, Hypercubes","author":"Leighton F. T.","year":"1992","unstructured":"F. T. Leighton . Introduction to Parallel Algorithms and Architectures : Arrays , Trees, Hypercubes . Morgan Kaufmann Publishers , 1992 .]] F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.]]"},{"key":"e_1_3_2_1_21_1","volume-title":"Cost Framework for Evaluating DHT Design Tradeoff Under Churn. In Proc. of INFOCOM","author":"Li J.","year":"2005","unstructured":"J. Li , J. Stribling , R. Morris , M.F. Kaashoek , and T.M. Gil . A Performance vs . Cost Framework for Evaluating DHT Design Tradeoff Under Churn. In Proc. of INFOCOM , 2005 .]] J. Li, J. Stribling, R. Morris, M.F. Kaashoek, and T.M. Gil. A Performance vs. Cost Framework for Evaluating DHT Design Tradeoff Under Churn. In Proc. of INFOCOM, 2005.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066195"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142485"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1610546"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"e_1_3_2_1_26_1","unstructured":"I. Pak and R. Radoicic. Hamiltonian paths in Cayley Graphs. Preprint http:\/\/www-math.mit.edu\/~pak\/hamcayley8.pdf.]]  I. Pak and R. Radoicic. Hamiltonian paths in Cayley Graphs. Preprint http:\/\/www-math.mit.edu\/~pak\/hamcayley8.pdf.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/945721.945737"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30566-8_105"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_31_1","series-title":"LNCS","volume-title":"HyperCup - Hypercubes, Ontologies, and Efficient Search in Peer-to-Peer Networks","author":"Schlosser M.","year":"2003","unstructured":"M. Schlosser , M. Sintek , S. Decker , and W. Nejdl . HyperCup - Hypercubes, Ontologies, and Efficient Search in Peer-to-Peer Networks , volume 2530 of LNCS . Springer Berlin \/ Heidelberg , 2003 .]] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. HyperCup - Hypercubes, Ontologies, and Efficient Search in Peer-to-Peer Networks, volume 2530 of LNCS. Springer Berlin \/ Heidelberg, 2003.]]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.01.004"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08"},"container-title":["Proceedings of the 2008 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376646","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376616.1376646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:19Z","timestamp":1750258039000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376646"}},"subtitle":["calibrating the potential of a peer-based data management system"],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":32,"alternative-id":["10.1145\/1376616.1376646","10.1145\/1376616"],"URL":"https:\/\/doi.org\/10.1145\/1376616.1376646","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}