Skynets: Searching for minimum trees in graphs with incomparable edge weights

Huiping Cao, Kasim Candan, Maria Luisa Sapino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

Query processing over weighted data graphs often involves searching for a minimum weighted subgraph - a tree - which covers the nodes satisfying the given query criteria (such as a given set of keywords). Existing works often focus on graphs where the edges have scalar valued weights. In many applications, however, edge weights need to be represented as ranges (or intervals) of possible values. In this paper, we introduce the problem of skynets, for searching minimum weighted subgraphs, covering the nodes satisfying given query criteria, over interval-weighted graphs. The key challenge is that, unlike scalars which are often totally ordered, depending on the application specific semantics of the ≤ operator, intervals may be partially ordered. Naturally, the need to maintain alternative, incomparable solutions can push the computational complexity of the problem (which is already high for the case with totally ordered scalar edge weights) even higher. In this paper, we first provide alternative definitions of the ≤ operator for intervals and show that some of these lend themselves to efficient solutions. To tackle the complexity challenge in the remaining cases, we propose two optimization criteria that can be used to constrain the solution space. We also discuss how to extend existing approximation algorithms for Steiner trees to discover solutions to the skynet problem. For efficient calculation of the results, we introduce a novel skyline union operator. Experiments show that the proposed approach achieves significant gains in efficiency, while providing close to optimal results.

Original languageEnglish (US)
Title of host publicationCIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management
Pages1775-1784
Number of pages10
DOIs
StatePublished - Dec 13 2011
Event20th ACM Conference on Information and Knowledge Management, CIKM'11 - Glasgow, United Kingdom
Duration: Oct 24 2011Oct 28 2011

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Other

Other20th ACM Conference on Information and Knowledge Management, CIKM'11
CountryUnited Kingdom
CityGlasgow
Period10/24/1110/28/11

    Fingerprint

Keywords

  • graph search
  • incomparable edge weights
  • interval weighted graph
  • minimum spanning tree
  • skyline union

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Business, Management and Accounting(all)

Cite this

Cao, H., Candan, K., & Sapino, M. L. (2011). Skynets: Searching for minimum trees in graphs with incomparable edge weights. In CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management (pp. 1775-1784). (International Conference on Information and Knowledge Management, Proceedings). https://doi.org/10.1145/2063576.2063833