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.
|Title of host publication||Proceedings 7th International Symposium on Temporal Representation and Reasoning (TIME 2000, Cape Breton NS, USA, July 7-9, 2000)|
|Publisher||Institute of Electrical and Electronics Engineers|
|Number of pages||8|
|Publication status||Published - 2000|
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).  Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TIME.2000.856590