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 "ranked enumeration of conjunctive query results"):
  Abstract: We investigate the enumeration of top-k answers for conjunctive queries against relational databases according to a given ranking function. The task is to design data structures and algorithms that allow for efficient enumeration after a preprocessing phase. Our main contribution is a novel priority queue based algorithm with near-optimal delay and non-trivial space guarantees that are output sensitive and depend on structure of the query. In particular, we exploit certain desirable properties of ranking functions that frequently occur in practice and degree information in the database instance, allowing for efficient enumeration. We introduce the notion of {\em decomposable} and {\em compatible} ranking functions in conjunction with query decomposition, a property that allows for partial aggregation of tuple scores in order to efficiently enumerate the ranked output. We complement the algorithmic results with lower bounds justifying why certain assumptions about properties of ranking functions are necessary and discuss popular conjectures providing evidence for optimality of enumeration delay guarantees. Our results extend and improve upon a long line of work that has studied ranked enumeration from both theoretical and practical perspective.

Includes members:
  Member "any k anytime top k tree pattern retrieval in labeled graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal algorithms for ranked enumeration of answers to full conjunctive queries")
  Member "answering fo mod queries under updates on bounded degree databases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constant delay enumeration with fpt preprocessing for conjunctive queries of bounded submodular width")
  Member "size bounds and query plans for relational joins":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "answering conjunctive queries under updates":
    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 "compressed representations of conjunctive query results":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fast join project query evaluation using matrix multiplication")
  Member "skew strikes back new developments in the theory of join algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fast join project query evaluation using matrix multiplication")
  Member "fdb a query engine for factorised relational databases":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "providing insights for queries affected by failures and stragglers")
  Member "optimal aggregation algorithms for middleware":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finding interesting frames in deep video analytics a top k approach")

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)