Skip navigation
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJarke, Matthias-
dc.contributor.authorKoch, Jurgen-
dc.contributor.authorSchmidt, Joachim W.-
dc.date.accessioned2006-03-02T14:57:52Z-
dc.date.available2006-03-02T14:57:52Z-
dc.date.issued1984-03-
dc.identifier.urihttp://hdl.handle.net/2451/14563-
dc.description.abstractQuery processing in databases can be divided into two steps: selecting an 'optimal' evaluation strategy, and executing it. We first present elementary nested loop and relational algebra algorithms for query execution and point out some opportunities for improving their performance. A survey of optimization strategies, structured in query transformation techniques and access planning methods, follows. Finally, extensions for special-purpose query systems are briefly addressed.en
dc.format.extent5919538 bytes-
dc.format.mimetypeapplication/pdf-
dc.languageEnglishEN
dc.language.isoen_US-
dc.publisherStern School of Business, New York Universityen
dc.relation.ispartofseriesIS-84-48-
dc.titleINTRODUCTION TO QUERY PROCESSINGen
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-48.pdf5.78 MBAdobe PDFView/Open


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