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 "livegraph a transactional graph storage system with purely sequential adjacency list scans"):
  Abstract: The specific characteristics of graph workloads make it hard to design a one-size-fits-all graph storage system. Systems that support transactional updates use data structures with poor data locality, which limits the efficiency of analytical workloads or even simple edge scans. Other systems run graph analytics workloads efficiently, but cannot properly support transactions. #R##N#This paper presents LiveGraph, a graph storage system that outperforms both the best graph transactional systems and the best systems for real-time graph analytics on fresh data. LiveGraph does that by ensuring that adjacency list scans, a key operation in graph workloads, are purely sequential: they never require random accesses even in presence of concurrent transactions. This is achieved by combining a novel graph-aware data structure, the Transactional Edge Log (TEL), together with a concurrency control mechanism that leverages TEL's data layout. Our evaluation shows that LiveGraph significantly outperforms state-of-the-art (graph) database solutions on both transactional and real-time analytical workloads.

Includes members:
  Member "tigergraph a native mpp graph database":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "in depth benchmarking of graph database systems with the linked data benchmark council ldbc social network benchmark snb")
  Member "in depth benchmarking of graph database systems with the linked data benchmark council ldbc social network benchmark snb":
    also connected through other hyperedges:
      (none)
  Member "weaver a high performance transactional graph database based on refinable timestamps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries")
  Member "graph analytics using the vertica relational database":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "experimental analysis of distributed graph systems")
  Member "rethinking serializable multiversion concurrency control":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a fault tolerance shim for serverless computing")
  Member "high performance concurrency control mechanisms for main memory databases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nwr rethinking thomas write rule for omittable write operations")

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)