Skip navigation
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJarke, Matthias-
dc.date.accessioned2006-03-02T14:52:41Z-
dc.date.available2006-03-02T14:52:41Z-
dc.date.issued1984-01-
dc.identifier.urihttp://hdl.handle.net/2451/14561-
dc.description.abstractThe simultaneous optimization of multiple queries submitted to a database system may lead to substantial savings over the current approach of optimizing each query separately. Isolating common subexpressions in multiple queries and treating their execution as a sharable resource are important prerequisites. This chapter presents techniques for recognizing, supporting, and exploiting common subexpressions in record-oriented, relational algebra, domain relational calculus, and tuple relational calculus query representations. It also investigates preconditions that transaction management mechanisms must satisfy to make multiple query optimization effective.en
dc.format.extent4007713 bytes-
dc.format.mimetypeapplication/pdf-
dc.languageEnglishEN
dc.language.isoen_US-
dc.publisherStern School of Business, New York Universityen
dc.relation.ispartofseriesIS-84-46-
dc.titleCOMMON SUBEXPRESSION ISOLATION IN MULTIPLE QUERY OPTIMIZATIONen
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-84-46.pdf3.91 MBAdobe PDFView/Open


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