An algebra for creating and querying multimedia presentations |
| |
Authors: | S Adalı ML Sapino VS Subrahmanian |
| |
Affiliation: | (1) Rensselaer Polytechnic Institute, Department of Computer Science, Troy, NJ 12180-3590, USA; e-mail: sibel@cs.rpi.edu, US;(2) Università di Torino, Corso Svizzera 185, 10149 Torino, Italy; e-mail: mlsapino@di.unito.it, IT;(3) University of Maryland, Institute for Advanced Computer Studies, College Park, MD 20742, USA; e-mail: vs@cs.umd.edu, US |
| |
Abstract: | Over the last few years, there has been a tremendous increase in the number of interactive multimedia presentations prepared
by different individuals and organizations. In this paper, we present an algebra for creating and querying interactive multimedia
presentation databases. This algebra operates on trees whose branches reflect different possible playouts of a set of presentations.
The algebra not only extends all the classical relational operators to such databases, but also introduces a variety of novel
operators for combining multiple presentations. As our algebra supports merging parts or all of existing presentations, this
algebra can also be used as an authoring tool for creating multimedia presentations. We prove a host of equivalence results
for queries in this algebra, which may be used to build query optimizers for interactive presentation databases. |
| |
Keywords: | : Multimedia databases – Multimedia presentations |
本文献已被 SpringerLink 等数据库收录! |
|