Towards a theory of movie database queries

B. Kuijpers, J. Paredaens, D. Van Gucht

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)

Abstract

We present a data model for movies and movie databases. A movie is considered to be a 2D semi-algebraic figure that can change in time. We give a number of computability results concerning movies: it can be decided whether a frame of a movie is only a topologically transformation of another frame; a movie has a finite number of scenes and cuts and these can be effectively computed. Based on these computability results we define an SQL-like query language for movie databases. This query language supports most movie editing operations like cutting, pasting and selection of scenes.
Original languageEnglish
Title of host publicationProceedings 7th International Symposium on Temporal Representation and Reasoning (TIME 2000, Cape Breton NS, USA, July 7-9, 2000)
PublisherInstitute of Electrical and Electronics Engineers
Pages95-102
Number of pages8
ISBN (Print)0-7695-0756-5
DOIs
Publication statusPublished - 2000

Fingerprint Dive into the research topics of 'Towards a theory of movie database queries'. Together they form a unique fingerprint.

  • Cite this

    Kuijpers, B., Paredaens, J., & Van Gucht, D. (2000). Towards a theory of movie database queries. In Proceedings 7th International Symposium on Temporal Representation and Reasoning (TIME 2000, Cape Breton NS, USA, July 7-9, 2000) (pp. 95-102). [856590] Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TIME.2000.856590