Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Retrieving and organizing web pages by “information unit”
Proceedings of the 10th international conference on World Wide Web
Introduction to Algorithms
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
A Genetic Algorithm for Steiner Tree Optimization with Multiple Constraints Using Prüfer Number
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Beyond Steiner's Problem: A VLSI Oriented Generalization
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Achieving k-anonymity privacy protection using generalization and suppression
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Better approximation bounds for the network and Euclidean Steiner tree problems
Better approximation bounds for the network and Euclidean Steiner tree problems
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Solving the Shortest Path Problem with Interval Arcs
Fuzzy Optimization and Decision Making
SaLSa: computing the skyline without scanning the whole sky
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Spark: top-k keyword query in relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Graph summarization with bounded error
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The VLDB Journal — The International Journal on Very Large Data Bases
Keyword search in databases: the power of RDBMS
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
International Journal of Applied Mathematics and Computer Science
Computing label-constraint reachability in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A hierarchical approach to reachability query answering in very large graph databases
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Towards a computational transportation science
ACM SIGMOD Record
In-Route skyline querying for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Hi-index | 0.01 |
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.