{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T03:11:56Z","timestamp":1771211516132,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icde.2004.1320034","type":"proceedings-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T13:50:22Z","timestamp":1096379422000},"page":"646-657","source":"Crossref","is-referenced-by-count":19,"title":["ItCompress: an iterative semantic compression algorithm"],"prefix":"10.1109","author":[{"given":"H.V.","family":"Jagadish","sequence":"first","affiliation":[]},{"given":"R.T.","family":"Ng","sequence":"additional","affiliation":[]},{"family":"Beng Chin Ooi","sequence":"additional","affiliation":[]},{"given":"A.K.H.","family":"Tung","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"18","first-page":"550","article-title":"A universal algorithm for sequential data compression","volume":"24","author":"ziv","year":"1978","journal-title":"IEEE Transactions on Information Theory"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914848"},{"key":"16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","article-title":"BIRCH: An efficient data clustering method for very large databases","author":"zhang","year":"1996","journal-title":"Proc 7996 ACM-SIGMOD Int Conf Management of Data (SIGMOD'96)"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/6012.15407"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44503-X_26","article-title":"Constraint-based clustering in large databases","author":"tung","year":"2001","journal-title":"Proc 2001 Int Conf Database Theory (ICDT'01)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009726428407"},{"key":"12","first-page":"314","author":"ng","year":"1997","journal-title":"Block-oriented Compression Techniques for Relational Databases"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.224051"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223812"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375693"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253332"},{"key":"7","author":"jain","year":"1988","journal-title":"Algorithms for clustering data"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276312"},{"key":"5","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"4","author":"fukunaga","year":"1990","journal-title":"Introduction to statistical pattern recognition"},{"key":"9","first-page":"186","article-title":"Semantic compression and pattern extraction with fascicles","author":"jagadish","year":"1999","journal-title":"Proc 1999 Int Conf Very Large Data Bases (VLDB'99)"},{"key":"8","first-page":"229","article-title":"Comparing massive high-dimensional data sets","author":"johnson","year":"0","journal-title":"Proc 1998 KDD"}],"event":{"name":"Proceedings. 20th International Conference on Data Engineering","location":"Boston, MA, USA","acronym":"ICDE-04"},"container-title":["Proceedings. 20th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9217\/29235\/01320034.pdf?arnumber=1320034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T10:25:53Z","timestamp":1497608753000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1320034\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icde.2004.1320034","relation":{},"subject":[]}}