An algebra for creating and querying multimedia presentations

  • Authors:

  • S. Adali;M. L. Sapino;V. S. Subrahmanian

  • Affiliations:

  • Rensselaer Polytechnic Institute, Department of Computer Science, Troy, NJ;Università di Torino, Corso Svizzera 185, 10149 Torino, Italy;University of Maryland, Institute for Advanced Computer Studies, College Park, MD

  • Venue:
  • Multimedia Systems - Special issue: Multimedia authoring and presentation techniques
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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.