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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593 · cited 1×
“two objects in lD space is 13. These 13 relations correspond to the relations between time intervals introduced in ( Allen, 1983 ).”
BackgroundR-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
A Spatial Logic based on Regions and Connection.
Randell, D. A., Cui, Z., & Cohn, A. G. (1992) · Cited by 1,948
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · ACM SIGMOD Record · doi:10.1145/93605.98741 · Cited by 1,424
Roussopoulos, N., Kelley, S., & Vincent, F. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223794 · Cited by 1,402
Temporal reasoning based on semi-intervals
Freksa, C. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90090-k · Cited by 678
Reasoning about binary topological relations
Egenhofer, M. J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54414-3_36 · Cited by 628
Self-citationSpatial SQL: a query and presentation language
Egenhofer, M. J. (1994) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.273029 · Cited by 378
Self-citationQualitative spatial reasoning: cardinal directions as an example
Frank, A. U. (1996) · International journal of geographical information systems · doi:10.1080/02693799608902079 · Cited by 369
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.