On Reducing the Set of Feasible Query Trees in Distributed Query Processing Optimization

Simple item page
dc.contributor.authorAUTHOR, UNKNOWNen
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:43Zen
dc.date.available2013-06-19T14:35:43Zen
dc.date.issued1983en
dc.description.abstractNo abstract available.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000888/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000888/01/CS83012-R.pdfen
dc.identifier.trnumberCS83012-Ren
dc.identifier.urihttp://hdl.handle.net/10919/19917en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleOn Reducing the Set of Feasible Query Trees in Distributed Query Processing Optimizationen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS83012-R.pdf
Size:
783.95 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports