Three Success Stories About Compact Data Structures.
The article explores compact data structures (CDS), which speed up data processing and querying. Particular focus is given to contributions made to CDS by Latin American researchers, notably those at three Chilean universities: the Universidad de Chile, the Universidad Técnica Federico Santa María a...
| Publicado en: | Communications of the ACM Vol. 63; no. 11; pp. 64 - 66 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Nov2020
|
| 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=146617567&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 146617567 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Nov2020 vid: 63 iid: 11 pid: 68 pub: Association for Computing Machinery artinfo: ui: 146617567 10.1145/3416971 ppf: 64 ppct: 2 formats: tig: atl: Three Success Stories About Compact Data Structures. aug: au: ARROYUELO, DIEGO FUENTES-SEPÚLVEDA, JOSÉ SECO, DIEGO affil: Assistant professor at the Universidad Técnica Federico Santa María. Institute for Foundational Research on Data, Santiago, Chile. Assistant professor at the Universidad de Concepción, Chile. Associate professor at the Universidad de Concepción. su: Data modeling Data analysis Information retrieval Universities & colleges Chile Latin America sug: subj: Chile Latin America Data modeling Data analysis Information retrieval Universities & colleges ab: The article explores compact data structures (CDS), which speed up data processing and querying. Particular focus is given to contributions made to CDS by Latin American researchers, notably those at three Chilean universities: the Universidad de Chile, the Universidad Técnica Federico Santa María and the University of Concepción. Also discussed are trees (cardinal, ordinal and binary), map graphs and space-efficient algorithms. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2020 holdings: @attributes: islocal: N |
|---|