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 "an analytical study of large sparql query logs"):
  Abstract: With the adoption of RDF as the data model for Linked Data and the Semantic Web, query specification from end- users has become more and more common in SPARQL end- points. In this paper, we conduct an in-depth analytical study of the queries formulated by end-users and harvested from large and up-to-date query logs from a wide variety of RDF data sources. As opposed to previous studies, ours is the first assessment on a voluminous query corpus, span- ning over several years and covering many representative SPARQL endpoints. Apart from the syntactical structure of the queries, that exhibits already interesting results on this generalized corpus, we drill deeper in the structural char- acteristics related to the graph- and hypergraph represen- tation of queries. We outline the most common shapes of queries when visually displayed as pseudographs, and char- acterize their (hyper-)tree width. Moreover, we analyze the evolution of queries over time, by introducing the novel con- cept of a streak, i.e., a sequence of queries that appear as subsequent modifications of a seed query. Our study offers several fresh insights on the already rich query features of real SPARQL queries formulated by real users, and brings us to draw a number of conclusions and pinpoint future di- rections for SPARQL query evaluation, query optimization, tuning, and benchmarking.

Includes members:
  Member "gmark schema driven generation of graphs and queries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graph generators state of the art and open challenges")
  Member "enumeration problems for regular path queries":
    also connected through other hyperedges:
      (none)
  Member "old techniques for new join algorithms a case study in rdf processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")
  Member "on the statistical analysis of practical sparql queries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithms and analysis for the sparql constructs")
  Member "flexible caching in trie joins":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the triejax architecture accelerating graph operations through relational joins")
  Member "a trichotomy for regular simple path queries on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "regular expressions with backreferences polynomial time matching techniques")
  Member "an empirical study of real world sparql queries":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "revisiting compact rdf stores based on k2 trees")
  Member "semantics and complexity of sparql":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "functional programming in pattern match oriented programming style")

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)