Abstract
The sorted-set intersection problem is important because it plays a key role in many algorithms. Instead of processing multiple short sorted-set intersections concurrently in previous work, this work focuses on how to efficiently find the intersection from two long sorted sets using emerging general-purpose graphics processing units (GPUs). We have implemented and evaluated four different algorithms to solve the set intersection problem. According to the experimental results, we identify which algorithm is the best choice based on the problem size.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barbay J, Lopez-Ortiz A, Lu T (2006) Faster adaptive set intersections for text searching. In: WEA 2006. Springer, Berlin/New York, pp 146–157
Barbay J, Lopez-Ortiz A, Lu T, Salinger A (2010) An experimental investigation of set intersection algorithms for text searching. J Exp Algorithm 14(7):3.7–3.24
Demaine ED, Lopez-Ortiz A, Munro JI (2000) Adaptive set intersections, unions, and differences. In: SODA, Philadelphia, 2000, pp 743–752
Ding B, Konig AC (2011) Fast set intersection in memory. In: Proceeding of the VLDB Endow, Seattle, 2011, vol 4, pp 255–266
Hwang FK, Lin S (1972) A simple algorithm for merging two disjoint linearly-ordered sets. SIAM J Comput 1:31–39
Sanders P, Transier F (2007) Intersection in integer inverted indices. In: ALENEX. SIAM, Philadelphia, 2007
Tatikonda S, Junqueira F, Cambazoglu BB, Plachouras V (2009) On efficient posting list intersection with multicore processors. In: SIGIR ’09, New York, 2009, pp 738–739
Tsirogiannis D, Guha S, Koudas N (2009) Improving the performance of list intersection. In: Proceedings of the VLDB Endow, Lyon, Aug 2009, vol 2, pp 838–849
Ao N, Zhang F, Wu D, Stones DS, Wang G, Liu X, Liu J, Lin S (2011) Efficient parallel lists intersection and index compression algorithms using graphics processing units. In: VLDB, Seattle, 5 Jan 2011
Ding S, He J, Yan H, Suel T (2008) Using graphics processors for high-performance IR query processing. In: WWW, New York, 2008, pp 1213–1214
Wu D, Zhang F, Ao N, Wang F, Liu X, Wang G (2009) A batched GPU algorithm for set intersection. In: Symposium on pervasive systems, algorithms, and networks, ISPAN ’09, Washington, DC, 2009, pp 752–756
Wu D, Zhang F, Ao N, Wang G, Liu X, Liu J (2010) Efficient lists intersection by CPU-GPU cooperative computing. In: IPDPS workshops. IEEE, Atlanta, 2010, pp 1–8
Acknowledgment
The authors would like to thank the National Science Council, Taiwan, for financially supporting this research under Contract No. NSC101-2221-E-018-030.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Jhan, SS., Huang, LT., Lai, LF., Wei, KC., Wei, TY., Wu, CC. (2013). On Mapping the Sorted-Set Intersection Problem onto a Graphics Processing Unit. In: Juang, J., Huang, YC. (eds) Intelligent Technologies and Engineering Systems. Lecture Notes in Electrical Engineering, vol 234. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6747-2_19
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6747-2_19
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-6746-5
Online ISBN: 978-1-4614-6747-2
eBook Packages: EngineeringEngineering (R0)