2016
DOI: 10.17706/jcp.11.2.91-98
|View full text |Cite
|
Sign up to set email alerts
|

A Set Intersection Algorithm Via x-Fast Trie

Abstract: This paper proposes a simple intersection algorithm for two sorted integer sequences . Our algorithm is designed based on x-fast trie since it provides efficient find and successor operators. We present that our algorithm outperforms skip list based algorithm when one of the sets to be intersected is relatively 'dense' while the other one is (relatively) 'sparse'. Finally, we propose some possible approaches which may optimize our algorithm further.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 24 publications
(16 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?