Jan Chomicki. E#cient Checking of Temporal Integrity Constraints Using Bounded History Encoding. ACM Transactions on Database Systems, 20(2):149--186, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....examine new formalism for expressing integrity constraints that are temporal by nature. Like in the non temporal case, we can roughly distinguish between two approaches. Under one approach, integrity constraints are expressed as essentially arbitrary sentences in some temporal logic #Arapis 1991; Chomicki 1995; Chomicki and Niwi#nski 1995; Lipeck and Saake 1987#. An alternative approach examines restricted classes of temporal integrity constraints, whichmay be called temporal dependencies #Wang et al. 1997#. The latter approach is followed in this paper. In particular, we are going to examine an ....

....Representing a temporal relation as a sequence of snapshots has the advantage that it often considerably simpli#es the notations in a technical treatment, while it does not a#ect the generality of the results. Such representation is not uncommon in theoretical work #see for example #Vianu 1987; Chomicki 1995##. Fourth, object identity provides some additional capabilities which will be discussed later on, such as the usage of path expressions #Weddell 1992# and the encoding of cyclicity. Surrogates, which are similar to OIDs, have also been used in temporal database design #Jensen and Snodgrass ....

[Article contains additional citation context not shown here]

Chomicki, J. 1995. E#cientchecking of temporal integrity constraints using bounded history encoding. ACM Trans. on Database Systems 20, 2 #June#, 148#186.

....data stream. Similar to data expiration, the approaches try to be selective in remembering only the necessary parts of the data stream (called synopses) in a limited space. For example, recent results on streaming queries [5] parallel results on enforcement of temporal integrity constraints [10,12], a special case of data expiration (cf. Section 4.1 in this chapter) The chapter is organized as follows. Section 2 defines a general framework for data expiration. Section 3 reviews policy based approaches to data expiration. Section 4 outlines two principal approaches to query driven ....

....active data domain, DH , the length of the history, TH , and . the size of the query, Q . An expiration method provides a bounded encoding of a history if E(H) does not depend on the length of the history (more precisely, E(H) is bounded by a function constant with respect to TH ) [10]. The expiration operators E and E compress introduced in Section 2.2 are not bounded while the operator The open world assumption, however, is only assumed for the extensions of the history; the individual databases that describe states in the current history are still considered to ....

[Article contains additional citation context not shown here]

Jan Chomicki. E#cient Checking of Temporal Integrity Constraints Using Bounded History Encoding. ACM Transactions on Database Systems, 20(2):149--186, 1995.

....well understood mathematical properties [Gabbay et al. 1994] The declarative character of these languages also allows the use of advanced optimization techniques. In addition, temporal logic has been proposed as the language of choice for formulating temporal integrity constraints and triggers [Chomicki 1995; Chomicki and Toman 1995; Gertz and Lipeck 1996; Lipeck and Saake 1987; Sistla and Wolfson 1995] as it admits spacee #cient methods for enforcing these constraints. While temporal logic may seem to be a natural choice for a temporal query language, its semantics is defined with respect to ....

Chomicki, J. 1995. E#cient Checking of Temporal Integrity Constraints Using Bounded History Encoding. ACM Transactions on Database Systems 20, 2 (June), 149--186.

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