{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:15:53Z","timestamp":1740132953644,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,2,1]]},"DOI":"10.1109\/tkde.2016.2620140","type":"journal-article","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T14:50:04Z","timestamp":1477061404000},"page":"418-432","source":"Crossref","is-referenced-by-count":2,"title":["Query Reorganization Algorithms for Efficient Boolean Information Filtering"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3679-7560","authenticated-orcid":false,"given":"Lefteris","family":"Zervakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Tryfonopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spiros","family":"Skiadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manolis","family":"Koubarakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/860480.860483"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/383952.384012"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290998"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835485"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/182.358466"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.193"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1344411.1344414"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-012-0191-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276360"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304571"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375677"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375723"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2001.919117"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989390"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2487259.2487260"},{"key":"ref18","first-page":"53","article-title":"Efficient filtering of XML documents for selective dissemination of information","author":"altinel","year":"2000","journal-title":"Proc 26th Int Conf Very Large Data Bases"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958947"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458218"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1462198.1462202"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243275"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009047"},{"key":"ref6","first-page":"114","article-title":"A high-speed text scanning algorithm utilising least frequent\n trigraphs","author":"yochum","year":"1985","journal-title":"Proc IEEE Int Symp New Direction in Computing"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138866"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/176567.176573"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1994.283049"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243203"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.25"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243273"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994713"},{"journal-title":"The art of computer programming","year":"1973","author":"knuth","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36285-1_12"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45741-0_16"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/331983.331992"},{"key":"ref26","first-page":"129","article-title":"A data\n mining-based method for the incremental update of supporting personalized information filtering","volume":"24","author":"chang","year":"2008","journal-title":"J Inf Sci Eng"},{"key":"ref25","first-page":"272","article-title":"Information filtering based on user behaviour analysis and best match text retrieval","author":"morita","year":"1994","journal-title":"Proc Annu ACM SIGIR Conf Res Develop Inf Retrieval"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7812805\/07605505.pdf?arnumber=7605505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:38:11Z","timestamp":1641987491000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7605505\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":36,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2016.2620140","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2017,2,1]]}}}