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: "reordering rows for better compression beyond the lexicographic order"
  Abstract: Sorting database tables before compressing them improves the compression rate. Can we do better than the lexicographical order? For minimizing the number of runs in a run-length encoding compression scheme, the best approaches to row-ordering are derived from traveling salesman heuristics, although there is a significant trade-off between running time and compression. A new heuristic, Multiple Lists, which is a variant on Nearest Neighbor that trades off compression for a major running-time speedup, is a good option for very large tables. However, for some compression schemes, it is more important to generate long runs rather than few runs. For this case, another novel heuristic, Vortex, is promising. We find that we can improve run-length encoding up to a factor of 3 whereas we can improve prefix coding by up to 80%: these gains are on top of the gains due to lexicographically sorting the table. We prove that the new row reordering is optimal (within 10%) at minimizing the runs of identical values within columns, in a few cases.

Connected through hyperedge HE-1 (induced by source paper "roaring bitmaps implementation of an optimized software library"):
  with members:
    - "faster population counts using avx2 instructions"
    - "effortless data exploration with zenvisage an expressive and interactive visual analytics system"
    - "consistently faster and smaller compressed bitmaps with roaring"
    - "array layouts for comparison based searching"
    - "simd compression and the intersection of sorted integers"
    - "better bitmap performance with roaring bitmaps"
    - "compressed bitmap indexes beyond unions and intersections"
    - "sorting improves word aligned bitmap indexes"

Connected through hyperedge HE-2 (induced by source paper "consistently faster and smaller compressed bitmaps with roaring"):
  with members:
    - "simd compression and the intersection of sorted integers"
    - "better bitmap performance with roaring bitmaps"
    - "compressed bitmap indexes beyond unions and intersections"
    - "decoding billions of integers per second through vectorization"
    - "sorting improves word aligned bitmap indexes"
    - "concise compressed n composable integer set"

Connected through hyperedge HE-3 (induced by source paper "better bitmap performance with roaring bitmaps"):
  with members:
    - "simd compression and the intersection of sorted integers"
    - "compressed bitmap indexes beyond unions and intersections"
    - "decoding billions of integers per second through vectorization"
    - "sorting improves word aligned bitmap indexes"
    - "concise compressed n composable integer set"
    - "attribute value reordering for efficient hybrid olap"

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)