Minimized-cost cube query on heterogeneous information networks

DOI10.1007/S10878-015-9967-6zbMATH Open1366.90022OpenAlexW2278039258MaRDI QIDQ512896FDOQ512896

Authors: Dan Yin, Hong Gao, Zhao-Nian Zou, Jianzhong Li 

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9967-6

Recommendations

• scientific article; zbMATH DE number 1977111
• Logic Programming
• Cohesive subgraph search over large heterogeneous information networks

zbMATH Keywords

cubeaggregate graphheterogeneous information networkmaterializationOLAP

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Data mining. Concepts and techniques

Cited In (1)

• Effective and efficient aggregation on uncertain graphs

This page was built for publication: Minimized-cost cube query on heterogeneous information networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512896)