Data warehouses are increasingly storing and managing large scale string data, and dealing with large volume of transactions that update and search string data. Motivated by this context, we initiate the study of self-adjusting data structures for string dictionary operations, that is, data structures that are designed to be efficient on an entire sequence rather than individual string operations. Furthermore, we study this problem in the external memory model where string data is too massive to be stored in internal memory and has to reside in disks; each access to a disk page fetches B items, and the cost of the operations is the number of pages accessed (I/Os).
|Titolo:||Static optimality theorem for external memory string access|
CIRIANI, VALENTINA (Primo)
|Data di pubblicazione:||2002|
|Enti collegati al convegno:||IEEE|
|Digital Object Identifier (DOI):||10.1109/SFCS.2002.1181945|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|