CoChat

Fast and practical indexing and querying of very large graphs

Trißl, Silke, Leser, Ulf · 2007 · Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Cited by 233

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

Many applications work with graph-structured data. As graphs grow in size, indexing becomes essential to ensure sufficient query performance. We present the GRIPP index structure (GRaph Indexing based on Pre- and Postorder numbering) for answering reachability queries in graphs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1247480.1247573

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 233

Metadata

Authors
Trißl, S., & Leser, U.
Venue
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Publisher
ACM
Published
2007-06-11
Pages
845-856
ISSN
0730-8078 (ISSN-L)
OpenAlex
W2076109400
Cited by
233
References
2
FWCI
17.52
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fast and practical indexing and querying of very large graphs. https://app.cochat.ai/papers/10.1145/1247480.1247573
The paper
Trißl, S., & Leser, U. (2007). Fast and practical indexing and querying of very large graphs. Proceedings of the 2007 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/1247480.1247573

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.