| Divesh Srivastava, Raghu Ramakrishnan, and Peter Z. Revesz. Constraint objects. In Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming (PPCP'94), number 874 in LNCS, pages 218--228. Springer Verlag, 1994. |
....there is little research work on finding semantic foundations for representing and querying video information. This paper is a contribution in this direction. The framework presented here integrates formalisms developed in constraint, object and sequence databases. The paper builds on the works of [32, 34, 23, 1, 30, 37, 8, 31, 18] to propose a hybrid data model for video data and a declarative, rule based, constraint query language, that has a clear declarative and operational semantics. We make the following contributions: 1. We develop a simple video data model on the basis of relation, object and constraint paradigms. ....
.... , and , but no set functions such as [ and . Note that the constraint c 2 e X is a derived form since it can be rewritten as fcg e X . Satisfaction and entailment of conjunctions of set order constraints can be solved in polynomialtime using a quantifier elimination algorithm given in [37]. This class of constraints play an important role in declaratively constraining query answers. Definition 4 (Time Intervals) An interval i is considered as an ordered pair of real numbers (x 1 ; x 2 ) x 1 x 2 . This definition refers to the predicate of the concrete domain IR. If t is a time ....
[Article contains additional citation context not shown here]
Divesh Srivastava, Raghu Ramakrishnan, and Peter Z. Revesz. Constraint objects. In Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming (PPCP'94), number 874 in LNCS, pages 218--228. Springer Verlag, 1994.
....Considered from this point of view, the main extensions of CDBS compared to CLP are persistence and the possibility to share data between different applications. In this thesis we consider flat CDBSs as discussed e.g. in [KKR90, GS94, PvdBvG94] In contrast to object oriented CDBSs, see e.g. SRR94, BK95] in which constraints are first order objects, in flat CDBSs a constraint tuple is viewed as a conjunction of constraints. However most of the techniques developed in the following chapters, in particular constraint lifting, are adaptable to object oriented constraint database systems. ....
Divesh Srivastava, Raghu Ramakrishnan, and Peter Z. Revesz. Constraint objects. In PPCP94 [PPC94].
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC