Vis enkel innførsel

dc.contributor.authorKhalaila, Ahmad
dc.contributor.authorEliassen, Frank
dc.date.accessioned2006-11-28T07:41:51Z
dc.date.available2006-11-28T07:41:51Z
dc.date.issued1997-04
dc.description.abstractA large class of linear recursive queries compute the bill-of-materials of database relations.This paper presents a novel algorithm that computes the bill-of-materials of its argument's (database) relation. The algorithm uses a special join operation that accumulates the cost of composite parts, without constructing the transitive closure of the argument relation, thus saving time and space. We argue that this algorithm outperforms existent algorithms in the order of the diameter of the graph represented in the argument relation. This is made possible by exploiting knowledge of the level each tuple of the argument relation belongs to. Moreover, this algorithm in contrast to transitive closure based processing, produces data at a very early stage of the processing which renders it suitable for pipelined distributed data processing.en
dc.format.extent249690 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/10037/368
dc.identifier.urnURN:NBN:no-uit_munin_242
dc.language.isoengen
dc.publisherUniversitetet i Tromsøen
dc.publisherUniversity of Tromsøen
dc.relation.ispartofseriesTekniske rapporter / Institutt for informatikk 31(1997)en
dc.rights.accessRightsopenAccess
dc.subjectVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420en
dc.subjectVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550en
dc.titleAn efficient bill-of-materials algorithmen
dc.typeResearch reporten
dc.typeForskningsrapporten


Tilhørende fil(er)

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel