Details
-
Improvement
-
Status: Open
-
Major
-
Resolution: Unresolved
-
None
-
None
Description
The core of the algorithm (as python) is
for i, elem in array:
output[i] = (elem in memo_table)
Often the right operand list will be very small, in this case, the hashtable should be replaced with a constant vector.
Attachments
Attachments
Issue Links
- Dependency
-
ARROW-5394 [C++] Benchmarks for IsIn Kernel
- Resolved