Query optimization for nontraditional database applications

Database query languages and their use for programming nontraditional applications, such as engineering and artificial intelligence applications, are discussed. In such environments, database programs are used to code applications that work over large data sets residing in databases. Optimizing such...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1991-01, Vol.17 (1), p.77-86
Main Authors: Sellis, T.K., Shapiro, L.
Format: Article
Language:English
Subjects:
Algorithms
Applications
Applied sciences
Artificial intelligence
Computer science
Computer science
control theory
systems
Data base management systems
Data engineering
Data processing
Database languages
Database systems
Deductive databases
Design
Dynamic programming
Engineering
Exact sciences and technology
Indexes
Information systems. Data bases
Memory organisation. Data processing
Optimization
Optimization algorithms
Optimization techniques
Programming languages
Queries
Query processing
Relational data bases
Relational databases
Software
Studies
Techniques
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Database query languages and their use for programming nontraditional applications, such as engineering and artificial intelligence applications, are discussed. In such environments, database programs are used to code applications that work over large data sets residing in databases. Optimizing such programs then becomes a necessity. An examination is made of various optimization techniques, and transformations are suggested for improving the performance of database programs. These transformations result in new equivalent database programs with better space and time performance. Several of these techniques apply to classical query languages, although extended query languages which include an iteration operator are specifically discussed.< >
ISSN:0098-5589
1939-3520
DOI:10.1109/32.67580