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 "adaptive low level storage of very large knowledge graphs"):
  Abstract: The increasing availability and usage of Knowledge Graphs (KGs) on the Web calls for scalable and general-purpose solutions to store this type of data structures. We propose Trident, a novel storage architecture for very large KGs on centralized systems. Trident uses several interlinked data structures to provide fast access to nodes and edges, with the physical storage changing depending on the topology of the graph to reduce the memory footprint. In contrast to single architectures designed for single tasks, our approach offers an interface with few low-level and general-purpose primitives that can be used to implement tasks like SPARQL query answering, reasoning, or graph analytics. Our experiments show that Trident can handle graphs with 10^11 edges using inexpensive hardware, delivering competitive performance on multiple workloads.

Includes members:
  Member "a survey of rdf data management systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries")
  Member "snap a general purpose network analysis and graph mining library":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "struct mmsb mixed membership stochastic blockmodels with interpretable structured priors")
  Member "kognac efficient encoding of large knowledge graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "survey and taxonomy of lossless graph compression and space efficient graph representations")
  Member "taming subgraph isomorphism for rdf query processing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "structural indexing for conjunctive path queries")
  Member "ringo interactive graph analytics on big memory machines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a graphblas approach for subgraph counting")
  Member "s2rdf rdf querying with sparql on spark":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "accelerating partial evaluation in distributed sparql query evaluation")
  Member "processing sparql queries over distributed rdf graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "semantic guided and response times bounded top k similarity search over knowledge graphs")

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)