Abstract
Given a distributed multimedia database system and a set of queries as well as their frequencies from each site, the objective of a data allocation algorithm is to locate the multimedia data objects (MDOs) at different sites so as to minimize the total data transfer cost incurred in executing the queries. The data allocation problem, however, is NP-complete, and thus requires fast heuristics to generate efficient solutions. In this paper we propose three data allocation algorithms which are based on a genetic technique, an evolutionary process, and neural networks. We have implemented and evaluated these algorithms on our distributed multimedia database system test-bed. A comparison of the algorithms reveals trade-offs between their solution quality and time-complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 296-301 |
| Number of pages | 6 |
| Journal | Proceedings - IEEE Computer Society's International Computer Software and Applications Conference |
| Publication status | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 21st Annual International Computer Software & Applications Conference, COMPSAC'97 - Washington, DC, USA Duration: 13 Aug 1997 → 15 Aug 1997 |
Fingerprint
Dive into the research topics of 'Empirical evaluation of data allocation algorithms for distributed multimedia database systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver