Compressed static functions with applications

Autor:	Belazzougui D., Venturini R.
Jazyk:	angličtina
Rok vydání:	2013
Předmět:	DATA STRUCTURES Compressed Data Structures
Zdroj:	24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 229–240, New orleans, Louisiana, USA, 5 gennaio 2013 info:cnr-pdr/source/autori:Belazzougui D.; Venturini R./congresso_nome:24th Annual ACM-SIAM Symposium on Discrete Algorithms/congresso_luogo:New orleans, Louisiana, USA/congresso_data:5 gennaio 2013/anno:2013/pagina_da:229/pagina_a:240/intervallo_pagine:229–240
Popis:	Given a set of integer keys from a bounded universe along with associated data, the dictionary problem asks to answer two queries: membership and retrieval. Membership has to tell whether a given element is in the dictionary or not; Retrieval has to return the data associated with the searched key. In this paper we provide time and space optimal solutions for three well-established relaxations of this basic problem: (Compressed) Static functions, Approximate membership and Relative membership.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9939ac5dc8ed6b38c37e66e856423ee4 https://openportal.isti.cnr.it/doc?id=people______::9939ac5dc8ed6b38c37e66e856423ee4 Zobrazit plný text záznamu