Approximation algorithms for data placement in arbitrary networks.
Ivan D. BaevRajmohan RajaramanPublished in: SODA (2001)
Keyphrases
- approximation algorithms
- data placement
- np hard
- high availability
- special case
- query optimization
- worst case
- access patterns
- vertex cover
- distributed environment
- data storage
- constant factor
- approximation ratio
- constant factor approximation
- wireless broadcast
- data center
- range queries
- xml queries
- distributed database systems
- storage systems
- parallel processing
- upper bound
- data partitioning
- lower bound
- optimal solution