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 "design principles for scaling multi core oltp under high contention"):
  Abstract: Although significant recent progress has been made in improving the multi-core scalability of high throughput transactional database systems, modern systems still fail to achieve scalable throughput for workloads involving frequent access to highly contended data. Most of this inability to achieve high throughput is explained by the fundamental constraints involved in guaranteeing ACID --- the addition of cores results in more concurrent transactions accessing the same contended data for which access must be serialized in order to guarantee isolation. Thus, linear scalability for contended workloads is impossible. However, there exist flaws in many modern architectures that exacerbate their poor scalability, and result in throughput that is much worse than fundamentally required by the workload. #R##N#In this paper we identify two prevalent design principles that limit the multi-core scalability of many (but not all) transactional database systems on contended workloads: the multi-purpose nature of execution threads in these systems, and the lack of advanced planning of data access. We demonstrate the deleterious results of these design principles by implementing a prototype system, ORTHRUS, that is motivated by the principles of separation of database component functionality and advanced planning of transactions. We find that these two principles alone result in significantly improved scalability on high-contention workloads, and an order of magnitude increase in throughput for a non-trivial subset of these contended workloads.

Includes members:
  Member "the homeostasis protocol avoiding transaction coordination through program analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a comprehensive evaluation of rdma enabled concurrency control protocols")
  Member "rethinking serializable multiversion concurrency control":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a fault tolerance shim for serverless computing")
  Member "automatic partitioning of database applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scheduling oltp transactions via machine learning")
  Member "oltp on hardware islands":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards concurrent stateful stream processing on multicore processors technical report")
  Member "high performance concurrency control mechanisms for main memory databases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "livegraph a transactional graph storage system with purely sequential adjacency list scans")
  Member "flat combining and the synchronization parallelism tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using skip graphs for increased numa locality")

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)