Analysis and performance of inverted data base structures
Communications of the ACM
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
| Hi-index | 0.00 |
This paper presents an efficient access path storage and manipulation facility in a relational database management system. It includes an access path storage structure and an artificial intelligence which enables the DBMS to generate, store, and maintain paths which are more likely to be needed by random query requests. A model is developed for simulation, and several path delete strategies are simulated. Path delete strategies aiming for least recently used and least frequently used access paths are shown to require minimal DBA interference and to result in lowest average query processing cost. The proposed path handling strategy is sufficiently general to permit application in an arbitrary database system.