Bibliographic Details
| Title: |
On-the-Fly Optimization of Data Structures. |
| Authors: |
Kessels, J. L. W.1, Horowitz, Ellis |
| Source: |
Communications of the ACM. Nov83, Vol. 26 Issue 11, p895-901. 7p. 4 Diagrams. |
| Subjects: |
Data structures, Electronic data processing, Computer programming, Electronic file management, Mathematical optimization, Mathematical analysis |
| Abstract: |
A technique is proposed for keeping a graphlike data structure near its optimum form; such global optimization is obtained as the cumulative result of simple local operations. Each operation involves only a small number of neighboring vertices and preserves the consistency of the data structure. The technique is demonstrated by means of two examples: the recording of equivalence classes and the construction of a binary search tree. In the examples the optimizing operations are executed "on the fly" while the data structure is being accessed. Hence optimization of the data structure is obtained as a side effect of its normal use. The derived solutions are comparable in efficiency to known solutions, but they allow concurrent access to the data structure. [ABSTRACT FROM AUTHOR] |
|
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
