#### DMCA

## ILOG: Declarative Creation and Manipulation of Object Identifiers (1991)

Citations: | 106 - 1 self |

### Citations

1829 | The entity-relationship model-toward a unified view of data
- Chen
- 1976
(Show Context)
Citation Context ...d context. This paper uses a particular simple, representative semantic database model, called IFO-. This model can be viewed as a subset of IF0 [AH871 or GSM [HK87], or as a generalization of the ER =-=[Che76]-=- or Functional Data [ShiSl] models. In particular, it supports abstract and value object sets (or entity sets), single and multi-valued attributes (also known as data functions), aggregation (i.e., tu... |

1436 | Smalltalk-80, The Language and its Implementation.
- Goldberg, Robson
- 1983
(Show Context)
Citation Context ...defining derived data. The ILOG syntax “hides” the Skolem functors from the user, thus bringing ILOG closer to some other, existing mechanisms for OID manipulation in the literature (e.g., Smalltalk- =-=[GR83]-=-, OODAPLEX, OOAlgebra). Although not. explored in this paper, it appears that the Skolem-functor based semantics of ILOG can be used to provide a natural and rigorous basis for update prop agation and... |

1185 | Principles of Database and Knowledgebase Systems - Ullman - 1989 |

682 | Towards a theory of declarative knowledge. In - Apt, Blair, et al. - 1988 |

587 | The complexity of relational query languages - Vardi - 1982 |

195 | A federated architecture for information management
- Heimbigner, McLeod
- 1985
(Show Context)
Citation Context ...tion methodology presented in [BM81, Mot87], and nonrecursive ILOG with stratified negation (nrecILOG’) subsumes the cores of the OOAlgebra and the translation languages of the Federated architecture =-=[HM85]-=- and the integration methodology of [DH84]. It is also shown that weakly recursive ILOG (wrecILOG(‘)) has the same data complexity as datalogt’) (and thus lies between NLOGSPACE and PTIME). The sevent... |

166 | Datalog extensions for database queries and updates, - Abiteboul, Vianu - 1991 |

165 |
View definition and generalization for database integration in a Multidatabase system
- Dayal, Hwang
- 1984
(Show Context)
Citation Context ...], and nonrecursive ILOG with stratified negation (nrecILOG’) subsumes the cores of the OOAlgebra and the translation languages of the Federated architecture [HM85] and the integration methodology of =-=[DH84]-=-. It is also shown that weakly recursive ILOG (wrecILOG(‘)) has the same data complexity as datalogt’) (and thus lies between NLOGSPACE and PTIME). The seventh ILOG variant is ILOG*, a practically mot... |

150 |
Testing containment of conjunctive queries under functional and inclusion dependencies
- Johnson, Klug
- 1984
(Show Context)
Citation Context ...owever, if we restrict attemion t,o nrecILOG programs whose source and target are (relational simulations of) IFO- schemas. In particular, by generalizing tableaux chasing techniques and results from =-=[JK84]-=- we have: Theorem 8.3: It is decidable, given an nrecILOG program P from IFO- source S to IFO- target T, whether P(1) is an instance of T for each instance I of S. Furthermore, this result continues t... |

139 | Negation as failure using tight derivations for general logic programs. - Gelder - 1988 |

125 | Computable queries for relational data bases. - Chandra, Harel - 1980 |

124 | AND SILBERSCHATZ,A. Extended algebra and calculus for nested relational databases - ROTH, KORTH - 1988 |

98 | Inclusion dependencies and their interaction with functional dependencies
- Casanova, Fagin, et al.
- 1984
(Show Context)
Citation Context ...ify this approach in Section 4 below.) A functional dependency (FD) is a syntactic expression of the form R : X - Y, where R is a relation name and X, Y c {I,..., a(R)}. An inclusion dependency (IND) =-=[CFP84]-=- is a syntactic expression of the form R[X] C R’[Y], where R and R’ are relation names, X is a non-repeating sequence over (1,. . . ,cr(R)}, and Y is a non-repeating sequence over (1,. . . ,cu(R’)}. W... |

98 | Foundations of Logic Programming second edition - Lloyd - 1987 |

