By Topic

Automatic composition of data structures to represent relations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cohen, D. ; USC/Inform. Sci. Inst., Marina del Rey, CA, USA ; Campbell, N.

The authors describe a very general class of composite data structures, and a language in which programmers can describe which to use for each purpose. These data structures are composed of primitive data structures drawn from a relatively small library that can be extended by the programmer. They describe the semantics of composite data structures in terms of a relational model. Programmers can use relational programming languages to express computations, independent of data representation decisions, and then use the data structure language to specify representations for the relations in their programs. A compiler is described that translates operations on relations represented by composite data structures. It uses a cost model to choose among alternative algorithms

Published in:

Knowledge-Based Software Engineering Conference, 1992., Proceedings of the Seventh

Date of Conference:

20-23 Sep 1992