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

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

824
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
824
Collisions in Multiple Dimensions: Problem Solving01:06

Collisions in Multiple Dimensions: Problem Solving

4.6K
In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
4.6K
Statistical Analysis: Overview01:11

Statistical Analysis: Overview

10.6K
When we take repeated measurements on the same or replicated samples, we will observe inconsistencies in the magnitude. These inconsistencies are called errors. To categorize and characterize these results and their errors, the researcher can use statistical analysis to determine the quality of the measurements and/or suitability of the methods.
One of the most commonly used statistical quantifiers is the mean, which is the ratio between the sum of the numerical values of all results and the...
10.6K
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

337
Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures...
337
Collisions in Multiple Dimensions: Introduction01:05

Collisions in Multiple Dimensions: Introduction

5.8K
It is far more common for collisions to occur in two dimensions; that is, the initial velocity vectors are neither parallel nor antiparallel to each other. Let's see what complications arise from this. The first idea is that momentum is a vector. Like all vectors, it can be expressed as a sum of perpendicular components (usually, though not always, an x-component and a y-component, and a z-component if necessary). Thus, when the statement of conservation of momentum is written for a...
5.8K
Contingency Table01:29

Contingency Table

2.8K
A contingency table provides a way of portraying data that can facilitate calculating probabilities. It is a method of displaying a frequency distribution as a table with rows and columns to show how two variables may be dependent (contingent) upon each other; The table helps determine conditional probabilities quite quickly and can help systematically organize, analyze and quantify data. The table displays sample values concerning two variables that may be dependent or contingent on one...
2.8K

You might also read

Related Articles

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

Sort by
Same author

Construction of Ni<sub>x</sub>Fe<sub>y</sub>/m-ZrO<sub>2</sub> catalysts and their self-hydrogen transfer hydrogenation liquefaction of cellulose.

Bioresource technology·2026
Same author

Immune cells in chronic prostatitis/chronic pelvic pain syndrome: From pathological mechanisms to therapeutic opportunities.

Cellular signalling·2026
Same author

Soft Supervision Guided Spatial-Temporal Refinement Network For Video-based Visible-Infrared Person Re-Identification.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

A GNSS receiver positioning algorithm based on weighting the statistical properties of discontinuous signals at lower rotation speeds.

PloS one·2025
Same author

Effects of Micro(nano)plastics on Anaerobic Digestion and Their Influencing Mechanisms.

Microorganisms·2025
Same author

Hepatotoxic effects of exposure to different concentrations of Dibutyl phthalate (DBP) in Schizothorax prenanti: Insights from a multi-omics analysis.

Aquatic toxicology (Amsterdam, Netherlands)·2025
See all related articles

Related Experiment Video

Updated: Oct 26, 2025

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

784

Any-k Algorithms for Exploratory Analysis with Conjunctive Queries.

Xiaofeng Yang1, Mirek Riedewald1, Rundong Li1

  • 1College of Computer and Information Science, Northeastern University, Boston, MA, USA.

Proceedings of the 5Th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5Th : 2018 : Houston, Tex.)
|July 30, 2021
PubMed
Summary
This summary is machine-generated.

We introduce any-k queries for efficient tree-pattern search in labeled graphs. The KARPET algorithm returns top-ranked results within a time budget, offering flexibility for exploratory data analysis.

More Related Videos

Eye-tracking Technology and Data-mining Techniques used for a Behavioral Analysis of Adults engaged in Learning Processes
10:43

Eye-tracking Technology and Data-mining Techniques used for a Behavioral Analysis of Adults engaged in Learning Processes

Published on: June 10, 2021

5.6K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.6K

Related Experiment Videos

Last Updated: Oct 26, 2025

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

784
Eye-tracking Technology and Data-mining Techniques used for a Behavioral Analysis of Adults engaged in Learning Processes
10:43

Eye-tracking Technology and Data-mining Techniques used for a Behavioral Analysis of Adults engaged in Learning Processes

Published on: June 10, 2021

5.6K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.6K

Area of Science:

  • Computer Science
  • Graph Databases
  • Information Retrieval

Background:

  • Tree-pattern search is crucial for querying labeled graphs.
  • Existing top-k query methods require a predefined number of results.
  • Efficiently handling variable result set sizes is an ongoing challenge.

Purpose of the Study:

  • To introduce the concept of any-k queries for flexible graph pattern matching.
  • To present the KARPET algorithm for implementing any-k queries.
  • To explore the extension of KARPET for broader conjunctive query support.

Main Methods:

  • Proposed the any-k query paradigm, an extension of top-k queries.
  • Utilized the KARPET algorithm for efficient tree-pattern search in labeled graphs.
  • Investigated the adaptability of KARPET for arbitrary conjunctive queries.

Main Results:

  • The any-k approach allows returning results incrementally within a time budget.
  • KARPET efficiently retrieves top-ranked results and subsequent results upon extended time.
  • The algorithm's performance approaches that of producing all results when stopping is not possible.

Conclusions:

  • Any-k queries offer a flexible alternative to fixed top-k queries in graph databases.
  • The KARPET algorithm provides an efficient solution for any-k tree-pattern search.
  • KARPET shows potential for extension to support any-k exploratory search for conjunctive queries.