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

Parallel Processing01:20

Parallel Processing

928
The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
928
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

929
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
929
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

4.3K
The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an...
4.3K
Parallel-axis Theorem01:06

Parallel-axis Theorem

8.7K
The parallel-axis theorem provides a convenient and quick method of finding the moment of inertia of an object about an axis parallel to the axis passing through its center of mass. Consider a thin rod as an example. There is a striking similarity between the process of finding the moment of inertia of a thin rod about an axis through its middle, where the center of mass lies, and about an axis through its end using the conventional method. In the conventional method, the concept of linear mass...
8.7K
Parallel-Axis Theorem for an Area01:12

Parallel-Axis Theorem for an Area

3.5K
The moment of inertia is a fundamental concept in mechanical engineering that plays a significant role in designing rotationally symmetric objects such as flywheels, gears, and other mechanical systems. In this context, we will discuss the moment of inertia of a flywheel rotating about its centroidal axis and how it relates to the moment of inertia about an axis parallel to it.
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...
3.5K
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

2.2K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
2.2K

You might also read

Related Articles

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

Sort by
Same author

Jump-starting the T cell response in established tumors.

bioRxiv : the preprint server for biology·2026
Same author

<i>Special Issue:</i> 13th International Conference on Computational Advances in Bio and Medical Sciences.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same author

Fast Algorithms for Computing Jaro Similarity.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same author

Reprogramming CAR T-Cells with designed bioPROTACs.

bioRxiv : the preprint server for biology·2026
Same author

Icaritin suppresses CAD-mediated liver cancer development by targeting miR-18b-5p in a xenograft mouse model.

Medical oncology (Northwood, London, England)·2025
Same author

Comparative and phylogenetic study on the chloroplast genomes of CMS with the cytoplasm of Aegilops ovata and its maintainer line in wheat.

BMC genomics·2025
See all related articles

Related Experiment Video

Updated: Apr 21, 2026

Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays
05:04

Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays

Published on: June 13, 2023

2.6K

A Two-Pass Exact Algorithm for Selection on Parallel Disk Systems.

Tian Mi1, Sanguthevar Rajasekaran1

  • 1Department of Computer Science and Engineering, University of Connecticut, Storrs, USA.

Proceedings. IEEE Symposium on Computers and Communications
|November 7, 2014
PubMed
Summary
This summary is machine-generated.

We introduce Recursive Sampling Selection (RSS), a new algorithm for efficient out-of-core data selection. RSS achieves optimal performance in parallel disk systems, outperforming existing methods for big data challenges.

Keywords:
MedianOLAP queriesParallel Disk SystemSelection

More Related Videos

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection
08:01

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection

Published on: December 15, 2015

8.0K
Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries
12:55

Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries

Published on: January 17, 2015

19.5K

Related Experiment Videos

Last Updated: Apr 21, 2026

Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays
05:04

Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays

Published on: June 13, 2023

2.6K
Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection
08:01

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection

Published on: December 15, 2015

8.0K
Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries
12:55

Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries

Published on: January 17, 2015

19.5K

Area of Science:

  • Database Systems
  • Data Mining
  • Algorithms

Background:

  • Selection operations like "top N" are crucial for OLAP queries in data warehousing.
  • Efficient parallel selection is vital for modern database management and complex data querying.

Purpose of the Study:

  • To present a novel deterministic algorithm, Recursive Sampling Selection (RSS), for the exact out-of-core selection problem.
  • To analyze the performance of RSS against existing algorithms on parallel disk systems.

Main Methods:

  • Developed a deterministic algorithm, Recursive Sampling Selection (RSS), for out-of-core selection.
  • Compared RSS with Deterministic Sampling Selection (DSS) and QuickSelect on Parallel Disk Systems.

Main Results:

  • RSS requires no more than (2 + ε) passes for out-of-core selection, without assumptions on data size relative to memory.
  • Both RSS and DSS outperform QuickSelect on Parallel Disk Systems.
  • RSS demonstrates superior scalability and robustness for big data (N ≫ M).

Conclusions:

  • The proposed RSS algorithm provides an efficient and scalable solution for exact out-of-core selection problems.
  • RSS is particularly effective for handling large datasets that exceed core memory capacity in data warehousing applications.