{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:18:24Z","timestamp":1759133904041,"version":"3.41.2"},"reference-count":0,"publisher":"Inderscience Publishers","issue":"3\/4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJBIDM"],"published-print":{"date-parts":[[2009]]},"DOI":"10.1504\/ijbidm.2009.029076","type":"journal-article","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T12:30:24Z","timestamp":1257337824000},"page":"301","source":"Crossref","is-referenced-by-count":40,"title":["Fragmenting very large XML data warehouses via K-means clustering algorithm"],"prefix":"10.1504","volume":"4","author":[{"given":"Alfredo","family":"Cuzzocrea","sequence":"first","affiliation":[]},{"given":"Jerome","family":"Darmont","sequence":"additional","affiliation":[]},{"given":"Hadj","family":"Mahboubi","sequence":"additional","affiliation":[]}],"member":"378","container-title":["International Journal of Business Intelligence and Data Mining"],"original-title":[],"language":"en","deposited":{"date-parts":[[2011,3,8]],"date-time":"2011-03-08T07:30:33Z","timestamp":1299569433000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.inderscience.com\/link.php?id=29076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":0,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2009]]}},"URL":"https:\/\/doi.org\/10.1504\/ijbidm.2009.029076","relation":{},"ISSN":["1743-8187","1743-8195"],"issn-type":[{"type":"print","value":"1743-8187"},{"type":"electronic","value":"1743-8195"}],"subject":[],"published":{"date-parts":[[2009]]},"article-number":"29076"}}