Space-efficient parallel algorithms for combinatorial search problems.
Andrea PietracaprinaGeppino PucciFrancesco SilvestriFabio VandinPublished in: J. Parallel Distributed Comput. (2015)
Keyphrases
- combinatorial search problems
- space efficient
- parallel algorithm
- search algorithm
- data structure
- constraint programming
- data streams
- parallel computation
- sliding window
- shared memory
- bloom filter
- suffix array
- range sum queries
- parallel programming
- parallel implementations
- constraint satisfaction
- linear space
- cluster of workstations
- b tree
- database management systems
- parallel computers
- pc cluster
- discovery of association rules
- constraint satisfaction problems