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 "optimal joins using compact data structures"):
  Abstract: Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now count with several different algorithms that have all been shown to be optimal in the worst case, and many of them have also been implemented and tested in practice. However, the implementation of these algorithms often requires an enhanced indexing structure: to achieve optimality we either need to build completely new indexes or we must populate the database with several different instantiations of common indexes such as B+-trees. Either way, this means spending an extra amount of storage space that may be non-negligible. #R##N#In this paper we show that optimal algorithms can be obtained directly from a representation that regards the relations as point sets in variable-dimensional grids, without the need of extra storage. Our representation is a compact quadtree for the static indexes and a dynamic quadtree sharing subtrees (which we dub a Qdag) for intermediate results. We develop a compositional algorithm to process full join queries when data is stored in said structures, and then show that the running time of this algorithm is worst-case optimal in data complexity. #R##N#Remarkably, we can even extend our framework to compute more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of Qdags. Once again, we can show that the running time of our algorithms is worst-case optimal.

Includes members:
  Member "worst case optimal join algorithms techniques results and open problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rk means fast clustering for relational data")
  Member "size bounds and query plans for relational joins":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "compressed representation of dynamic binary relations with applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed data structures for binary relations in practice")
  Member "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")
  Member "join processing for graph patterns an old dog with new tricks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the triejax architecture accelerating graph operations through relational joins")
  Member "faq questions asked frequently":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "joins via geometric resolutions worst case and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "faster compressed quadtrees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a compact representation of raster time series")

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)