Space-Efficient Hot Spot Estimation
| dc.contributor.author | Salem, Ken | en_US |
| dc.date.accessioned | 2004-05-31T22:23:46Z | |
| dc.date.available | 2004-05-31T22:23:46Z | |
| dc.date.created | 1993-08 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | This paper is concerned with the problem of identifying names which occur frequently in an ordered list of names. Such names are called hot spots. Hot spots can be identified easily by counting the occurrences of each name and then selecting those with large counts. However, this simple solution requires space proportional to the number of names that occur in the list. In this paper, we present and evaluate two hot spot estimation techniques. These techniques guess the frequently occurring names, while using less space than the simple solution. We have implemented and tested both techniques using several types of input traces. Our experiments show that very accurate guesses can be made using much less space than the simple solution would require. (Also cross-referenced as UMIACS-TR-93-74) | en_US |
| dc.format.extent | 301699 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/593 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3115 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-93-74 | en_US |
| dc.title | Space-Efficient Hot Spot Estimation | en_US |
| dc.type | Technical Report | en_US |