Space-Efficient Parallel Algorithms for Combinatorial Search Problems.
Andrea PietracaprinaGeppino PucciFrancesco SilvestriFabio VandinPublished in: MFCS (2013)
Keyphrases
- space efficient
- combinatorial search problems
- parallel algorithm
- data structure
- search algorithm
- constraint programming
- parallel computation
- data streams
- sliding window
- suffix array
- shared memory
- parallel version
- parallel programming
- parallel implementations
- bloom filter
- linear space
- range sum queries
- databases
- pc cluster
- discovery of association rules
- cluster of workstations
- b tree
- data warehouse
- uncertain data streams
- database systems