Skip navigation
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJarke, Matthias-
dc.contributor.authorLinnemann, Volker-
dc.contributor.authorSchmidt, Joachim W.-
dc.date.accessioned2006-02-28T14:38:15Z-
dc.date.available2006-02-28T14:38:15Z-
dc.date.issued1985-04-
dc.identifier.urihttp://hdl.handle.net/2451/14535-
dc.description.abstractAlthough the goals and means of rule-based and data-based systems are too different to be fully integrated at the present time, it seems appropriate to investigate a closer integration of language constructs and a better cooperation of execution models for both kinds of approaches. In this paper, we propose a new language construct called constructor that – when applied to a base relation – causes relation membership to become true for all tuples constructable through the predicates provided by the constructor definition. The approach is shown to provide expressive power at least equivalent to PROLOG's declarative semantics while blending well both with a strongly typed modular programming language and with a relational calculus query formalism. A three-step compilation, optimization, and evaluation methodology for expressions with constructed relations is described that integrates constructors with the surrounding database programming environment. In particular, many recursive queries can be evaluated more efficiently within the set-construction framework of database systems than with proof-oriented methods typical for a rule-based approach.en
dc.format.extent4106023 bytes-
dc.format.mimetypeapplication/pdf-
dc.languageEnglishEN
dc.language.isoen_US-
dc.publisherStern School of Business, New York Universityen
dc.relation.ispartofseriesIS-85-23-
dc.titleDATA CONSTRUCTORS: ON THE INTEGRATION OF RULES AND RELATIONSen
dc.typeWorking Paperen
dc.description.seriesInformation Systems Working Papers SeriesEN
Appears in Collections:IOMS: Information Systems Working Papers

Files in This Item:
File Description SizeFormat 
IS-85-23.pdf4.01 MBAdobe PDFView/Open


Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.