PERFORMANCE IMPLICATIONS OF USING HIGHER ORDER INVERSION STRUCTURES FOR REDUCTION OF NATURAL QUANTIFIER EXPRESSIONS

Simple item page
dc.contributor.authorBradley, Jameseng
dc.date.accessioned2008-02-27T22:57:28Z
dc.date.available2008-02-27T22:57:28Z
dc.date.computerscience1999-05-27eng
dc.date.issued1984-03-01eng
dc.description.abstractA series of storage-level inversions is presented. A record of a first order inversion contains what has been termed a one-level dendrite, a record of a second order inversion contains two-level dendrites, and so on. A dendrite is a special hierarchy type employing record keys. The well-known file inversion turns out to be the first order inversion in the series, and a second order inversion becomes an inversion of an owner-coupled set. A third order inversion becomes the inversion of a pair of owner-coupled sets, and a fourth order inversion the inversion of an owner-coupled set triplet, and so on. A first order inversion on a given field is contained by the second order inversion on that field, and this second order inversion is in turn contained by the third order inversion on that field, and so on. Extensive tests of the performance implications of particularly owner-coupled set inversions are described. It is demonstrated that in most cases, algorithms using higher order inversions at the storage level can perform complex retrievals with only a few disk accesses. It is suggested that the updating and storage costs associated with higher order inversions will in many cases be acceptable. All the owner-coupled sets dealt with are implicit owner-coupled sets, which are applicable to relational data bases.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1984-147-5eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30455
dc.identifier.urihttp://hdl.handle.net/1880/46272
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titlePERFORMANCE IMPLICATIONS OF USING HIGHER ORDER INVERSION STRUCTURES FOR REDUCTION OF NATURAL QUANTIFIER EXPRESSIONSeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications