{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:11:01Z","timestamp":1759032661738},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T00:00:00Z","timestamp":1445472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Grand Fundamental Research 973 Program of China","award":["2012CB316200"],"award-info":[{"award-number":["2012CB316200"]}]},{"name":"Key Program of National Natural Science Foundation of China","award":["60933001"],"award-info":[{"award-number":["60933001"]}]},{"name":"Major Program of National Natural Science Foundation of China","award":["61190115"],"award-info":[{"award-number":["61190115"]}]},{"name":"General Program of National Natural Science Foundation of China","award":["61173023"],"award-info":[{"award-number":["61173023"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10878-015-9967-6","type":"journal-article","created":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T05:11:45Z","timestamp":1445490705000},"page":"339-364","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimized-cost cube query on heterogeneous information networks"],"prefix":"10.1007","volume":"33","author":[{"given":"Dan","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,22]]},"reference":[{"key":"9967_CR1","doi-asserted-by":"crossref","unstructured":"Chen C, Yan X, Zhu F, Han J, Yu PS (2008) Graph olap: towards online analytical processing on graphs. In: IEEE Proceedings of international conference on data mining, NJ, pp 103\u2013112","DOI":"10.1109\/ICDM.2008.30"},{"issue":"1","key":"9967_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10115-009-0228-9","volume":"21","author":"C Chen","year":"2009","unstructured":"Chen C, Yan X, Zhu F, Han J, Yu PS (2009) Graph olap: a multi-dimensional framework for graph data analysis. Knowl Inf Syst 21(1):41\u201363","journal-title":"Knowl Inf Syst"},{"key":"9967_CR3","unstructured":"Haas PJ, Naughton JF, Seshadri S (1995) Sampling-based estimation of the number of distinct values of an attribute. In: Proceedings of International Conference on Very Large Data Bases, ACM, New York, pp 311\u2013322"},{"key":"9967_CR4","doi-asserted-by":"crossref","unstructured":"Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cube efficiently. In: Proceedings of ACM SIGMOD international conference on Management of data, ACM, New York, pp 205\u2013216","DOI":"10.1145\/233269.233333"},{"key":"9967_CR5","doi-asserted-by":"crossref","unstructured":"Ji M, Han J, Danilevsky M (2011) Ranking-based classification of heterogeneous information networks. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, pp 1298\u20131306","DOI":"10.1145\/2020408.2020603"},{"key":"9967_CR6","volume-title":"Data mining: concepts and techniques","author":"H Jiawei","year":"2005","unstructured":"Jiawei H, Micheline K (2005) Data mining: concepts and techniques. Morgan Kaufmann, California"},{"key":"9967_CR7","doi-asserted-by":"crossref","unstructured":"Karloff H, Mihail M (1999) On the complexity of the view-selection problem. In: Proceedings of ACM PODS international conference, ACM, New York, pp 167\u2013173","DOI":"10.1145\/303976.303993"},{"key":"9967_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"key":"9967_CR9","unstructured":"Li N, Guan Z, Ren L, Wu J, Han J, Yan X (2013) Giceberg: towards iceberg analysis in large graphs. In: IEEE Proceedings of the 2013 IEEE international conference on data engineering, pp 1021\u20131032"},{"key":"9967_CR10","unstructured":"Shen W, Han J, Wang J (2014) A probabilistic model for linking named entities in web text wit heterogeneous information networks. In: Proceedings of ACM SIGMOD international conference on management of data, ACM, New York, pp 1199\u20131210"},{"key":"9967_CR11","doi-asserted-by":"crossref","unstructured":"Sun Y, Han J, Zhao P, Yin Z, Cheng H, Wu T (2009) Rankclus: integrating clustering with ranking for heterogeneous information network analysis. In: Proceedings of the international conference on extending database technology: advances in database technology, ACM, New York, pp 565\u2013576","DOI":"10.1145\/1516360.1516426"},{"key":"9967_CR12","doi-asserted-by":"crossref","unstructured":"Sun Y, Barber R, Gupta M (2011a) Co-author relationship prediction in heterogeneous bibliographic networks. In: IEEE International Conference on advances in social networks analysis and mining, NJ, pp 121\u2013128","DOI":"10.1109\/ASONAM.2011.112"},{"issue":"11","key":"9967_CR13","doi-asserted-by":"crossref","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun Y, Han J, Yan X, Yu PS, Wu T (2011b) Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc VLDB Endow 4(11):992\u20131003","journal-title":"Proc VLDB Endow"},{"key":"9967_CR14","doi-asserted-by":"crossref","unstructured":"Sun Y, Norick B, Han J, Yan X, Yu PS, Yu X (2012) Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In: Proceedings of the ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, pp 1348\u20131356","DOI":"10.1145\/2339530.2339738"},{"key":"9967_CR15","doi-asserted-by":"crossref","unstructured":"Tian Y, Hankins RA, Patel JM (2008) Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, ACM, New York, pp 567\u2013580","DOI":"10.1145\/1376616.1376675"},{"key":"9967_CR16","doi-asserted-by":"crossref","unstructured":"Wang Z, Fan Q, Wang H, Tan KL, Agrawal D, Abbadi AE (2014) Pagrol: parallel graph olap over large-scale attributed graphs. In: Proceeding of IEEE International Conference on Data Engineering, pp 496\u2013507","DOI":"10.1109\/ICDE.2014.6816676"},{"key":"9967_CR17","doi-asserted-by":"crossref","unstructured":"Yin D, Gao H (2014) Iceberg cube query on heterogeneous information networks. In: Wireless algorithms, systems, and applications, Springer: Berlin, pp 740\u2013749","DOI":"10.1007\/978-3-319-07782-6_66"},{"key":"9967_CR18","doi-asserted-by":"crossref","unstructured":"Zhang N, Tian Y, Pate (2010) Discovery-driven graph summarization. In: Proceeding of IEEE international conference on data engineering, NJ, pp 880\u2013891","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"9967_CR19","doi-asserted-by":"crossref","unstructured":"Zhao P, Li X, Xin D, Han J (2011) Graph cube: on warehousing and olap multidimensional networks. In: Proceedings of the ACM SIGMOD international conference on management of data, ACM, New York, pp 853\u2013864","DOI":"10.1145\/1989323.1989413"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9967-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9967-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9967-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9967-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T02:10:20Z","timestamp":1599703820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9967-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,22]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9967"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9967-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,22]]}}}