Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3448016.3457251acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces

Published: 18 June 2021 Publication History

Abstract

Several visual graph query interfaces (a.k.a gui) expose a set of canned patterns (i.e., small subgraph patterns) to expedite subgraph query formulation by enabling pattern-at-a-time construction. Unfortunately, manual generation of canned patterns is not only labour intensive but also may lack diversity to support efficient visual formulation of a wide range of subgraph queries. Recent efforts have taken a data-driven approach to select high-quality canned patterns for a gui automatically from the underlying graph database. However, as the underlying database evolves, these selected patterns may become stale and adversely impact efficient query formulation. In this paper, we present a novel framework called Midas for efficient and effective maintenance of the canned patterns as the database evolves. Specifically, it adopts a selective maintenance strategy that guarantees progressive gain of coverage of the patterns without sacrificing their diversity and cognitive load. Experimental study with real-world datasets and visual graph interfaces demonstrates the effectiveness of Midas compared to static guis.

Supplementary Material

MP4 File (3448016.3457251.mp4)
Several visual graph query interfaces (a.k.a GUI) expose a set of canned patterns (i.e., small subgraph patterns) to expedite subgraph query formulation by enabling pattern-at-a-time construction. Unfortunately, manual generation of canned patterns is not only labour intensive but also may lack diversity to support efficient visual formulation of a wide range of subgraph queries. Recent efforts have taken a data-driven approach to select high-quality canned patterns for a GUI automatically from the underlying graph database. However, as the underlying database evolves, these selected patterns may become stale and adversely impact efficient query formulation. In this paper, we present a novel framework called MIDAS for efficient and effective maintenance of the canned patterns as the database evolves. Specifically, it adopts a selective maintenance strategy that guarantees progressive gain of coverage of the patterns without sacrificing diversity and cognitive load. Experimental study with real-world datasets and visual graph interfaces demonstrates the effectiveness of MIDAS compared to static GUIs.

References

