The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The R*-tree: an efficient and robust access method for points and rectangles
Open accessAbstract
The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the R*-tree which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory. Using our standardized testbed in an exhaustive performance comparison, it turned out that the R*-tree clearly outperforms the existing R-tree variants. Guttman's linear and quadratic R-tree and Greene's variant of the R-tree. This superiority of the R*-tree holds for different types of queries and operations, such as map overlay, for both rectangles and multidimensional points in all experiments. From a practical point of view the R*-tree is very attractive because of the following two reasons 1 it efficiently supports point and spatial data at the same time and 2 its implementation cost is only slightly higher than that of other R-trees.
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.
Integrity signals
Registry
Cites
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.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
R-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
Cited by
(1996) · Cited by 20,179
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN
Schubert, E., Sander, J., Ester, M., Kriegel, H. P., & Xu, X. (2017) · ACM Transactions on Database Systems · doi:10.1145/3068335 · Cited by 2,737
Self-citationData mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335437 · Cited by 1,860
FAST-LIO2: Fast Direct LiDAR-Inertial Odometry
Xu, W., Cai, Y., He, D., Lin, J., & Zhang, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3141876 · Cited by 1,750
QBIC project: querying images by content, using color, texture, and shape:
Niblack, C. W., Barber, R., Equitz, W., Flickner, M. D., Glasman, E. H., Petkovic, D., Yanker, P., Faloutsos, C., & Taubin, G. (1993) · SPIE Proceedings · doi:10.1117/12.143648 · Cited by 1,747
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191925 · Cited by 1,709
Image Retrieval: Current Techniques, Promising Directions, and Open Issues
Rui, Y., Huang, T. S., & Chang, S.-F. (1999) · Journal of Visual Communication and Image Representation · doi:10.1006/jvci.1999.0413 · Cited by 1,601
A review on time series data mining
Fu, T.-C. (2011) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2010.09.007 · Cited by 1,500
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Sander, J., Ester, M., Kriegel, H.-P., & Xu, X. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009745219419 · Cited by 1,495
Self-citationMining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
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
OPTICS: ordering points to identify the clustering structure
Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304187 · Cited by 1,335
Self-citationQuery evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Efficient and effective Querying by Image Content
Faloutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petkovic, D., & Equitz, W. (1994) · Journal of Intelligent Information Systems · doi:10.1007/bf00962238 · Cited by 1,249
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171
Berchtold, S., Keim, D. A., & Kriegel, H.-P. (2002) · Readings in Multimedia Computing and Networking · doi:10.1016/b978-155860651-7/50124-8 · Cited by 1,118
Self-citationEfficient time series matching by wavelets
Chan, K.-P., & Fu, A. W.-C. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754915 · Cited by 1,031
Esling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Faloutsos, C., & Lin, K.-I. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223812 · Cited by 897
BIRCH: A New Data Clustering Algorithm and Its Applications
Zhang, T., Ramakrishnan, R., & Livny, M. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009783824328 · Cited by 888
A survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864
Self-citationEfficient collision detection using bounding volume hierarchies of k-DOPs
Klosowski, J. T., Held, M., Mitchell, J. S. B., Sowizral, H., & Zikan, K. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.675649 · Cited by 873
Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms
Gedik, B., & Liu, L. (2008) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1062 · Cited by 837
Böhm, C., Berchtold, S., & Keim, D. A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502809 · Cited by 827
The SR-tree: an index structure for high-dimensional nearest neighbor queries
Katayama, N., & Satoh, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253347 · Cited by 817
Blobworld: A System for Region-Based Image Indexing and Retrieval
Carson, C., Thomas, M., Belongie, S., Hellerstein, J. M., & Malik, J. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48762-x_63 · Cited by 764
An introduction to spatial database systems
G�ting, R. H. (1994) · The VLDB Journal · doi:10.1007/bf01231602 · Cited by 724
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · ACM SIGMOD Record · doi:10.1145/191843.191925 · Cited by 722
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276312 · Cited by 669
Fast Time Sequence Indexing for Arbitrary Lp Norms
Yi, B.-K., & Faloutsos, C. (2018) · doi:10.1184/r1/6605618 · Cited by 650
Similarity indexing with the SS-tree
White, D. A., & Jain, R. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492202 · Cited by 635
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
Kalnis, P., Ghinita, G., Mouratidis, K., & Papadias, D. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190662 · Cited by 620
Hadoop GIS: a high performance spatial data warehousing system over mapreduce
Aji, A., Wang, F., Vo, H., Lee, R., Liu, Q., Zhang, X., & Saltz, J. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536222.2536227 · Cited by 593
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233311 · Cited by 581
Dynamic queries for visual information seeking
Shneiderman, B. (1994) · IEEE Software · doi:10.1109/52.329404 · Cited by 573
Halder, R. K., Uddin, M. N., Uddin, M. A., Aryal, S., & Khraisat, A. (2024) · Journal of Big Data · doi:10.1186/s40537-024-00973-y · Cited by 520
Fundamentals of Content-Based Image Retrieval
Long, F., Zhang, H., & Feng, D. D. (2003) · Signals and Communication Technology · doi:10.1007/978-3-662-05300-3_1 · Cited by 511
The TV-tree: An index structure for high-dimensional data
Lin, K.-I., Jagadish, H. V., & Faloutsos, C. (1994) · The VLDB Journal · doi:10.1007/bf01231606 · Cited by 494
Index-driven similarity search in metric spaces (Survey Article)
Hjaltason, G. R., & Samet, H. (2003) · ACM Transactions on Database Systems · doi:10.1145/958942.958948 · Cited by 439
A clustering-based approach for discovering interesting places in trajectories
Palma, A. T., Bogorny, V., Kuijpers, B., & Alvares, L. O. (2008) · Proceedings of the 2008 ACM symposium on Applied computing · doi:10.1145/1363686.1363886 · Cited by 428
Bai, C., Xiao, T., Chen, Y., Wang, H., Zhang, F., & Gao, X. (2022) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2022.3152830 · Cited by 389
Incremental Local Outlier Detection for Data Streams
Pokrajac, D., Lazarevic, A., & Latecki, L. J. (2007) · 2007 IEEE Symposium on Computational Intelligence and Data Mining · doi:10.1109/cidm.2007.368917 · Cited by 386
Fast approximate nearest neighbor search with the navigating spreading-out graph
Fu, C., Xiang, C., Wang, C., & Cai, D. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3303753.3303754 · Cited by 379
A cost model for nearest neighbor search in high-dimensional data space
Berchtold, S., Böhm, C., Keim, D. A., & Kriegel, H.-P. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263671 · Cited by 373
Self-citationLSH forest: self-tuning indexes for similarity search
Bawa, M., Condie, T., & Ganesan, P. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060840 · Cited by 353
A distribution-based clustering algorithm for mining in large spatial databases
Xu, X., Ester, M., Kriegel, H.-P., & Sander, J. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655795 · Cited by 352
Self-citationDistance-based indexing for high-dimensional metric spaces
Bozkaya, T., & Ozsoyoglu, M. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253345 · Cited by 332
Mining top-n local outliers in large databases
Jin, W., Tung, A. K. H., & Han, J. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502554 · Cited by 328
A review of moving object trajectory clustering algorithms
Yuan, G., Sun, P., Zhao, J., Li, D., & Wang, C. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9477-7 · Cited by 323
A survey on data stream clustering and classification
Nguyen, H.-L., Woon, Y.-K., & Ng, W.-K. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-014-0808-1 · Cited by 321
Top-k Neighborhood Dominating Query
Xie, X., Lu, H., Chen, J., & Shang, S. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37487-6_12 · Cited by 321
An efficient color representation for image retrieval
Deng, Y., Manjunath, B. S., Kenney, C., Moore, M. S., & Shin, H. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.892450 · Cited by 314
A simple algorithm for nearest neighbor search in high dimensions
Nene, S. A., & Nayar, S. K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.615448 · Cited by 311
Closure-Tree: An Index Structure for Graph Queries
He, H., & Singh, A. K. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.37 · Cited by 293
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
Barequet, G., & Har-Peled, S. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1127 · Cited by 287
Range queries in OLAP data cubes
Ho, C.-T., Agrawal, R., Megiddo, N., & Srikant, R. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253274 · Cited by 281
Similarity search over time-series data using wavelets
Popivanov, I., & Miller, R. J. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994711 · Cited by 280
Identifying similarities, periodicities and bursts for online search queries
Vlachos, M., Meek, C., Vagena, Z., & Gunopulos, D. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007586 · Cited by 277
Fast distance queries with rectangular swept sphere volumes
Larsen, E., Gottschalk, S., Lin, M. C., & Manocha, D. (2002) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.845311 · Cited by 277
RNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density Estimates
Bryant, A., & Cios, K. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2787640 · Cited by 273
Outlier Detection with Kernel Density Functions
Latecki, L. J., Lazarevic, A., & Pokrajac, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73499-4_6 · Cited by 273
Similarity searching in medical image databases
Petrakis, E. G. M., & Faloutsos, A. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.599932 · Cited by 269
A Survey on Trajectory Data Management, Analytics, and Learning
Wang, S., Bao, Z., Culpepper, J. S., & Cong, G. (2022) · ACM Computing Surveys · doi:10.1145/3440207 · Cited by 267
Content-Based Copy Retrieval Using Distortion-Based Probabilistic Similarity Search
Joly, A., Buisson, O., & Frelicot, C. (2007) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2006.886278 · Cited by 261
Dimensionality reduction for similarity searching in dynamic databases
Ravi Kanth, K. V., Agrawal, D., & Singh, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276320 · Cited by 256
Topological relations in the world of minimum bounding rectangles: a study with R-trees
Papadias, D., Sellis, T., Theodoridis, Y., & Egenhofer, M. J. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223798 · Cited by 255
OPALS – A framework for Airborne Laser Scanning data analysis
Pfeifer, N., Mandlburger, G., Otepka, J., & Karel, W. (2014) · Computers, Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2013.11.002 · Cited by 252
FoggyCache: Cross-Device Approximate Computation Reuse
Guo, P., Hu, B., Li, R., & Hu, W. (2018) · Proceedings of the 24th Annual International Conference on Mobile Computing and Networking · doi:10.1145/3241539.3241557 · Cited by 91
Metadata
- Authors
- Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B.
- Venue
- Proceedings of the 1990 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 1990-05
- Pages
- 322-331
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2151135734
- Cited by
- 4,161
- References
- 2
- FWCI
- 41.74
- 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
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.