Scalable Linear Algebra on a Relational Database System.

As data analytics has become an important application for modern data management systems, a new category of data management system has appeared recently: the scalable linear algebra system. We argue that a parallel or distributed database system is actually an excellent platform upon which to build...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 63; no. 8; pp. 93 - 102
Autores principales: Shangyu Luo, Gao, Zekai J., Gubanov, Michael, Perez, Luis L., Jankov, Dimitrije, Jermaine, Christopher
Formato: Artículo
Publicado: Association for Computing Machinery Aug2020
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=144741222&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 144741222
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Aug2020
      vid: 63
      iid: 8
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        144741222
        10.1145/3405470
      ppf: 93
      ppct: 9
      formats:
      tig:
        atl: Scalable Linear Algebra on a Relational Database System.
      aug:
        au:
          Shangyu Luo
          Gao, Zekai J.
          Gubanov, Michael
          Perez, Luis L.
          Jankov, Dimitrije
          Jermaine, Christopher
        affil: Florida State University, Tallahassee, FL, USA
      su:
        Linear algebra
        Scalability
        Relational databases
        Data management
        Program transformation
      sug:
        subj:
          Linear algebra
          Scalability
          Relational databases
          Data management
          Program transformation
      ab: As data analytics has become an important application for modern data management systems, a new category of data management system has appeared recently: the scalable linear algebra system. We argue that a parallel or distributed database system is actually an excellent platform upon which to build such functionality. Most relational systems already have support for cost-based optimization--which is vital to scaling linear algebra computations--and it is well known how to make relational systems scalable. We show that by making just a few changes to a parallel/distributed relational database system, such a system can become a competitive platform for scalable linear algebra. Taken together, our results should at least raise the possibility that brand new systems designed from the ground up to support scalable linear algebra are not absolutely necessary, and that such systems could instead be built on top of existing relational technology.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2020
    holdings:
      @attributes:
        islocal: N