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 "parallel correctness and transferability for conjunctive queries"):
  Abstract: A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over many servers and then evaluated in a parallel but communication-free way. The reshuffling itself is specified as a distribution policy. We introduce a correctness condition, called parallel-correctness, for the evaluation of queries w.r.t. a distribution policy. We study the complexity of parallel-correctness for conjunctive queries as well as transferability of parallel-correctness between queries. We also investigate the complexity of transferability for certain families of distribution policies, including, for instance, the Hypercube distribution.

Includes members:
  Member "size bounds and query plans for relational joins":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "worst case optimal algorithms for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "parallel correctness and containment for conjunctive queries with union and negation":
    also connected through other hyperedges:
      (none)
  Member "skew in parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "communication steps for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "win move is coordination free sometimes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "putting logic based distributed systems on stable grounds")
  Member "shark sql and rich analytics at scale":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "knowledge graphs")

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)