Title
Selector table indexing & sparse arrays
Abstract
Selector table indexing is a simple technique formethod lookup in object-oriented languages, whichyields good performance, is well suited to multipleinheritance and dynamic typing, but is generallydisregarded for its prohibitive memory consumption.The large memory footprint is caused by keeping atable of methods, indexed by a selectorcode, for eachclass in the system. These tables are sparsely filled. Asparse array implementation is presented, whichreduces the memory consumption by an...
Year
DOI
Venue
1993
10.1145/167962.165902
Conference on Object-Oriented Programming Systems, Languages, and Applications
Keywords
Field
DocType
selector table indexing,sparse array,object oriented language,indexation,dynamic typing
Sparse array,Computer science,Search engine indexing,Theoretical computer science,Inline caching,Memory footprint,Multiple inheritance
Conference
Volume
Issue
ISSN
28
10
0362-1340
ISBN
Citations 
PageRank 
0-89791-587-9
28
1.92
References 
Authors
4
1
Name
Order
Citations
PageRank
Karel Driesen120516.32