By Topic

Optimized parallel sets for data intensive applications

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
$33 $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)
Eder, K.-H. ; Inst. fur Inf., Klagenfurt Univ., Austria ; Boszormenyi, L.

An extension of a general-purpose programming language (gpPL) is presented. It enables parallelism, persistence and query optimization based on sets. The authors demonstrate that in gpPLs the primitive “set” can be generalised for the needs of database and expert system applications. Side-effect free declarative queries, based on set expressions, can be optimized and executed in parallel. Individual optimization and parallelization are integral parts of the language system and compiler. Very different combinations of persistent or volatile, and parallel or sequential, and optimized or non-optimized implementations are possible. This is eased by the fact that a great part of the implementation is located outside the compiler with the help of predefined interfaces. Different algebras, optimizers or algorithms can be considered. The same program can be executed without modification in various systems or platforms

Published in:

Database and Expert Systems Applications, 1996. Proceedings., Seventh International Workshop on

Date of Conference:

9-10 Sep 1996