Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 255

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

Topological relations in the world of minimum bounding rectangles: a study with R-trees

Open access
Papadias, Dimitris, Sellis, Timos, Theodoridis, Yannis, Egenhofer, Max J.·1995·Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95

Abstract

Recent developments in spatial relations have led to their use in numerous applications involving spatial databases. This paper is concerned with the retrieval of topological relations in Minimum Bounding Rectangle-based data structures. We study the topological information that Minimum Bounding Rectangles convey about the actual objects they enclose, using the concept of projections. Then we apply the results to R-trees and their variations, R+-trees and R*-trees in order to minimise disk accesses for queries involving topological relations. We also investigate queries that involve complex spatial conditions in the form of disjunctions and conjunctions and we discuss possible extensions.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1145/223784.223798

Cites

16 of 16 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 16 references

Metadata

Authors
Papadias, D., Sellis, T., Theodoridis, Y., & Egenhofer, M. J.
Venue
Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95
Publisher
ACM Press
Published
1995
Pages
92-103
ISSN
0730-8078 (ISSN-L)
OpenAlex
W2142670185
Cited by
255
References
16
FWCI
26.37
Type
conference paper
Language
en
Open access
bronze

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: Topological relations in the world of minimum bounding rectangles: a study with R-trees. https://app.cochat.ai/papers/10.1145/223784.223798
The paper
Papadias, D., Sellis, T., Theodoridis, Y., & Egenhofer, M. J. (1995). Topological relations in the world of minimum bounding rectangles: a study with R-trees. Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95. https://doi.org/10.1145/223784.223798

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.