{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:26:11Z","timestamp":1760981171997,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p>An alternative interpretation of queries involves splitting a query into parts that cover different but connected aspects of the information needed.<\/jats:p>","DOI":"10.1145\/1121949.1121982","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T16:09:20Z","timestamp":1147104560000},"page":"52-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Exploring the computing literature with visualization and stepping stones &amp; pathways"],"prefix":"10.1145","volume":"49","author":[{"given":"Edward A.","family":"Fox","sequence":"first","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando Das","family":"Neves","sequence":"additional","affiliation":[{"name":"Snoop Consulting in Buenos Aires, Argentina"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Yu","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rao","family":"Shen","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seonho","family":"Kim","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiguo","family":"Fan","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009132"},{"key":"e_1_2_1_2_1","volume-title":"Improving Retrieval by Chains of Relationships between Documents. (Sept","author":"Das Neves F.","year":"2004","unstructured":"Das Neves , F. Stepping Stones & Pathways : Improving Retrieval by Chains of Relationships between Documents. (Sept . 2004 ), Ph.D. dissertation, Virginia Tech Department of Computer Science ; scholar.lib.vt.edu\/theses\/available\/etd-11012004-003013\/ (demo at fox.cs.vt.edu\/SSP\/).]] Das Neves, F. Stepping Stones & Pathways: Improving Retrieval by Chains of Relationships between Documents. (Sept. 2004), Ph.D. dissertation, Virginia Tech Department of Computer Science; scholar.lib.vt.edu\/theses\/available\/etd-11012004-003013\/ (demo at fox.cs.vt.edu\/SSP\/).]]"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099573"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/604596.604597"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/205323.376383"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30230-8_12"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11495772_68"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/996350.996424"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1353\/pbm.1986.0087"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1067268.1067272"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-5-145"},{"key":"e_1_2_1_12_1","first-page":"4","article-title":"Hard queries can be addressed with query splitting plus stepping stones and pathways","volume":"28","author":"Yu X.","year":"2005","unstructured":"Yu , X. , Das-Neves , F. , and Fox , E.A . Hard queries can be addressed with query splitting plus stepping stones and pathways . Bulletin of the IEEE-CS Technical Committee on Data Engineering 28 , 4 ( Dec. 2005 ), 29--38.]] Yu, X., Das-Neves, F., and Fox, E.A. Hard queries can be addressed with query splitting plus stepping stones and pathways. Bulletin of the IEEE-CS Technical Committee on Data Engineering 28, 4 (Dec. 2005), 29--38.]]","journal-title":"Bulletin of the IEEE-CS Technical Committee on Data Engineering"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1121949.1121982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1121949.1121982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:36Z","timestamp":1750262916000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1121949.1121982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1145\/1121949.1121982"],"URL":"https:\/\/doi.org\/10.1145\/1121949.1121982","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2006,4]]},"assertion":[{"value":"2006-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}