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: "an introduction to graph data management"
  Abstract: A graph database is a database where the data structures for the schema and/or instances are modeled as a (labeled)(directed) graph or generalizations of it, and where querying is expressed by graph-oriented operations and type constructors. In this article we present the basic notions of graph databases, give an historical overview of its main development, and study the main current systems that implement them.

Connected through hyperedge HE-1 (induced by source paper "storage solutions for big data systems a qualitative study and comparison"):
  with members:
    - "a billion updates per second using 30 000 hierarchical in memory d4m databases"
    - "foundationdb record layer a multi tenant structured datastore"
    - "hadoop perfect file a fast access container for small files with direct in disc metadata access"
    - "decentralized search on decentralized web"
    - "effects of storage heterogeneity in distributed cache systems"
    - "database as a service current issues and its future"
    - "chain of trust can trusted hardware help scaling blockchains"
    - "towards scaling blockchain systems via sharding"

Connected through hyperedge HE-2 (induced by source paper "bivariate cluster and suitability analysis of nosql solutions for different application areas"):
  with members:
    - "a billion updates per second using 30 000 hierarchical in memory d4m databases"
    - "foundationdb record layer a multi tenant structured datastore"
    - "effects of storage heterogeneity in distributed cache systems"
    - "database as a service current issues and its future"
    - "polypus a big data self deployable architecture for microblogging text extraction and real time sentiment analysis"
    - "a stitch in time saves nine sparql querying of property graphs using gremlin traversals"
    - "blocktag design and applications of a tagging system for blockchain analysis"
    - "g core a core for future graph query languages"

Connected through hyperedge HE-3 (induced by source paper "direct mappings between rdf and property graph databases"):
  with members:
    - "the query translation landscape a survey"
    - "a stitch in time saves nine sparql querying of property graphs using gremlin traversals"
    - "a formal graph model for rdf and its implementation"
    - "foundations of an alternative approach to reification in rdf"

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)