Abstract
An adaptive approach which utilizes the information embedded in indexes to identify the tuples satisfying a given predicate or having a match in a join operation is proposed. An access path (index or table scan) and a join method (index join, nested loop, sort-merge) are chosen to construct the results adaptively. This leads to the optimal evaluation of queries. With an efficient implementation, the adaptive decision process becomes a part of a query evaluation procedure, so that the overhead of the approach is minimized.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE Computer Society's International Computer Software & Applications Conference |
| Editors | George J. Knafl |
| Publisher | Publ by IEEE |
| Pages | 250-256 |
| Number of pages | 7 |
| State | Published - 1989 |
| Externally published | Yes |
| Event | Proceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89 - Orlando, FL, USA Duration: Sep 20 1989 → Sep 22 1989 |
Other
| Other | Proceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89 |
|---|---|
| City | Orlando, FL, USA |
| Period | 9/20/89 → 9/22/89 |
ASJC Scopus subject areas
- Engineering(all)
- Software