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 "solving linear programs on factorized databases"):
  Abstract: A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the solver on this program while providing the data. When the data is extracted using a query on a database, this approach ignores the underlying structure of the answer set which may result in a blow-up of the size of the linear program if the answer set is big. In this paper, we study the problem of solving linear programming problems whose variables are the answers to a conjunctive query. We show that one can exploit the structure of the query to rewrite the linear program so that its size depends only on the size of the database and not on the size of the answer set. More precisely, we give a generic way of rewriting a linear program whose variables are the tuples in Q(D) for a conjunctive query Q and a database D into a linear program having a number of variables that only depends on the size of a factorized representation of Q(D), which can be much smaller when the fractional hypertree width of Q is bounded.

Includes members:
  Member "ranked enumeration of conjunctive query results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal algorithms for ranked enumeration of answers to full conjunctive queries")
  Member "general and fractional hypertree decompositions hard and easy cases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "efficient inverse maintenance and faster algorithms for linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "aggregation in probabilistic databases via knowledge compilation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "infinite probabilistic databases")
  Member "combining relational algebra sql constraint modelling and local search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "semiring programming a declarative framework for generalized sum product problems")
  Member "hypertree decompositions and tractable queries":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")

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)