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 "sharesskew an algorithm to handle skew for joins in mapreduce"):
  Abstract: In this paper, we investigate the problem of computing a multiway join in one round of MapReduce when the data may be skewed. We optimize on communication cost, i.e., the amount of data that is transferred from the mappers to the reducers. We identify join attributes values that appear very frequently, Heavy Hitters (HH). We distribute HH valued records to reducers avoiding skew by using an adaptation of the Shares~\cite{AfUl} algorithm to achieve minimum communication cost. Our algorithm is implemented for experimentation and is offered as open source software. Furthermore, we investigate a class of multiway joins for which a simpler variant of the algorithm can handle skew. We offer closed forms for computing the parameters of the algorithm for chain and symmetric joins.

Includes members:
  Member "worst case optimal algorithms for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "it s all a matter of degree using degree information to optimize multiway joins":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "α k minimal sorting and skew join in mpi and mapreduce":
    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 "gym a multiround join algorithm in mapreduce":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "the family of mapreduce and large scale data processing systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on big data for network traffic monitoring and analysis")
  Member "beyond worst case analysis for joins with minesweeper":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "skew strikes back new developments in the theory of join algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast join project query evaluation using matrix multiplication")

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)