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 "structural indexing for conjunctive path queries"):
  Abstract: Structural indexing is an approach to accelerating query evaluation, whereby data objects are partitioned and indexed reflecting the precise expressive power of a given query language. Each partition block of the index holds exactly those objects that are indistinguishable with respect to queries expressible in the language. Structural indexes have proven successful for XML, RDF, and relational data management. In this paper we study structural indexing for conjunctive path queries (CPQ). CPQ forms the core of contemporary graph query languages such as SPARQL, Cypher, PGQL, and G-CORE. CPQ plays the same fundamental role with respect to contemporary graph query languages as the classic conjunctive queries play for SQL. We develop the first practical structural indexes for this important query language. In particular, we propose a structural index based on k-path-bisimulation, tightly coupled to the expressive power of CPQ, and develop algorithms for efficient query processing with our index. Furthermore, we study workload-aware structural indexes to reduce both the construction and space costs according to a given workload. We demonstrate through extensive experiments using real and synthetic graphs that our methods accelerate query processing by up to multiple orders of magnitude over the state-of-the-art methods, without increasing index size.

Includes members:
  Member "the ubiquity of large graphs and surprising challenges of graph processing extended survey":
    also connected through other hyperedges:
      (none)
  Member "survey and taxonomy of lossless graph compression and space efficient graph representations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "gmark schema driven generation of graphs and queries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graph generators state of the art and open challenges")
  Member "g core a core for future graph query languages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph generators state of the art and open challenges")
  Member "an analytical study of large sparql query logs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "knowledge graphs")
  Member "foundations of modern query languages for graph databases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "knowledge graphs")
  Member "taming subgraph isomorphism for rdf query processing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adaptive low level storage of very large knowledge graphs")
  Member "similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "structural characterizations of the navigational expressiveness of relation algebras on a tree")

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)