{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:19Z","timestamp":1750307899723,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>Storage management activities, such as reporting, file placement, migration and archiving, require the ability to discover files that belong to an application workflow by relying only on information from the file server. Some classes of application workflows, such as rendering an animated sequence from its graphics models or building an application from its source files, often exhibit a high degree of repeatability. We describe a system called Autograph that exploits this repeatability to discover files that belong to an application workflow. Our approach examines traces of file accesses, finds repeated and correlated accesses, and infers which files likely belong to the same workflow. Our solution targets server workflows and uses file server traces, which contain less process and file information than the local machine traces used in prior work. We show that Autograph successfully extracts workflow file signatures, even if the workflows are concurrent or share files.<\/jats:p>","DOI":"10.1145\/1496909.1496925","type":"journal-article","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T13:48:36Z","timestamp":1233236916000},"page":"76-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Autograph"],"prefix":"10.1145","volume":"43","author":[{"given":"Anna","family":"Povzner","sequence":"first","affiliation":[{"name":"UC Santa Cruz"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimberly","family":"Keeton","sequence":"additional","affiliation":[{"name":"HP Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arif","family":"Merchant","sequence":"additional","affiliation":[{"name":"HP Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Charles B.","family":"Morrey","sequence":"additional","affiliation":[{"name":"HP Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustafa","family":"Uysal","sequence":"additional","affiliation":[{"name":"HP Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos K.","family":"Aguilera","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,1]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"How much information","author":"Lyman P.","year":"2003","unstructured":"P. Lyman and H. R. Varian , \" How much information .\" 2003 . Retrieved from http:\/\/www.sims.berkeley.edu\/how-much-info-2003 on September 17, 2007. P. Lyman and H. R. Varian, \"How much information.\" 2003. Retrieved from http:\/\/www.sims.berkeley.edu\/how-much-info-2003 on September 17, 2007."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.15"},{"key":"e_1_2_1_3_1","first-page":"59","volume-title":"SIAM Intl. Conf. on Data Mining (SDM)","author":"Fung B. C. M.","year":"2003","unstructured":"B. C. M. Fung , K. Wang , and M. Ester , \" Hierarchical document clustering using frequent itemsets,\" in Proc . SIAM Intl. Conf. on Data Mining (SDM) , ( San Francisco, CA) , pp. 59 -- 70 , May 2003 . B. C. M. Fung, K. Wang, and M. Ester, \"Hierarchical document clustering using frequent itemsets,\" in Proc. SIAM Intl. Conf. on Data Mining (SDM), (San Francisco, CA), pp. 59--70, May 2003."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11605300_6"},{"key":"e_1_2_1_5_1","first-page":"197","volume-title":"USENIX Summer Technical Conference","author":"Griffioen J.","year":"1994","unstructured":"J. Griffioen and R. Appleton , \" Reducing file system latency using a predictive approach,\" in Proc . USENIX Summer Technical Conference , ( Boston, MA) , pp. 197 -- 207 , June 1994 . J. Griffioen and R. Appleton, \"Reducing file system latency using a predictive approach,\" in Proc. USENIX Summer Technical Conference, (Boston, MA), pp. 197--207, June 1994."},{"key":"e_1_2_1_6_1","first-page":"319","volume-title":"USENIX Annual Technical Conference","author":"Kroeger T. M.","year":"1996","unstructured":"T. M. Kroeger and D. D. E. Long , \"Predicting file-system actions from prior events,\" in Proc . USENIX Annual Technical Conference , ( San Diego, CA) , pp. 319 -- 328 , Jan. 1996 . T. M. Kroeger and D. D. E. Long, \"Predicting file-system actions from prior events,\" in Proc. USENIX Annual Technical Conference, (San Diego, CA), pp. 319--328, Jan. 1996."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266706"},{"key":"e_1_2_1_8_1","first-page":"171","volume-title":"USENIX Annual Technical Conference","author":"Shah S.","year":"2007","unstructured":"S. Shah , C. A. N. Soules , G. R. Ganger , and B. D. Noble , \" Using provenance to aid in personal file search,\" in Proc . USENIX Annual Technical Conference , ( Santa Clara, CA) , pp. 171 -- 184 , June 2007 . S. Shah, C. A. N. Soules, G. R. Ganger, and B. D. Noble, \"Using provenance to aid in personal file search,\" in Proc. USENIX Annual Technical Conference, (Santa Clara, CA), pp. 171--184, June 2007."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095822"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_2_1_11_1","first-page":"457","volume-title":"2nd SIAM Intl. Conf. on Data Mining (SDM)","author":"Zaki M.","year":"2002","unstructured":"M. Zaki and C. Hsiao , \" Charm: an efficient algorithm for closed association rule mining,\" in Proc . 2nd SIAM Intl. Conf. on Data Mining (SDM) , ( Arlington, VA) , pp. 457 -- 473 , Apr. 2002 . M. Zaki and C. Hsiao, \"Charm: an efficient algorithm for closed association rule mining,\" in Proc. 2nd SIAM Intl. Conf. on Data Mining (SDM), (Arlington, VA), pp. 457--473, Apr. 2002."},{"key":"e_1_2_1_12_1","volume-title":"Information Retrieval","author":"Van Rijsbergen C. J.","year":"1979","unstructured":"C. J. Van Rijsbergen , Information Retrieval , 2 nd edition. London : Butterworths , 1979 . C. J. Van Rijsbergen, Information Retrieval, 2nd edition. London: Butterworths, 1979.","edition":"2"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312186"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/121132.121166"},{"key":"e_1_2_1_15_1","first-page":"173","volume-title":"Conference on File and Storage Technologies (FAST)","author":"Li Z.","year":"2004","unstructured":"Z. Li , Z. Chen , S. M. Srinivasan , and Y. Zhou , \" C-Miner: Mining block correlations in storage systems,\" in Proc . Conference on File and Storage Technologies (FAST) , ( San Francisco, CA) , pp. 173 -- 186 , Mar. 2004 . Z. Li, Z. Chen, S. M. Srinivasan, and Y. Zhou, \"C-Miner: Mining block correlations in storage systems,\" in Proc. Conference on File and Storage Technologies (FAST), (San Francisco, CA), pp. 173--186, Mar. 2004."},{"key":"e_1_2_1_16_1","first-page":"43","volume-title":"USENIX Annual Technical Conference","author":"Muniswamy-Reddy K.","year":"2006","unstructured":"K. Muniswamy-Reddy , D. A. Holland , U. Braun , and M. Seltzer , \" Provenance-aware storage systems,\" in Proc . USENIX Annual Technical Conference , ( Boston, MA) , pp. 43 -- 56 , June 2006 . K. Muniswamy-Reddy, D. A. Holland, U. Braun, and M. Seltzer, \"Provenance-aware storage systems,\" in Proc. USENIX Annual Technical Conference, (Boston, MA), pp. 43--56, June 2006."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1496909.1496925","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1496909.1496925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:31Z","timestamp":1750258051000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1496909.1496925"}},"subtitle":["automatically extracting workflow file signatures"],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1145\/1496909.1496925"],"URL":"https:\/\/doi.org\/10.1145\/1496909.1496925","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2009,1]]},"assertion":[{"value":"2009-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}