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 publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages1775-1784
Number of pages10
DOIs
StatePublished - 2011
Event20th ACM Conference on Information and Knowledge Management, CIKM'11 - Glasgow, United Kingdom
Duration: Oct 24 2011Oct 28 2011

Other

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

Fingerprint

Operator
Graph
Query
Node
Key words
Computational complexity
Experiment
Approximation algorithms
Query processing

Keywords

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

ASJC Scopus subject areas

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

Cite this

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

Skynets : Searching for minimum trees in graphs with incomparable edge weights. / Cao, Huiping; Candan, Kasim; Sapino, Maria Luisa.

International Conference on Information and Knowledge Management, Proceedings. 2011. p. 1775-1784.

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

Cao, H, Candan, K & Sapino, ML 2011, Skynets: Searching for minimum trees in graphs with incomparable edge weights. in International Conference on Information and Knowledge Management, Proceedings. pp. 1775-1784, 20th ACM Conference on Information and Knowledge Management, CIKM'11, Glasgow, United Kingdom, 10/24/11. https://doi.org/10.1145/2063576.2063833
Cao H, Candan K, Sapino ML. Skynets: Searching for minimum trees in graphs with incomparable edge weights. In International Conference on Information and Knowledge Management, Proceedings. 2011. p. 1775-1784 https://doi.org/10.1145/2063576.2063833
Cao, Huiping ; Candan, Kasim ; Sapino, Maria Luisa. / Skynets : Searching for minimum trees in graphs with incomparable edge weights. International Conference on Information and Knowledge Management, Proceedings. 2011. pp. 1775-1784
@inproceedings{fec22459300f4f6aaf03d3951939dac1,
title = "Skynets: Searching for minimum trees in graphs with incomparable edge weights",
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.",
keywords = "graph search, incomparable edge weights, interval weighted graph, minimum spanning tree, skyline union",
author = "Huiping Cao and Kasim Candan and Sapino, {Maria Luisa}",
year = "2011",
doi = "10.1145/2063576.2063833",
language = "English (US)",
isbn = "9781450307178",
pages = "1775--1784",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - Skynets

T2 - Searching for minimum trees in graphs with incomparable edge weights

AU - Cao, Huiping

AU - Candan, Kasim

AU - Sapino, Maria Luisa

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - graph search

KW - incomparable edge weights

KW - interval weighted graph

KW - minimum spanning tree

KW - skyline union

UR - http://www.scopus.com/inward/record.url?scp=83055179349&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83055179349&partnerID=8YFLogxK

U2 - 10.1145/2063576.2063833

DO - 10.1145/2063576.2063833

M3 - Conference contribution

AN - SCOPUS:83055179349

SN - 9781450307178

SP - 1775

EP - 1784

BT - International Conference on Information and Knowledge Management, Proceedings

ER -