{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:14Z","timestamp":1750308134896,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1976,4,1]],"date-time":"1976-04-01T00:00:00Z","timestamp":197164800000},"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":["SIGIR Forum"],"published-print":{"date-parts":[[1976,4]]},"abstract":"<jats:p>Many applications require the combining of two or more linearly ordered lists according to a given set of rules. Probably the best example of this is the combining of index lists in an inverted file information retrieval system according to a Boolean expression specified by the system user. If the user specifies the AND of two terms, the intersection of the two lists associated with the terms if formed; if OR, the union is formed; and if he specifies A AND NOT B the result will be those entries in list A which are not also in list B.<\/jats:p>","DOI":"10.1145\/1095286.1095293","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"16-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["An architecture for the efficient combining of linearly ordered lists"],"prefix":"10.1145","volume":"10","author":[{"given":"Lee A.","family":"Hollaar","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]}],"member":"320","published-online":{"date-parts":[[1976,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800191.805522"},{"key":"e_1_2_1_2_1","volume-title":"Department of Computer Science Report No","author":"Hollaar A","year":"1975","unstructured":"L. A. Hollaar , \" A List Merging Processor for Inverted File Information Retrieval Systems,\" University of Illinois at Urbana-Champaign , Department of Computer Science Report No . 762, Oct. 1975 . L. A. Hollaar, \"A List Merging Processor for Inverted File Information Retrieval Systems,\" University of Illinois at Urbana-Champaign, Department of Computer Science Report No. 762, Oct. 1975."}],"container-title":["ACM SIGIR Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095286.1095293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095286.1095293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:31Z","timestamp":1750262911000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095286.1095293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,4]]},"references-count":2,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1976,4]]}},"alternative-id":["10.1145\/1095286.1095293"],"URL":"https:\/\/doi.org\/10.1145\/1095286.1095293","relation":{},"ISSN":["0163-5840"],"issn-type":[{"type":"print","value":"0163-5840"}],"subject":[],"published":{"date-parts":[[1976,4]]},"assertion":[{"value":"1976-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}