[1]
textscaids dataset. https://wiki.nci.nih.gov/display/NCIDTPdata/AIDS
[2]
[5]
rugBank interface. https://go.drugbank.com/structures/search/small_molecule_drugs/structure.
[6]
Molecules dataset. https://www.emolecules.com/info/plus/download-database.
[7]
ubChem dataset. ftp://ftp.ncbi.nlm.nih.gov/pubchem/Compound/CURRENT-Full/SDF/.
[8]
ubChem interface. https://pubchem.ncbi.nlm.nih.gov//edit3/index.html.
[9]
. Abdelhamid, M. Canim, M. Sadoghi, B. Bhattacharjee, Y.C. Chang, P. Kalnis. Incremental frequent subgraph mining on large evolving graphs. IEEE T. Knowl. Data En. 29(12):2710--2723, 2017.
[10]
. Arora, E. Hazan, S. Kale. The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 2012.
[11]
. Arthur, S. Vassilvitskii. K-means
[12]
: The advantages of careful seeding. In SIAM, 2007.
[13]
.L. Balcázar, A. Bifet, A. Lozano. Mining frequent closed rooted trees. Machine Learning, 78(1--2):1, 2010.
[14]
. Bifet, R. Gavald$gravea$. Mining adaptively frequent closed unlabeled rooted trees in data streams. In SIGKDD, 2008.
[15]
. Bifet, R. Gavald$gravea$. Mining frequent closed trees in evolving data streams. Intell. Data Anal., 15(1):29--48, 2011.
[16]
.S. Bhowmick, B. Choi, C.E. Dyreson. Data-driven visual graph query interface construction and maintenance: challenges and opportunities. PVLDB, 9(12):984--992, 2016.
[17]
. S. Bhowmick, K. Huang, et al. AURORA: data-driven construction of visual graph query interfaces for graph databases. In SIGMOD, 2020.
[18]
. Bonnici, A. Ferro, R. Giugno, A. Pulvirenti, D. Shasha. Enhancing graph database indexing by suffix tree structure. In IAPR PRIB, 2010.
[19]
J. Cheng, Y. Ke, W. Ng, et al. Fg-index: towards verification-free query processing on graph databases. In SIGMOD, 2007.
[20]
. Cheung, O.R. Zaiane. Incremental mining of frequent patterns without candidate generation or support constraint. In IDEAS, 2003.
[21]
.P. Cordella, P. Foggia, et al. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell., 26(10):1367--1372, 2004.
[22]
. Fan, J. Li, S. Ma, N. Tang, Y. Wu and Y. Wu. Graph pattern matching: from intractability to polynomial time. In PVLDB, 2010.
[23]
. Fan, J. Li, J. Luo, Z. Tan, X. Wang, Y. Wu. Incremental graph pattern matching. In SIGMOD, 2011.
[24]
. Fan, C. Hu, C. Tian. Incremental graph computations: doable and undoable. In SIGMOD, 2017.
[25]
.L. Faulkner. Beyond the five-user assumption: Benefits of increased sample sizes in usability testing. Behavior Research Methods, Instruments, & Computers, 35(3), 2003.
[26]
. He, A.K. Singh. Closure-tree: An index structure for graph queries. In ICDE, 2006.
[27]
. Huang, H.E. Chua, S.S. Bhowmick, B. Choi, S. Zhou. CATAPULT: data-driven selection of canned patterns for efficient visual graph query formulation. In SIGMOD, 2019.
[28]
. Huang, H.E. Chua, S.S. Bhowmick, B. Choi, S. Zhou. MIDAS: towards efficient and effective maintenance of canned patterns in visual graph query interfaces. Technical Report. Available at: https://github.com/MIDAS2020/Midas/blob/master/sigmod-midas_TR.pdf.
[29]
. Huang, P. Eades, S.H. Hong. Measuring effectiveness of graph visualizations: A cognitive load perspective. Inf. Vis., 8(3):139--152, 2009.
[30]
. Lazar, J.H. Feng, H. Hochheiser. Research methods in human-computer interaction. John Wiley & Sons, 2010.
[31]
. Li, M. Semerci, B. Yener, M.J. Zaki. Graph classification via topological and label attributes. In MLG, 2011.
[32]
.J. Llanos, J. Leal, W. Luu, D.H. Jost, P.F., Stadler, G. Restrepo. Exploration of the chemical space and its three historical regimes. PNAS, 116(26):12660--12665, 2019.
[33]
.T. Marler, J.S. Arora. The weighted sum method for multi-objective optimization: new insights. Struct. Multidiscip. O., 41(6):853--862, 2010.
[34]
. Morina. The trie data structure in Java. Available at https://www.baeldung.com/trie-java. Accessed on 30 September 2019.
[35]
. Prvzulj. Biological network comparison using graphlet degree distribution. Bioinformatics, 23(2):e177-e183, 2007.
[36]
. Riesen, M. Neuhaus, H. Bunke. Bipartite graph matching for computing the edit distance of graphs. In GbRPR, 2007.
[37]
. Saha, L. Getoor. On maximum coverage in the streaming model & application to multi-topic blog-watch. In SDM, 2009.
[38]
. Saha. An incremental bisimulation algorithm. In FSTTCS, 2007.
[39]
. Shang, X. Lin, Y. Zhang, J.X. Yu, W. Wang. Connected substructure similarity search. In SIGMOD, 2010.
[40]
. Shneiderman, C. Plaisant. Desigining the user interface: strategies for effective human-computer interaction. 5th Ed., Addison-Wesley, 2010.
[41]
. Tofallis. Add or multiply? A tutorial on ranking and choosing with multiple criteria. INFORMS Trans. on Education, 14(3): 109--119, 2014.
[42]
. Wang, W. Hsu, M.L. Lee, C. Sheng. A partition-based approach to graph mining. In ICDE, 2006.
[43]
. Yan, P. S. Yu, J. Han. Graph indexing: a frequent structure-based approach. In SIGMOD, 2004.
[44]
. Yang, A.W.C. Fu, R. Liu. Diversified top-k subgraph querying in a large graph. In SIGMOD, 2016.
[45]
. Yoghourdjian, D. W. Archambault, et al.Exploring the limits of complexity: A survey of empirical studies on graph visualisation. Visual Informatics,2(4): 264--282, 2018.
[46]
. Yuan, P. Mitra, H. Yu, C.L. Giles. Iterative graph feature mining for graph indexing. In ICDE, 2012.
[47]
. Yuan, P. Mitra, H. Yu, C.L. Giles. Updating graph indices with a one-pass algorithm. In SIGMOD, 2015.
[48]
. Zhang, S.S. Bhowmick, H.H. Nguyen, B. Choi, F. Zhu. DaVinci: Data-driven visual interface construction for subgraph search in graph databases. In ICDE, 2015.
[49]
. Zhang, M. Hu, J. Yang. Treepi: A novel graph indexing method. In ICDE, 2007.
[50]
. Zhao, J.X. Yu, P.S. Yu. Graph indexing: tree
[51]
delta= graph. In VLDB, 2007.
[52]
. Zou, L. Chen, J.X. Yu, Y. Lu. A novel spectral coding in a large graph database. In EDBT, 181--192, 2008.

Cited By

View all
  • (2024)TED+: Towards Discovering Top-k Edge-Diversified Patterns in a Graph DatabaseIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.331256636:5(2224-2238)Online publication date: May-2024
  • (2023)VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query EnginesProceedings of the VLDB Endowment10.14778/3611540.361160816:12(4010-4013)Online publication date: 1-Aug-2023
  • (2023)TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph DatabaseProceedings of the ACM on Management of Data10.1145/35887361:1(1-26)Online publication date: 30-May-2023
  • Show More Cited By

Index Terms

  1. MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGMOD '21: Proceedings of the 2021 International Conference on Management of Data
    June 2021
    2969 pages
    ISBN:9781450383431
    DOI:10.1145/3448016
    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: 18 June 2021

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. canned patterns
    2. cognitive load
    3. coverage
    4. database updates
    5. diversity
    6. pattern maintenance
    7. query formulation
    8. visual graph query interfaces

    Qualifiers

    • Research-article

    Funding Sources

    • Ministry of Education Singapore

    Conference

    SIGMOD/PODS '21
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 785 of 4,003 submissions, 20%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)35
    • Downloads (Last 6 weeks)7
    Reflects downloads up to 03 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)TED+: Towards Discovering Top-k Edge-Diversified Patterns in a Graph DatabaseIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.331256636:5(2224-2238)Online publication date: May-2024
    • (2023)VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query EnginesProceedings of the VLDB Endowment10.14778/3611540.361160816:12(4010-4013)Online publication date: 1-Aug-2023
    • (2023)TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph DatabaseProceedings of the ACM on Management of Data10.1145/35887361:1(1-26)Online publication date: 30-May-2023
    • (2023)Maintenance of PatternsPlug-and-Play Visual Subgraph Query Interfaces10.1007/978-3-031-16162-9_8(123-158)Online publication date: 14-Mar-2023
    • (2023)The Future is Democratized GraphsPlug-and-Play Visual Subgraph Query Interfaces10.1007/978-3-031-16162-9_1(1-14)Online publication date: 14-Mar-2023
    • (2022)VINCENTProceedings of the VLDB Endowment10.14778/3554821.355486215:12(3634-3637)Online publication date: 1-Aug-2022
    • (2022)Data-driven Visual Query Interfaces for Graphs: Past, Present, and (Near) FutureProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3522562(2441-2447)Online publication date: 10-Jun-2022
    • (2021)Towards plug-and-play visual graph query interfacesProceedings of the VLDB Endowment10.14778/3476249.347625614:11(1979-1991)Online publication date: 1-Jul-2021

    View Options

    Get Access

    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