The Strength of SuRF.
An introduction is presented in which the author discusses an article published in the journal about the trie-based structure known as Succinct Range Filter (SuRF).
| Publicado en: | Communications of the ACM Vol. 64; no. 4; pp. 165 - 166 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Apr2021
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=149459815&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 149459815 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Apr2021 vid: 64 iid: 4 pid: 68 pub: Association for Computing Machinery artinfo: ui: 149459815 10.1145/3450261 ppf: 165 ppct: 1 formats: tig: atl: The Strength of SuRF. aug: au: Idreos, Stratos affil: Associate professor of computer science at the Harvard John A. Paulson School of Engineering and Applied Science su: Query languages (Computer science) Computer architecture sug: subj: Query languages (Computer science) Computer architecture ab: An introduction is presented in which the author discusses an article published in the journal about the trie-based structure known as Succinct Range Filter (SuRF). pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2021 holdings: @attributes: islocal: N |
|---|