Show simple item record

dc.contributor.authorPolat, F.en_US
dc.contributor.authorAlhajj, R.en_US
dc.description.abstractIn this paper, we have benefited from having an object algebra maintaining closure that makes it possible to have the output from a query persistent in the hierarchy. Based on this, it is possible to maximize reusability in object-oriented databases. Furthermore, we show how the object algebra is utilized to handle basic schema evolution functions without requiring any special set of built-in functions to serve the purpose. The invariants and the conflict resolving rules are specified. It is also shown how other schema functions are derivable from the basic ones.en_US
dc.source.titleAmerican Society of Mechanical Engineers, Petroleum Division (Publication) PDen_US
dc.subjectData processingen_US
dc.subjectDatabase systemsen_US
dc.subjectHierarchical systemsen_US
dc.subjectObject oriented programmingen_US
dc.subjectQuery languagesen_US
dc.subjectConflict resolutionen_US
dc.subjectObject oriented databasesen_US
dc.subjectObject oriented query modelen_US
dc.subjectSchema evolutionen_US
dc.subjectData structuresen_US
dc.titleReusability and schema evolution in object - oriented query modelsen_US
dc.typeConference Paperen_US
dc.publisherASME, New York, NY, United Statesen_US

Files in this item


This item appears in the following Collection(s)

  • Work in Progress 372
    Check/configure data processing but have no pending metadata

Show simple item record