Towards a theory of movie database queries

Author

Kuijpers, Bart ; Paredaens, Jan ; Gucht, Dirk Van

Author_Institution

Dept. WNI, Univ. of Limburg, Diepenbeek, Belgium

fYear

2000

fDate

2000

Firstpage

95

Lastpage

102

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

Keywords

computability; data models; database theory; query languages; query processing; visual databases; 2D semi-algebraic figure; SQL-like query language; computability; cuts; cutting; data model; movie database query theory; movie editing operations; movie frame; pasting; scene selection; scenes; topological frame transformation; Computer science; Data models; Database languages; Layout; Motion pictures; Polynomials; Solid modeling; Spatial databases; Terminology;

fLanguage

English

Publisher

ieee

Conference_Titel

Temporal Representation and Reasoning, 2000. TIME 2000. Proceedings. Seventh International Workshop on

Conference_Location

Cape Breton, NS

Print_ISBN

0-7695-0756-5

Type

conf

DOI

10.1109/TIME.2000.856590

Filename

856590