human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "efficient and extensible algorithms for multi query optimization"
  Abstract: Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across multiple such queries run as a batch. Multi-query optimization aims at exploiting common sub-expressions to reduce evaluation cost. Multi-query optimization has hither-to been viewed as impractical, since earlier algorithms were exhaustive, and explore a doubly exponential search space. #R##N#In this paper we demonstrate that multi-query optimization using heuristics is practical, and provides significant benefits. We propose three cost-based heuristic algorithms: Volcano-SH and Volcano-RU, which are based on simple modifications to the Volcano search strategy, and a greedy heuristic. Our greedy heuristic incorporates novel optimizations that improve efficiency greatly. Our algorithms are designed to be easily added to existing optimizers. We present a performance study comparing the algorithms, using workloads consisting of queries from the TPC-D benchmark. The study shows that our algorithms provide significant benefits over traditional optimization, at a very acceptable overhead in optimization time.

Connected through hyperedge HE-1 (induced by source paper "towards scalable dataframe systems"):
  with members:
    - "verdictdb universalizing approximate query processing"
    - "helix holistic optimization for accelerating iterative machine learning"
    - "ray a distributed framework for emerging ai applications"
    - "adaptive sampling for rapidly matching histograms"
    - "laradb a minimalist kernel for linear and relational algebra computation"
    - "towards a holistic integration of spreadsheets with databases a scalable storage engine for presentational data management"
    - "lara a key value algebra underlying arrays and relations"
    - "visualization aware sampling for very large databases"

Connected through hyperedge HE-2 (induced by source paper "edit based grading of sql queries"):
  with members:
    - "explaining wrong queries using small examples"
    - "automated clustering and program repair for introductory programming assignments"
    - "data generation for testing and grading sql queries"
    - "automated feedback generation for introductory programming assignments"

Connected through hyperedge HE-3 (induced by source paper "kaskade graph views for efficient graph analytics"):
  with members:
    - "extracting and analyzing hidden graphs from relational databases"
    - "graph summarization methods and applications a survey"
    - "view selection in semantic web databases"
    - "graphlab a new framework for parallel machine learning"

Connected through hyperedge HE-4 (induced by source paper "catalog of optimization strategies and realizations for composed integration patterns"):
  with members:
    - "the many faces of data centric workflow optimization a survey"

Connected through hyperedge HE-5 (induced by source paper "cache based multi query optimization for data intensive scalable computing frameworks"):
  with members:
    - "revisiting reuse in main memory database systems"
    - "shareddb killing one thousand queries with one stone"
    - "restore reusing results of mapreduce jobs"

Connected through hyperedge HE-6 (induced by source paper "cobra a framework for cost based rewriting of database applications"):
  with members:
    - "runtime optimization of join location in parallel data management systems"
    - "program transformations for asynchronous and batched query submission"
    - "equality saturation a new approach to optimization"

Connected through hyperedge HE-7 (induced by source paper "pay one get hundreds for free reducing cloud costs through shared query execution"):
  with members:
    - "shareddb killing one thousand queries with one stone"

Connected through hyperedge HE-8 (induced by source paper "structured deep hashing with convolutional neural networks for fast person re identification"):
  with members:
    - "deep adaptive feature embedding with local sample distributions for person re identification"
    - "what and where to match deep spatially multiplicative integration networks for person re identification"
    - "gated siamese convolutional neural network architecture for human re identification"
    - "learning a discriminative null space for person re identification"
    - "deep ranking for person re identification via joint representation learning"
    - "personnet person re identification with deep convolutional neural networks"
    - "learning to rank in person re identification with metric ensembles"
    - "deep semantic ranking based hashing for multi label image retrieval"

Question: Please tell me which class the center node 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)