On-the-Fly Optimization of Data Structures.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 5221791 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On-the-Fly Optimization of Data Structures. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Kessels%2C+J%2E+L%2E+W%2E%22">Kessels, J. L. W.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Horowitz%2C+Ellis%22">Horowitz, Ellis</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Nov83, Vol. 26 Issue 11, p895-901. 7p. 4 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+file+management%22">Electronic file management</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5221791 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/182.358442 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 7 StartPage: 895 Subjects: – SubjectFull: Data structures Type: general – SubjectFull: Electronic data processing Type: general – SubjectFull: Computer programming Type: general – SubjectFull: Electronic file management Type: general – SubjectFull: Mathematical optimization Type: general – SubjectFull: Mathematical analysis Type: general Titles: – TitleFull: On-the-Fly Optimization of Data Structures. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Kessels, J. L. W. – PersonEntity: Name: NameFull: Horowitz, Ellis IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov83 Type: published Y: 1983 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 26 – Type: issue Value: 11 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
