skip to main content
10.1145/2063576.2063833acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

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

Published: 24 October 2011 Publication History

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.

References

[1]
I. Bartolini, P. Ciaccia, and M. Patella. Salsa: computing the skyline without scanning the whole sky. CIKM'06, pp. 405--414, 2006.
[2]
. Bhalotia, A. Hulgeri,C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. ICDE, pp. 431--440, 2002.
[3]
S. Borzsonyi, K. Stocker, D. Kossmann. The skyline operator. ICDE 2001.
[4]
K. S.Candan, H. Cao, Y. Qi, M. L. Sapino System support for exploration and expert feedback in resolving conflicts during integration of metadata. VLDB J. 17(6): 1407--1444, 2008.
[5]
Jan Chomicki, Parke Godfrey, Jarek Gryz, and Dongming Liang. Skyline with presorting. In ICDE, pages 717--719, 2003.
[6]
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill, 2001.
[7]
. Deng, X. Zhou, and H. T. Shen. Multi-source skyline query processing in road networks. ICDE'07, 796--805, 2007.
[8]
S. K. Dey, and H. Jamil. A hierarchical approach to reachability query answering in very large graph databases. In CIKM'10.
[9]
K. Golenberg, B. Kimelfeld, and Y. Sagiv. Keyword proximity search in complex data graphs. In SIGMOD'08, pp. 927--940, 2008.
[10]
A. T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei and Y. Ghahremani.A genetic algorithm for Steiner tree optimization with multipleconstraints using Prufer number.LNCS,Vol.2510/2002, pp. 272--280, 2002.
[11]
.Hansen. Bicriterion path problems. Lect. Notes Econ. Math. Syst., Vol.117, 1979.
[12]
H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: ranked keyword searches on graphs. In SIGMOD'07, pp. 305--316, 2007
[13]
V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, pp. 670--681, 2002.
[14]
. Huang and C. Jensen. In-route skyline querying forlocation-based services. W2GIS 2004.
[15]
. Jin, M. Ester, Z. Hu, and J. Han. Themulti-relational skyline operator. ICDE'07,pp. 1276--1280, 2007.
[16]
Jin, H. Hong, H. Wang, N. Ruan, and Y. Xiang. Computing label-constraint reachability in graph databases. In SIGMOD'2010.
[17]
. Kacholia, S. Pandit,S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, pp. 505--516, 2005.
[18]
R.B. Kearfott. Interval computations: Introduction, uses, and resources. Euromath Bulletin, vol. 2, pp. 95--112. European Mathematical Trust, 1996.
[19]
. Kou, G. Markowsky, and L. Berman. A fastalgorithm for steiner trees. Acta Informatica,15(2). pp.141--145, 1981.
[20]
.-P. Kriegel and M. Renz, and M. Schubert. Routeskyline queries: A multi-preference path planning approach. In ICDE, pp. 261--272, 2010.
[21]
H.T. Kung, F. Luccio, and F.P. Preparata. On finding the maxima of a set of vectors. J.ACM, 22(4). pp. 469--476, 1975.
[22]
W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Retrieving and organizing web pages by "information unit". In WWW, pp. 230--244, 2001.
[23]
L. Liu, J. Wang, J. Liu, and J. Zhang. Privacy preserving in social networks against sensitive edge disclosure. Technical Report CMIDA-HiPSCCS 006-08, Department of Computer Science, Univ. of Kentucky, 2008.
[24]
Y. Luo, X. Lin, W. Wang, and X. Zhou. Spark: top-k keyword query in relational databases. In SIGMOD'07, pp. 115--126, 2007.
[25]
METIS. http://glaros.dtc.umn.edu/gkhome/metis/metis/overview.
[26]
S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In Proc. SIGMOD'08, pages 419--432, 2008.
[27]
L. Qin, J. X. Yu, and L. Chang. Keyword search in databases: the power of rdbms. In Proc. SIGMOD'09, pp.681--694. 2009.
[28]
G. Reich and P. Widmayer. Beyond steiner's problem: A VLSI oriented generalization. In 15th Int. Work. WG '89, pages 196--210, 1989.
[29]
G. Robins, A. Zelikovsky. Improved Steiner tree approximation in graphs. in SODA'00, pp.770--779, 2000.
[30]
. Sun, S. Wu, J. Li, and A. K. H. Tung. Skyline-join in distributed databases. In ICDEW'08,pp. 176--181, 2008.
[31]
A.Sengupta, T.K Pal, Solving the Shortest Path Problem with Interval Arcs,Fuzzy Optimization and Decision Making, 5(1), 2006, pp. 71--89.
[32]
L. Sweeney. Achieving k-anonymity privacy protection using generalizationand suppression. IJUFKS10(5), 2002.
[33]
K. L. Tan, P. K. Eng, andB. C. Ooi. Efficient progressive skyline computation. In VLDB'01, pages 301--310, 2001.
[34]
Z.Tarapata. Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms. Int. J. Appl. Math. Comput. Sci. 17, 2 June 2007.
[35]
. Warburton. Approximation of Pareto optima in multiple-objective, shortest-path problems. Operations Research.35(1), pp. 70--79, 1987.
[36]
S. Winter, M. Sester, O. Wolfson, and Glenn Geers. Towards a Computational Transportation Science.In SIGMOD Record, vol.39(3), 2010.
[37]
A. Zelikovsky. Better approximation bounds for the network and Euclidean Steiner treeproblems. Technical report CS-96-06, University of Virginia, 1996.

Cited By

View all
  • (2019)Matrix Factorization with Interval-Valued DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2942310(1-1)Online publication date: 2019
  • (2017)Personalized PageRank in Uncertain Graphs with Mutually Exclusive EdgesProceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3077136.3080794(525-534)Online publication date: 7-Aug-2017
  • (2016)iBFSProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882959(403-416)Online publication date: 26-Jun-2016
  • Show More Cited By

Index Terms

  1. Skynets: searching for minimum trees in graphs with incomparable edge weights

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management
    October 2011
    2712 pages
    ISBN:9781450307178
    DOI:10.1145/2063576
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 24 October 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. graph search
    2. incomparable edge weights
    3. interval weighted graph
    4. minimum spanning tree
    5. skyline union

    Qualifiers

    • Research-article

    Conference

    CIKM '11
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Matrix Factorization with Interval-Valued DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2942310(1-1)Online publication date: 2019
    • (2017)Personalized PageRank in Uncertain Graphs with Mutually Exclusive EdgesProceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3077136.3080794(525-534)Online publication date: 7-Aug-2017
    • (2016)iBFSProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882959(403-416)Online publication date: 26-Jun-2016
    • (2015)Efficient keyword search on graphs using MapReduceProceedings of the 2015 IEEE International Conference on Big Data (Big Data)10.1109/BigData.2015.7364106(2871-2873)Online publication date: 29-Oct-2015

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media