human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "associative array model of sql nosql and newsql databases"):
  Abstract: The success of SQL, NoSQL, and NewSQL databases is a reflection of their ability to provide significant functionality and performance benefits for specific domains, such as financial transactions, internet search, and data analysis. The BigDAWG polystore seeks to provide a mechanism to allow applications to transparently achieve the benefits of diverse databases while insulating applications from the details of these databases. Associative arrays provide a common approach to the mathematics found in different databases: sets (SQL), graphs (NoSQL), and matrices (NewSQL). This work presents the SQL relational model in terms of associative arrays and identifies the key mathematical properties that are preserved within SQL. These properties include associativity, commutativity, distributivity, identities, annihilators, and inverses. Performance measurements on distributivity and associativity show the impact these properties can have on associative array operations. These results demonstrate that associative arrays could provide a mathematical model for polystores to optimize the exchange of data and execution queries.

Includes members:
  Member "graphulo implementation of server side sparse matrix multiply in the accumulo database":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "streaming 1 9 billion hypersparse network updates per second with d4m")
  Member "d4m bringing associative arrays to database engines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ai enabling technologies a survey")
  Member "achieving 100 000 000 database inserts per second using accumulo and d4m":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "75 000 000 000 streaming inserts second using hierarchical hypersparse graphblas matrices")
  Member "d4m 2 0 schema a general purpose high performance schema for the accumulo database":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "securing hpc using federated authentication")
  Member "standards for graph algorithm primitives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")
  Member "relational semantics for databases and predicate calculus":
    also connected through other hyperedges:
      (none)
  Member "set theoretic preliminaries for computer scientists":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "integrating interval constraints into logic programming")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DB(Databases)