Towards a theory of movie database queries

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

doi:10.1109/TIME.2000.856590

Towards a theory of movie database queries

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

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 language	English
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
Pages	95-102
Number of pages	8
ISBN (Print)	0-7695-0756-5
DOIs	https://doi.org/10.1109/TIME.2000.856590
Publication status	Published - 2000

Access to Document

10.1109/TIME.2000.856590

Cite this

@inproceedings{0dc57c2a649b49978505557bed0cca61,

title = "Towards a theory of movie database queries",

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.",

author = "B. Kuijpers and J. Paredaens and \{Van Gucht\}, D.",

year = "2000",

doi = "10.1109/TIME.2000.856590",

language = "English",

isbn = "0-7695-0756-5",

pages = "95--102",

booktitle = "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",

address = "United States",

}

Towards a theory of movie database queries. / Kuijpers, B.; Paredaens, J.; Van Gucht, D.
Proceedings 7th International Symposium on Temporal Representation and Reasoning (TIME 2000, Cape Breton NS, USA, July 7-9, 2000). Institute of Electrical and Electronics Engineers, 2000. p. 95-102 856590.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Towards a theory of movie database queries

AU - Kuijpers, B.

AU - Paredaens, J.

AU - Van Gucht, D.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

U2 - 10.1109/TIME.2000.856590

DO - 10.1109/TIME.2000.856590

M3 - Conference contribution

SN - 0-7695-0756-5

SP - 95

EP - 102

BT - Proceedings 7th International Symposium on Temporal Representation and Reasoning (TIME 2000, Cape Breton NS, USA, July 7-9, 2000)

PB - Institute of Electrical and Electronics Engineers

ER -

Towards a theory of movie database queries

Abstract

Access to Document

Fingerprint

Cite this