Udomchaiporn, Akadej

Loading...
Thumbnail Image
Preferred name
Udomchaiporn, Akadej
Main Affiliation
Email
akadej.ud@kmitl.ac.th

Filters

20081

Settings

Now showing 1 - 1 of 1
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A search-free intersection algorithm
    (2008-05-27)
    Udomchaiporn, Akadej
    ;
    Boonjing, Veera
    This paper proposes a new intersection algorithm of sorted sets. The new algorithm employs a comparison-and-elimination approach to the intersection problem instead of using search algorithms as existing intersection solutions. It takes (1) O(1) times for the best case; (2) 0(λ) times for the average case, where λ is an average size of sorted sets; and (3) 0(kn) times for the worst case, where k is the number of sorted sets and n is the total elements of k sorted sets. © 2008 IEEE.