• Information Technology
  • Human Resources
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
My UCalgary
Webmail
D2L
ARCHIBUS
IRISS
  • Faculty of Arts
  • Cumming School of Medicine
  • Faculty of Environmental Design
  • Faculty of Graduate Studies
  • Haskayne School of Business
  • Faculty of Kinesiology
  • Faculty of Law
  • Faculty of Nursing
  • Faculty of Nursing (Qatar)
  • Schulich School of Engineering
  • Faculty of Science
  • Faculty of Social Work
  • Faculty of Veterinary Medicine
  • Werklund School of Education
  • Information TechnologiesIT
  • Human ResourcesHR
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
  • Libraries and Cultural Resources
View Item 
  •   PRISM Home
  • Science
  • Science Research & Publications
  • View Item
  •   PRISM Home
  • Science
  • Science Research & Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
Author
Bradley, James
Accessioned
2008-02-27T22:57:28Z
Available
2008-02-27T22:57:28Z
Computerscience
1999-05-27
Issued
1984-03-01
Subject
Computer Science
Metadata
Show full item record

Abstract
A 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.
Notes
We 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.ca
Corporate
University of Calgary
Faculty
Science
Doi
http://dx.doi.org/10.5072/PRISM/30455
Uri
http://hdl.handle.net/1880/46272
Collections
  • Science Research & Publications

Browse

All of PRISMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

  • Email
  • SMS
  • 403.220.8895
  • Live Chat

Energize: The Campaign for Eyes High

Privacy Policy
Website feedback

University of Calgary
2500 University Drive NW
Calgary, AB T2N 1N4
CANADA

Copyright © 2017