Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Protein Networks02:26

Protein Networks

2.9K
2.9K
Protein Networks02:26

Protein Networks

4.7K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.7K
Maximum Size of Aggregate01:12

Maximum Size of Aggregate

1.1K
The maximum size of aggregate is defined as the aperture of the sieve retaining 15 percent or more of the particles present in the aggregate sample. The aggregate's maximum size impacts the concrete's water requirement, workability, and strength. Larger aggregates reduce the surface area needing cement paste coverage, which can lower water needs, thereby allowing a decrease in the water-to-cement ratio when the desired workability and richness of the mix are to be maintained, which can...
1.1K
Network Covalent Solids02:18

Network Covalent Solids

16.6K
Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.6K
Protein-protein Interfaces02:04

Protein-protein Interfaces

15.0K
Many proteins form complexes to carry out their functions, making protein-protein interactions (PPIs) essential for an organism's survival. Most PPIs are stabilized by numerous weak noncovalent chemical forces. The physical shape of the interfaces determines the way two proteins interact. Many globular proteins have closely-matching shapes on their surfaces, which form a large number of weak bonds. Additionally, many PPIs occur between two helices or between a surface cleft and a...
15.0K
Interference: Path Lengths01:10

Interference: Path Lengths

2.5K
Consider two sources of sound, that may or may not be in phase, emitting waves at a single frequency, and consider the frequencies to be the same.
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...
2.5K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Litforager: Exploring Multimodal Literature Foraging Strategies in Immersive Sensemaking.

IEEE transactions on visualization and computer graphics·2025
Same author

Generative Graph Dictionary Learning.

Proceedings of machine learning research·2025
Same author

More Like Vis, Less Like Vis: Comparing Interactions for Integrating User Preferences Into Partial Specification Recommenders.

IEEE transactions on visualization and computer graphics·2025
Same author

Utilizing Provenance as an Attribute for Visual Data Analysis: A Design Probe With ProvenanceLens.

IEEE transactions on visualization and computer graphics·2025
Same author

Privacy-Preserving Graph Machine Learning from Data to Computation: A Survey.

SIGKDD explorations : newsletter of the Special Interest Group (SIG) on Knowledge Discovery & Data Mining·2025
Same author

Networked Time Series Imputation via Position-aware Graph Enhanced Variational Autoencoders.

KDD : proceedings. International Conference on Knowledge Discovery & Data Mining·2025
Same journal

Opportunities for Human-AI Collaboration in Remote Sighted Assistance.

IUI. International Conference on Intelligent User Interfaces·2025
Same journal

SaIL: Saliency-Driven Injection of ARIA Landmarks.

IUI. International Conference on Intelligent User Interfaces·2021
Same journal

Towards Making Videos Accessible for Low Vision Screen Magnifier Users.

IUI. International Conference on Intelligent User Interfaces·2021
Same journal

Scene Text Access: A Comparison of Mobile OCR Modalities for Blind Users.

IUI. International Conference on Intelligent User Interfaces·2019
Same journal

Towards a Generalizable Method for Detecting Fluid Intake with Wrist-Mounted Sensors and Adaptive Segmentation.

IUI. International Conference on Intelligent User Interfaces·2019
Same journal

Write-it-Yourself with the Aid of Smartwatches: A Wizard-of-Oz Experiment with Blind People.

IUI. International Conference on Intelligent User Interfaces·2018
See all related articles

Related Experiment Video

Updated: Apr 15, 2026

Executing Complexity-Increasing Queries in Relational MySQL and NoSQL MongoDB and EXist Size-Growing ISO/EN 13606 Standardized EHR Databases
07:26

Executing Complexity-Increasing Queries in Relational MySQL and NoSQL MongoDB and EXist Size-Growing ISO/EN 13606 Standardized EHR Databases

Published on: March 19, 2018

9.8K

Interactive Querying over Large Network Data: Scalability, Visualization, and Interaction Design.

Robert Pienta1, Acar Tamersoy1, Hanghang Tong2

  • 1Georgia Tech.

IUI. International Conference on Intelligent User Interfaces
|April 11, 2015
PubMed
Summary
This summary is machine-generated.

Interactive graph querying systems are essential for exploring large network data. Our research develops scalable algorithms and intuitive interfaces for efficient graph data exploration, moving towards a complete interactive querying solution.

Keywords:
Graph Querying and MiningH.5.m. Information Interfaces and Presentation (e.g. HCI): MiscellaneousInteraction DesignVisualization

More Related Videos

Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering
09:43

Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering

Published on: November 22, 2019

6.9K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.2K

Related Experiment Videos

Last Updated: Apr 15, 2026

Executing Complexity-Increasing Queries in Relational MySQL and NoSQL MongoDB and EXist Size-Growing ISO/EN 13606 Standardized EHR Databases
07:26

Executing Complexity-Increasing Queries in Relational MySQL and NoSQL MongoDB and EXist Size-Growing ISO/EN 13606 Standardized EHR Databases

Published on: March 19, 2018

9.8K
Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering
09:43

Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering

Published on: November 22, 2019

6.9K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.2K

Area of Science:

  • Computer Science
  • Data Mining
  • Human-Computer Interaction

Background:

  • Modern graph data is growing exponentially, necessitating advanced querying methods.
  • Current querying languages for complex graph structures can be cumbersome.
  • Interactive graph querying offers a more accessible approach to network data analysis.

Purpose of the Study:

  • To design and develop an interactive querying system for large network data.
  • To address the need for efficient querying of complex graph structures.
  • To bridge the gap between complex data mining and user accessibility.

Main Methods:

  • Developing scalable data mining algorithms for large-scale graph analysis.
  • Implementing advanced graph visualization techniques.
  • Focusing on robust interaction design for user-friendly querying.

Main Results:

  • An approximate subgraph matching system (MAGE) has been developed, capable of querying graphs with hundreds of millions of edges.
  • Preliminary work on visual graph querying (Graphite) has been completed.
  • Ongoing development of graph visualization and interaction design for a complete system.

Conclusions:

  • Scalable algorithms and effective visualization/interaction are key to interactive graph querying.
  • The developed system aims to simplify the exploration of large network datasets.
  • Further research is focused on integrating components for a fully interactive querying experience.