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 "emptyheaded boolean algebra based graph processing"):
  Abstract: We present a graph pattern engine, EmptyHeaded, that uses recent algorithmic advances in join processing to compile patterns into Boolean algebra operations that exploit SIMD parallelism. The EmptyHeaded engine demonstrates that treating graph patterns as a general join processing problem can compete with and often outperform both specialized approaches and existing OLAP systems on graph queries. The core Boolean algebra operation performed in EmptyHeaded is set intersection. Extracting SIMD parallelism during set intersections on graph data is challenging because graph data can be skewed in several dierent ways. Our contributions are a demonstration of this new type of engine with Boolean algebra at its core, an exploration of set intersection representations and algorithms for set intersections that are optimized for skew. We demonstrate that EmptyHeaded outperforms specialized graph engines by over an order of magnitude and relational systems by over two orders of magnitude. Our results suggest that this new style of engine is a promising new direction for future graph engines and accelerators.

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 "snap a general purpose network analysis and graph mining library":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptive low level storage of very large knowledge graphs")
  Member "simd compression and the intersection of sorted integers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "permute to train a new dimension to training deep neural networks")
  Member "eagr supporting continuous ego centric aggregate queries over large dynamic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "skew strikes back new developments in the theory of join algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fast join project query evaluation using matrix multiplication")
  Member "communication steps for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "leapfrog triejoin a worst case optimal join algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast join project query evaluation using matrix multiplication")
  Member "decoding billions of integers per second through vectorization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "permute to train a new dimension to training deep neural networks")

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)