Please use this identifier to cite or link to this item:
Title: Towards a Theory of Movie Database Queries
Authors: KUIJPERS, Bart 
Paredaens, Jan
Van Gucht, Dirk
Issue Date: 2000
Publisher: IEEE Computer Science Press
Source: 7th International Workshop on Temporal Representation and Reasoning (TIME 2000). p. 95-102.
Abstract: We present a data model for movies and movie databases. A movie is considered to be a 2-dimensional semialgebraic 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 SQLlike query language for movie databases. This query language supports most movie editing operations like cutting, pasting and selection of scenes.
Document URI:
Link to publication:
ISBN: 0-7695-0756-5
ISI #: 000089546800011
Category: C1
Type: Proceedings Paper
Validations: ecoom 2001
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
std5.pdf131.94 kBAdobe PDFView/Open
Show full item record


checked on May 14, 2022

Page view(s)

checked on May 20, 2022


checked on May 20, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.