{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T16:03:54Z","timestamp":1774195434674,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,15]],"date-time":"2009-06-15T00:00:00Z","timestamp":1245024000000},"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":[[2009,6,15]]},"DOI":"10.1145\/1555400.1555455","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T13:34:36Z","timestamp":1245159276000},"page":"331-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["EverLast"],"prefix":"10.1145","author":[{"given":"Avishek","family":"Anand","sequence":"first","affiliation":[{"name":"Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]},{"given":"Srikanta","family":"Bedathur","sequence":"additional","affiliation":[{"name":"Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]},{"given":"Klaus","family":"Berberich","sequence":"additional","affiliation":[{"name":"Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]},{"given":"Ralf","family":"Schenkel","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Christos","family":"Tryfonopoulos","sequence":"additional","affiliation":[{"name":"Max-Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2009,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Internet archive. http:\/\/archive.org.  Internet archive. http:\/\/archive.org."},{"key":"e_1_3_2_1_2_1","unstructured":"Swedish royal library: Kulturarw3 - long-term preservation of electronic documents. http:\/\/www.kb.se\/kw3\/ENG\/.  Swedish royal library: Kulturarw3 - long-term preservation of electronic documents. http:\/\/www.kb.se\/kw3\/ENG\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449715.1449756"},{"key":"e_1_3_2_1_4_1","volume-title":"Universitaet des Saarlandes","author":"Anand Avishek","year":"2009","unstructured":"Avishek Anand . Indexing partitioning techniques for peer-to-peer web archival. Master's thesis , Universitaet des Saarlandes , FR Informatik , 2009 . Avishek Anand. Indexing partitioning techniques for peer-to-peer web archival. Master's thesis, Universitaet des Saarlandes, FR Informatik, 2009."},{"key":"e_1_3_2_1_5_1","unstructured":"M. Arlitt and T. Jin. 1998 World Cup Site Access Logs. http:\/\/www.acm.org\/sigcomm\/ITA\/ 1998.  M. Arlitt and T. Jin. 1998 World Cup Site Access Logs. http:\/\/www.acm.org\/sigcomm\/ITA\/ 1998."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141753.1141771"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367846"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050028"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of CIDR","author":"Bender M.","year":"2007","unstructured":"M. Bender , S. Michel , J. X. Parreira , and T. Crecelius . P2p web search: Make it light, make it y (demo) . In Proc. of CIDR , 2007 . M. Bender, S. Michel, J. X. Parreira, and T. Crecelius. P2p web search: Make it light, make it y (demo). In Proc. of CIDR, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277831"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of VLDB","author":"Berberich K.","year":"2007","unstructured":"K. Berberich , S. Bedathur , T. Neumann , and G. Weikum . FluxCapacitor: Efficient Time-Travel Text Search . In Proc. of VLDB , 2007 . K. Berberich, S. Bedathur, T. Neumann, and G. Weikum. FluxCapacitor: Efficient Time-Travel Text Search. In Proc. of VLDB, 2007."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of GI-Fachtagung fur Datenbanksysteme in Business, Technologie und Web (BTW)","author":"Berberich K.","year":"2007","unstructured":"K. Berberich , S. Bedathur , and G. Weikum . Efficient Time-travel on Versioned Text Collections . In Proc. of GI-Fachtagung fur Datenbanksysteme in Business, Technologie und Web (BTW) , 2007 . K. Berberich, S. Bedathur, and G. Weikum. Efficient Time-travel on Versioned Text Collections. In Proc. of GI-Fachtagung fur Datenbanksysteme in Business, Technologie und Web (BTW), 2007."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of Workshop EIIR","author":"Berberich K.","year":"2008","unstructured":"K. Berberich , S. Bedathur , and G. Weikum . Tunable Word--Level Index Compression for Versioned Corpora . In Proc. of Workshop EIIR , 2008 . K. Berberich, S. Bedathur, and G. Weikum. Tunable Word--Level Index Compression for Versioned Corpora. In Proc. of Workshop EIIR, 2008."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of ACM\/USENIX NSDI","author":"Bhagwan R.","year":"2004","unstructured":"R. Bhagwan , K. Tati , Y. Cheng , S. Savage , and G. M. Voelker . Totalrecall: System support for automated availability management . In Proc. of ACM\/USENIX NSDI , 2004 . R. Bhagwan, K. Tati, Y. Cheng, S. Savage, and G. M. Voelker. Totalrecall: System support for automated availability management. In Proc. of ACM\/USENIX NSDI, 2004."},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of ACM\/USENIX NSDI","author":"Chun B.-G.","year":"2006","unstructured":"B.-G. Chun , F. Dabek , A. Haeberlen , E. Sit , H. Weatherspoon , M. F. Kaashoek , J. Kubiatowicz , and R. Morris . Efficient Replica Maintenance for Distributed Storage Systems . In Proc. of ACM\/USENIX NSDI , 2006 . B.-G. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, M. F. Kaashoek, J. Kubiatowicz, and R. Morris. Efficient Replica Maintenance for Distributed Storage Systems. In Proc. of ACM\/USENIX NSDI, 2006."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/249978.249980"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2007.108"},{"key":"e_1_3_2_1_18_1","unstructured":"Heritrix Archival Crawler. http:\/\/crawler.archive.org\/.  Heritrix Archival Crawler. http:\/\/crawler.archive.org\/."},{"key":"e_1_3_2_1_19_1","volume-title":"Characterizations of User Web Revisit Behavior. In Proc. of Workshop on Adaptivity and User Modeling in Interactive Systems","author":"Herder E.","year":"2005","unstructured":"E. Herder . Characterizations of User Web Revisit Behavior. In Proc. of Workshop on Adaptivity and User Modeling in Interactive Systems , 2005 . E. Herder. Characterizations of User Web Revisit Behavior. In Proc. of Workshop on Adaptivity and User Modeling in Interactive Systems, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2004.09.003"},{"key":"e_1_3_2_1_21_1","volume-title":"USENIX Annual Technical Conference","author":"Kotla R.","year":"2007","unstructured":"R. Kotla , M. Dahlin , and L. Alvisi . Safestore: A durable and practical storage system . In USENIX Annual Technical Conference , June 2007 . R. Kotla, M. Dahlin, and L. Alvisi. Safestore: A durable and practical storage system. In USENIX Annual Technical Conference, June 2007."},{"key":"e_1_3_2_1_22_1","author":"Lomet D.","year":"2008","unstructured":"D. Lomet , M. Hong , R. Nehme , and R. Zhang . Transaction Time Indexing with Version Compression. In Proc. of VLDB , 2008 . D. Lomet, M. Hong, R. Nehme, and R. Zhang. Transaction Time Indexing with Version Compression. In Proc. of VLDB, 2008.","journal-title":"Transaction Time Indexing with Version Compression. In Proc. of VLDB"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66956"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988674"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0057-y"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368968"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502053"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/319806.319816"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of ICDE","author":"Shkapenyuk V.","year":"2001","unstructured":"V. Shkapenyuk and T. Suel . Design and implementation of a high-performance distributed web crawler . In Proc. of ICDE , 2001 . V. Shkapenyuk and T. Suel. Design and implementation of a high-performance distributed web crawler. In Proc. of ICDE, 2001."},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. of ACM SIGIR","author":"Singh A.","year":"2003","unstructured":"A. Singh , M. Srivatsa , L. Liu , and T. Miller . Apoidea: A decentralized peer-to-peer architecture for crawling the world wide web . In Proc. of ACM SIGIR , 2003 . A. Singh, M. Srivatsa, L. Liu, and T. Miller. Apoidea: A decentralized peer-to-peer architecture for crawling the world wide web. In Proc. of ACM SIGIR, 2003."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378889.1378910"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2007.79"},{"key":"e_1_3_2_1_36_1","volume-title":"March","author":"World Wide Web The Size","year":"2008","unstructured":"The Size of the World Wide Web . http:\/\/www.worldwidewebsize.com\/ , March 2008 . The Size of the World Wide Web. http:\/\/www.worldwidewebsize.com\/, March 2008."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802514.1802540"}],"event":{"name":"JCDL '09: Joint Conference on Digital Libraries","location":"Austin TX USA","acronym":"JCDL '09","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 9th ACM\/IEEE-CS joint conference on Digital libraries"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555400.1555455","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1555400.1555455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:30Z","timestamp":1750253370000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555400.1555455"}},"subtitle":["a distributed architecture for preserving the web"],"short-title":[],"issued":{"date-parts":[[2009,6,15]]},"references-count":36,"alternative-id":["10.1145\/1555400.1555455","10.1145\/1555400"],"URL":"https:\/\/doi.org\/10.1145\/1555400.1555455","relation":{},"subject":[],"published":{"date-parts":[[2009,6,15]]},"assertion":[{"value":"2009-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}