human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "tigergraph a native mpp graph database"
  Abstract: We present TigerGraph, a graph database system built from the ground up to support massively parallel computation of queries and analytics. #R##N#TigerGraph's high-level query language, GSQL, is designed for compatibility with SQL, while simultaneously allowing NoSQL programmers to continue thinking in Bulk-Synchronous Processing (BSP) terms and reap the benefits of high-level specification. #R##N#GSQL is sufficiently high-level to allow declarative SQL-style programming, yet sufficiently expressive to concisely specify the sophisticated iterative algorithms required by modern graph analytics and traditionally coded in general-purpose programming languages like C++ and Java. #R##N#We report very strong scale-up and scale-out performance over a benchmark we published on GitHub for full reproducibility.

Connected through hyperedge HE-1 (induced by source paper "livegraph a transactional graph storage system with purely sequential adjacency list scans"):
  with members:
    - "in depth benchmarking of graph database systems with the linked data benchmark council ldbc social network benchmark snb"
    - "weaver a high performance transactional graph database based on refinable timestamps"
    - "graph analytics using the vertica relational database"
    - "rethinking serializable multiversion concurrency control"
    - "high performance concurrency control mechanisms for main memory databases"

Connected through hyperedge HE-2 (induced by source paper "in depth benchmarking of graph database systems with the linked data benchmark council ldbc social network benchmark snb"):
  with members:
    - "property graph type system and data definition language"
    - "g core a core for future graph query languages"
    - "graphlab a new framework for parallel machine learning"

Question: Please tell me which class the center node 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)