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: "a survey of rdf data management systems"
  Abstract: RDF is increasingly being used to encode data for the semantic web and for data exchange. There have been a large number of works that address RDF data management. In this paper we provide an overview of these works.

Connected through hyperedge HE-1 (induced by source paper "adaptive low level storage of very large knowledge graphs"):
  with members:
    - "snap a general purpose network analysis and graph mining library"
    - "kognac efficient encoding of large knowledge graphs"
    - "taming subgraph isomorphism for rdf query processing"
    - "ringo interactive graph analytics on big memory machines"
    - "s2rdf rdf querying with sparql on spark"
    - "processing sparql queries over distributed rdf graphs"

Connected through hyperedge HE-2 (induced by source paper "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"):
  with members:
    - "graph processing on fpgas taxonomy survey challenges"
    - "slim fly a cost effective low diameter network topology"
    - "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"
    - "active access a mechanism for high performance distributed data centric computations"
    - "network accelerated non contiguous memory transfers"
    - "slim graph practical lossy graph compression for approximate graph processing storage and analytics"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"
    - "high level programming abstractions for distributed graph processing"

Connected through hyperedge HE-3 (induced by source paper "compressed indexes for fast search of semantic data"):
  with members:
    - "techniques for inverted index compression"
    - "handling massive n gram datasets efficiently"
    - "vectorized vbyte decoding"

Connected through hyperedge HE-4 (induced by source paper "a survey of heterogeneous information network analysis"):
  with members:
    - "organizational chart inference"
    - "predicting neighbor distribution in heterogeneous information networks"
    - "pte predictive text embedding through large scale heterogeneous text networks"
    - "integrating heterogeneous information via flexible regularization framework for recommendation"
    - "classification of message spreading in a heterogeneous social network"
    - "scalable topical phrase mining from text corpora"
    - "future influence ranking of scientific literature"
    - "predicting social links for new users across aligned heterogeneous social networks"

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)