97 |
A Logic for Objects
- Maier
- 1986
(Show Context)
Citation Context ...database issues. A key difference, however, is the semantics used for OID creat.ion: IQL uses a variation of the invention rules of detDL [AV88a, A\‘88b], while ILOG uses the observation 455of Maier =-=[Mai86]-=-, refined in [IiW89, CW89], that OID creation can be simulated by associating Skolem functors with datalog rules. (A specific theoret.ical difference between languages resulting from the two approache... |

87 |
COL: A logic-based language for complex objects.
- Abiteboul, Grumbach
- 1988
(Show Context)
Citation Context ...h any object-based model for which there is a natural simulation by the relational model. A natural extension of ILOG could be made to provide mechanisms for creating and manipulating sets, as in COL =-=[AG88]-=-, 456(8) sounx sckm8 (b) Augmentation with &rived data Figure 1: Example sclleinas LDL [NT89], IQL, or the langauge of [Abi89]. As shown in Exapmle 7.5, the inclusion of a “grouping” construct (which... |

75 | Non first normal form relations: An algebra allowing data restructuring - ABITEBOUL, BIDOIT - 1986 |

68 | Procedural and declarative database update languages. - Abiteboul, Vianu - 1988 |

60 | A Logic for Object-Oriented Logic Programming (Maier's 0logic Revisited - Kifer, Wu |

59 | Towards a deductive object-oriented database language
- Abiteboul
- 1990
(Show Context)
Citation Context ... made to provide mechanisms for creating and manipulating sets, as in COL [AG88], 456(8) sounx sckm8 (b) Augmentation with &rived data Figure 1: Example sclleinas LDL [NT89], IQL, or the langauge of =-=[Abi89]-=-. As shown in Exapmle 7.5, the inclusion of a “grouping” construct (which is present in IQL) into ILOG’ wanld yield a strictly more powerful language, even if the source and target schemas do not incl... |

57 |
C-logic for Complex Objects
- Chen, Warren
- 1989
(Show Context)
Citation Context ...arks concerning the formal semantics of ILOG. A fundamental influence on the development of ILOG is found in the so-called “alphabet logics”: O-logic [Mai86], ‘O-logic-revisited’ [I<W89], and C-logic =-=[CW89]-=-. In particular, the premise that OIDs are essentially terms built using Skolem functors appears to have initially surfaced in these papers. (The more basic intuition that objects are naturally create... |

54 | A New Approach to Database Logic - Kuper, Vardi - 1988 |

37 | Compiling Complex database transition triggers - Cohen - 1989 |

37 | The implication problem for functional and inclusion dependencies - Mitchell - 1983 |

31 |
Determining view dependencies using tableaux.
- Klug, Price
- 1982
(Show Context)
Citation Context ...with respect to IFO- schemas as source and target is undecidable. We turn now to decidability results for nrecILOG programs. The first result uses the Normal Form proposition to generalize results of =-=[KP82]-=-. Theorem 8.2: The FD-FD implication problem is decidable for nrecILOG (possibly with ‘#‘). The complexity of this problem is at least PSPACE, and is bounded above by EXPTIME. Because of the close rel... |

29 | Calculating constraints on relational expressions. - Klug - 1980 |

23 |
A transaction language complete for database update and specification
- Abiteboul, Vianu
- 1987
(Show Context)
Citation Context ...ion of stratification [ABW86, vG86], and the semantics associated with stratified datalog’ programs. For a datalog program P, sch(P) denotes the set of relation names occurring in P. In the spirit of =-=[AV87]-=- we consider datalog programs in connection with source and target relations. Specifically, a datalog program with source S and target T is a triple (P, S, T) where (a) P is a datalog program, (b) S a... |

19 |
Mapping a semantic database model to the relational model
- LYNGBAEK, VIANU
- 1987
(Show Context)
Citation Context ...f they are present: and disjointness dependencies are included to ensure the separation of sets assigned to abstract types. (This is similar t.o the relational simulation of IRIS schemas described in =-=[LV87]-=-.) In this context of relational simulations of object-based schemas, we again define non-standard notions of preinstance and instance for (constrained) relational schemas. We again use the disjoint s... |

16 | Relative information capacity of simple relational schemata - Hull - 1986 |

16 | Four views of complex objects: A sophisticate’s introduction - Hull - 1989 |

15 | The Functional Model and the Data Language Daplex - Shipman - 1981 |

10 | Programming by specification and annotation - Cohen - 1986 |

9 |
Distributed Information Sharing Using WorldBase
- Widjojo, Hull, et al.
- 1989
(Show Context)
Citation Context ...evelopment and prototype implementation of another ILOG variant, called ILOG” [HWWSO]. This practically motivated language will be used in connection with a larger project supporting database sharing =-=[WHW89]-=-. 463For the purposes of this paper, we view ILOG* as nrecILOG augmented wit,h t,he ability t,o use t,he full relational calculus on source inst,ances. (ILOG* as described in [HWWSO] is actually stro... |

3 |
A Type System for Algebraic Database Programming Languages
- Jacobs
- 1989
(Show Context)
Citation Context ...el does not permit sets as1 “first-class citizens”, and has a natural simulat.ion in the relational model. Additionally, as with logic programming and datalog, ILOG uses (in the terminology of, e.g., =-=[Jac89]-=-) d escriptitte typing: the typing is not implicit to the language, but a type-checking inference mechanism based on the source and target schema-s can be established. This contrasts with IQL, OODAPLE... |

2 |
A specificational approach to database transformation
- Hull, Widjojo, et al.
- 1990
(Show Context)
Citation Context ...atified ILOG’; give a semantics of ILOG using Skolem functors essentially in the spirit of O-logic, as refined by ‘O-logic revisited’ and C-logic; and at the end of the section briefly introduce ILOG*=-=[HWWSO]-=-, an implemented variant of ILOG. 5.1 ILOG’: syntax In this section, we first give the syntax of ILOG’; this sub sumes the syntax of all the languages of our interest. Then, we will give the subclasse... |

2 |
IDLOG: Extending the expressive power of deductive database languages
- Sheng
- 1990
(Show Context)
Citation Context ...the following sets: (a) {YES, NO}; (b) instances in which no OIDs occur; (c) instances in which no values occur. (Another recent logic-based langauge which can express all computable queries is IDLOG =-=[SheSO]-=-. This language does not involve OIDs, but the presence of integers and addition enables the “creation” of an arbitrary amount of “work-space”.) It was recently shown that in the absence of copyremova... |