{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:30:08Z","timestamp":1764873008217,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/icde.2008.4497512","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T19:04:39Z","timestamp":1209495879000},"page":"1033-1042","source":"Crossref","is-referenced-by-count":10,"title":["Greedy List Intersection"],"prefix":"10.1109","author":[{"given":"Robert","family":"Krauthgamer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijayshankar","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atri","family":"Rudra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007642"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1110-5"},{"key":"14","article-title":"the pipelined set cover problem","author":"munagala","year":"2005","journal-title":"10th International Conference on Database Theory (ICDT)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/564724.564727"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1147\/sj.452.0299"},{"key":"3","article-title":"c-store: a column-oriented dbms","author":"stonebraker","year":"2005","journal-title":"VLDB"},{"key":"2","article-title":"consistent selectivity estimation using maximum entropy","volume":"16","author":"markl","year":"2007","journal-title":"The VLDB Journal"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007641"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247566"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022162"},{"key":"6","article-title":"experiments on adaptive set intersections for rext retrieval systems","author":"demuiue","year":"2001","journal-title":"3rd International Workshop on Algorithm Engineering and Experimentation (ALENEX)"},{"key":"5","article-title":"adaptive set intersections, unions, and differences","author":"demuiue","year":"2000","journal-title":"11th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"year":"0","key":"4"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1007\/11764298_13","article-title":"faster adaptive set intersections for text searching","author":"barbay","year":"2006","journal-title":"Intl Workshop on Experimental Algorithms"},{"key":"8","article-title":"adaptive intersection and t-threshold problems","author":"barbay","year":"2002","journal-title":"SODA"}],"event":{"name":"2008 IEEE 24th International Conference on Data Engineering (ICDE 2008)","start":{"date-parts":[[2008,4,7]]},"location":"Cancun, Mexico","end":{"date-parts":[[2008,4,12]]}},"container-title":["2008 IEEE 24th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4492792\/4497384\/04497512.pdf?arnumber=4497512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T07:36:01Z","timestamp":1497771361000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4497512\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icde.2008.4497512","relation":{},"subject":[],"published":{"date-parts":[[2008,4]]}}}