On packing R-trees

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On packing R-trees

Full text

Pdf (930 KB)

Source

Conference on Information and Knowledge Management archive
Proceedings of the second international conference on Information and knowledge management table of contents

Washington, D.C., United States

Pages: 490 - 499

Year of Publication: 1993

ISBN:0-89791-626-3

Authors

Ibrahim Kamel	Department of CS, University of Maryland, College Park, MD
Christos Faloutsos	IBM Almaden Research Center and Department of CS, University of Maryland, College Park, MD

Sponsors

Inst Soc for Comp & Applic : Inst Soc for Comp & Applic
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGIR: ACM Special Interest Group on Information Retrieval

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 16, Downloads (12 Months): 180, Citation Count: 103

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/170088.170403 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Walid G. Aref , Hanan Samet, Optimization for Spatial Query Processing, Proceedings of the 17th International Conference on Very Large Data Bases, p.81-90, September 03-06, 1991
	2	Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
	3	Jon Louis Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, v.18 n.9, p.509-517, Sept. 1975 [doi>10.1145/361002.361007]
	4	T. Bially. Space-filling curves: Their generation and their application to bandwidth reduction. IEEE Trans. on Information Theory, IT- 15(6):658-664, November 1969.
	5	C. Faloutsos, Gray Codes for Partial Match and Range Queries, IEEE Transactions on Software Engineering, v.14 n.10, p.1381-1393, October 1988 [doi>10.1109/32.6184]
	6	C. Faloutsos , S. Roseman, Fractals for secondary key retrieval, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.247-252, March 1989, Philadelphia, Pennsylvania, United States [doi>10.1145/73721.73746]
	7	Irene Gargantini, An effective way to represent quadtrees, Communications of the ACM, v.25 n.12, p.905-910, Dec 1982 [doi>10.1145/358728.358741]
	8	Diane Greene, An Implementation and Performance Analysis of Spatial Data Access Methods, Proceedings of the Fifth International Conference on Data Engineering, p.606-615, February 06-10, 1989
	9	J. G. Griffiths, An algorithm for displaying a class of space-filling curves, Software—Practice & Experience, v.16 n.5, p.403-411, May 1986 [doi>10.1002/spe.4380160503]
	10	O. Gun~her. The cell tree: e~n index for geometric data. Memorandum No. UCB/ERL M86/89, Univ. of California, Berkeley, December 1986.
	11	Antonin Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
	12	L. M. Haas , J. C. Freytag , G. M. Lohman , H. Pirahesh, Extensible query processing in starburst, Proceedings of the 1989 ACM SIGMOD international conference on Management of data, p.377-388, June 1989, Portland, Oregon, United States
	13	K. Hinrichs and J. Nievergelt. The grid file: a data structure to support proximity queries on spatial objects. Proc. of the WG'83 (Intern. Workshop on Graph Theoretic Concepts in Compuier Science), pages 100-113, 1983.
	14	H. V. Jagadish, Spatial Search with Polyhedra, Proceedings of the Sixth International Conference on Data Engineering, p.311-319, February 05-09, 1990
	15	H. V. Jagadish, Linear clustering of objects with multiple attributes, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.332-342, May 23-26, 1990, Atlantic City, New Jersey, United States
	16	Curtis P. Kolovson , Michael Stonebraker, Segment indexes: dynamic indexing techniques for multi-dimensional interval data, Proceedings of the 1991 ACM SIGMOD international conference on Management of data, p.138-147, May 29-31, 1991, Denver, Colorado, United States
	17	David B. Lomet , Betty Salzberg, The hB-tree: a multiattribute indexing method with good guaranteed performance, ACM Transactions on Database Systems (TODS), v.15 n.4, p.625-658, Dec. 1990 [doi>10.1145/99935.99949]
	18	B. Mandelbrot. Fractal Geometry of Nature. W.H. Freeman, New York, 1977.
	19	Jack A. Orenstein, Spatial query processing in an object-oriented database system, Proceedings of the 1986 ACM SIGMOD international conference on Management of data, p.326-336, May 28-30, 1986, Washington, D.C., United States
	20	John T. Robinson, The K-D-B-tree: a search structure for large multidimensional dynamic indexes, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan [doi>10.1145/582318.582321]
	21	Nick Roussopoulos , Daniel Leifker, Direct spatial search on pictorial databases using packed R-trees, Proceedings of the 1985 ACM SIGMOD international conference on Management of data, p.17-31, May 1985, Austin, Texas, United States
	22	Hanan Samet, The design and analysis of spatial data structures, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	23	Timos K. Sellis , Nick Roussopoulos , Christos Faloutsos, The R+-Tree: A Dynamic Index for Multi-Dimensional Objects, Proceedings of the 13th International Conference on Very Large Data Bases, p.507-518, September 01-04, 1987

CITED BY 103

	Kihong Kim , Sang K. Cha, Sibling clustering of tree-based spatial indexes for efficient spatial query processing, Proceedings of the seventh international conference on Information and knowledge management, p.398-405, November 02-07, 1998, Bethesda, Maryland, United States
	Gísli R. Hjaltason , Hanan Samet , Yoram J. Sussmann, Speeding up bulk-loading of quadtrees, Proceedings of the 5th ACM international workshop on Advances in geographic information systems, p.50-53, November 10-14, 1997, Las Vegas, Nevada, United States
	Dieter Pfoser , Christian S. Jensen, Querying the trajectories of on-line mobile objects, Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access, p.66-73, May 2001, Santa Barbara, California, United States
	Guido Proietti , Christos Faloutsos, Selectivity estimation of Window queries for line segment datasets, Proceedings of the seventh international conference on Information and knowledge management, p.340-347, November 02-07, 1998, Bethesda, Maryland, United States
	George Kollios , Dimitrios Gunopulos , Vassilis J. Tsotras, On indexing mobile objects, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.261-272, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	Paolo Ciaccia , Marco Patella , Pavel Zezula, A cost model for similarity queries in metric spaces, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.59-68, June 01-04, 1998, Seattle, Washington, United States
	Jeffrey Scott Vitter, External memory algorithms, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.119-128, June 01-04, 1998, Seattle, Washington, United States
	Sanghyun Park , Sang-Wook Kim , June-Suh Cho , Sriram Padmanabhan, Prefix-querying: an approach for effective subsequence matching under time warping in sequence databases, Proceedings of the tenth international conference on Information and knowledge management, October 05-10, 2001, Atlanta, Georgia, USA
	Ibrahim Kamel, Fast retrieval of cursive handwriting, Proceedings of the fifth international conference on Information and knowledge management, p.91-98, November 12-16, 1996, Rockville, Maryland, United States
	Gísli R. Hjaltason , Hanan Samet, Distance browsing in spatial databases, ACM Transactions on Database Systems (TODS), v.24 n.2, p.265-318, June 1999
	Yannis Theodoridis , Emmanuel Stefanakis , Timos Sellis, Efficient Cost Models for Spatial Queries Using R-Trees, IEEE Transactions on Knowledge and Data Engineering, v.12 n.1, p.19-32, January 2000
	Simonas Šaltenis , Christian S. Jensen , Scott T. Leutenegger , Mario A. Lopez, Indexing the positions of continuously moving objects, ACM SIGMOD Record, v.29 n.2, p.331-342, June 2000
	Apostolos Papadopoulos , Yanis Manolopoulos, Parallel processing of nearest neighbor queries in declustered spatial data, Proceedings of the 4th ACM international workshop on Advances in geographic information systems, p.35-43, November 1996, Rockville, Maryland, United States
	Christian A. Lang , Ambuj K. Singh, Modeling high-dimensional index structures using sampling, ACM SIGMOD Record, v.30 n.2, p.389-400, June 2001
	Scott T. Leutenegger , Mario A. Lopez, A buffer model for evaluating R-tree performance, ACM SIGMETRICS Performance Evaluation Review, v.24 n.1, p.264-265, May 1996
	Mohamed F. Mokbel , Walid G. Aref, Irregularity in multi-dimensional space-filling curves with applications in multimedia databases, Proceedings of the tenth international conference on Information and knowledge management, October 05-10, 2001, Atlanta, Georgia, USA
	Jeffrey Scott Vitter, External memory algorithms and data structures: dealing with massive data, ACM Computing Surveys (CSUR), v.33 n.2, p.209-271, June 2001
	Christos Faloutsos , M. Ranganathan , Yannis Manolopoulos, Fast subsequence matching in time-series databases, ACM SIGMOD Record, v.23 n.2, p.419-429, June 1994
	A. Belussi , E. Bertino , B. Catania, Using spatial data access structures for filtering nearest neighbor queries, Data & Knowledge Engineering, v.40 n.1, p.1-31, January 2002
	Yannis Theodoridis , Timos Sellis, A model for the prediction of R-tree performance, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.161-171, June 04-06, 1996, Montreal, Quebec, Canada
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.29-38, January 06-08, 2002, San Francisco, California
	Christian Böhm , Stefan Berchtold , Daniel A. Keim, Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases, ACM Computing Surveys (CSUR), v.33 n.3, p.322-373, September 2001
	Bernd-Uwe Pagel , Hans-Werner Six , Mario Winter, Window query-optimal clustering of spatial objects, Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.86-94, May 22-25, 1995, San Jose, California, United States
	Volker Gaede , Oliver Günther, Multidimensional access methods, ACM Computing Surveys (CSUR), v.30 n.2, p.170-231, June 1998
	Christos Faloutsos , Ibrahim Kamel, Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.4-13, May 24-27, 1994, Minneapolis, Minnesota, United States
	Bernd-Uwe Pagel , Hans-Werner Six, Are window queries representative for arbitrary range queries?, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.150-160, June 04-06, 1996, Montreal, Quebec, Canada
	Yván J. García R , Mario A. López , Scott T. Leutenegger, A greedy algorithm for bulk loading R-trees, Proceedings of the 6th ACM international symposium on Advances in geographic information systems, p.163-164, November 02-07, 1998, Washington, D.C., United States
	Nikos Mamoulis , Dimitris Papadias, Integration of spatial join algorithms for processing multiple inputs, ACM SIGMOD Record, v.28 n.2, p.1-12, June 1999
	Ho-Hyun Park , Hyung-Ju Cho , Chin-Wan Chung, Heuristic approach for early separated filter and refinement strategy in spatial query optimization, Journal of Systems and Software, v.62 n.3, p.161-179, 15 June 2002
	Vram Kouramajian , Ibrahim Kamel , Ramez Elmasri , Syed Waheed, The time index+: an incremental access structure for temporal databases, Proceedings of the third international conference on Information and knowledge management, p.296-303, November 29-December 02, 1994, Gaithersburg, Maryland, United States
	Mohamed F. Mokbel , Walid G. Aref , Ibrahim Kamel, Analysis of Multi-Dimensional Space-Filling Curves, Geoinformatica, v.7 n.3, p.179-209, September 2003
	Lars Arge, External memory data structures, Handbook of massive data sets, Kluwer Academic Publishers, Norwell, MA, 2002
	Tae-Wan Kim , Ki-Joune Li, A distance-based packing method for high dimensional data, Proceedings of the fourteenth Australasian database conference, p.135-144, February 01, 2003, Adelaide, Australia
	James Abello , Yannis Kotidis, Hierarchical graph indexing, Proceedings of the twelfth international conference on Information and knowledge management, November 03-08, 2003, New Orleans, LA, USA
	G. Proietti , C. Faloutsos, Accurate Modeling of Region Data, IEEE Transactions on Knowledge and Data Engineering, v.13 n.6, p.874-883, November 2001
	Apostolos Papadopoulos , Yannis Manolopoulos, Parallel bulk-loading of spatial data, Parallel Computing, v.29 n.10, p.1419-1444, October 2003
	Yufei Tao , Jimeng Sun , Dimitris Papadias, Analysis of predictive spatio-temporal queries, ACM Transactions on Database Systems (TODS), v.28 n.4, p.295-336, December 2003
	Torsten Grust , Maurice Van Keulen , Jens Teubner, Accelerating XPath evaluation in any RDBMS, ACM Transactions on Database Systems (TODS), v.29 n.1, p.91-131, March 2004
	Yváan J. Garcia , Mario A. López , Scott T. Leutenegger, Post-optimization and incremental refinement of R-trees, Proceedings of the 7th ACM international symposium on Advances in geographic information systems, p.91-96, November 02-06, 1999, Kansas City, Missouri, United States
	Li Chen , Rupesh Choubey , Elke A. Rundensteiner, Bulk-insertions into R-trees using the small-tree-large-tree approach, Proceedings of the 6th ACM international symposium on Advances in geographic information systems, p.161-162, November 02-07, 1998, Washington, D.C., United States
	Scott T. Leutenegger , Mario A. López, The Effect of Buffering on the Performance of R-Trees, IEEE Transactions on Knowledge and Data Engineering, v.12 n.1, p.33-44, January 2000
	Kihong Kim , Sang K. Cha , Keunjoo Kwon, Optimizing multidimensional index trees for main memory access, ACM SIGMOD Record, v.30 n.2, p.139-150, June 2001
	Guido Proietti , Christos Faloutsos, Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree, IEEE Transactions on Knowledge and Data Engineering, v.12 n.5, p.751-762, September 2000
	Thomas Schreck , Zhengxin Chen, R-tree implementation using branch-grafting method, Proceedings of the 2000 ACM symposium on Applied computing, p.328-332, March 2000, Como, Italy
	Sang-Wook Kim , Sanghyun Park , Wesley W. Chu, Efficient processing of similarity search under time warping in sequence databases: an index-based approach, Information Systems, v.29 n.5, p.405-420, July 2004
	Lars Arge , Mark de Berg , Herman J. Haverkort , Ke Yi, The Priority R-tree: a practically efficient and worst-case optimal R-tree, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
	Ning An , Ji Jin , Anand Sivasubramaniam, Toward an Accurate Analysis of Range Queries on Spatial Data, IEEE Transactions on Knowledge and Data Engineering, v.15 n.2, p.305-323, February 2003
	Baihua Zheng , Wang-Chien Lee , Dik Lun Lee, Spatial queries in wireless broadcast systems, Wireless Networks, v.10 n.6, p.723-736, November 2004
	Yong-Jin Choi , Jun-Ki Min , Chin-Wan Chung, A cost model for spatio-temporal queries using the TPR-tree, Journal of Systems and Software, v.73 n.1, p.101-112, September 2004
	Dantong Yu , Aidong Zhang, ClusterTree: Integration of Cluster Representation and Nearest-Neighbor Search for Large Data Sets with High Dimensions, IEEE Transactions on Knowledge and Data Engineering, v.15 n.5, p.1316-1337, September 2003
	Ashraf Aboulnaga , Walid G. Aref, Window Query Processing in Linear Quadtrees, Distributed and Parallel Databases, v.10 n.2, p.111-126, September 2001
	Nikos Mamoulis , Dimitris Papadias, Slot Index Spatial Join, IEEE Transactions on Knowledge and Data Engineering, v.15 n.1, p.211-231, January 2003
	A. Belussi , E. Bertino , A. Nucita, Grid based methods for estimating spatial join selectivity, Proceedings of the 12th annual ACM international workshop on Geographic information systems, November 12-13, 2004, Washington DC, USA
	Hanan Samet, Object-based and image-based object representations, ACM Computing Surveys (CSUR), v.36 n.2, p.159-217, June 2004
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Journal of Algorithms, v.53 n.2, p.115-136, November 2004
	Raymond T. Ng , Dominic Tam, Multilevel Filtering for High-Dimensional Image Data: Why and How, IEEE Transactions on Knowledge and Data Engineering, v.11 n.6, p.916-928, November 1999
	Khaled Elbassioni , Amr Elmasry , Ibrahim Kamel, An Indexing Method for Answering Queries on Moving Objects, Distributed and Parallel Databases, v.17 n.3, p.215-249, March 2005
	Yufei Tao , Dimitris Papadias , Jun Zhang, Cost models for overlapping and multiversion structures, ACM Transactions on Database Systems (TODS), v.27 n.3, p.299-342, September 2002
	Shu-Ching Chen , Xinran Wang , Naphtali Rishe , Mark Allen Weiss, A web-based spatial data access system using semantic R-trees, Information Sciences—Informatics and Computer Science: An International Journal, v.167 n.1-4, p.41-61, 2 December 2004
	Yufei Tao , Dimitris Papadias, Range Aggregate Processing in Spatial Databases, IEEE Transactions on Knowledge and Data Engineering, v.16 n.12, p.1555-1570, December 2004
	Frank Dehne , Todd Eavis , Andrew Rau-Chaplin, Parallel querying of ROLAP cubes in the presence of hierarchies, Proceedings of the 8th ACM international workshop on Data warehousing and OLAP, November 04-05, 2005, Bremen, Germany
	Torsten Grust, Accelerating XPath location steps, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
	Antonio Corral , Yannis Manolopoulos , Yannis Theodoridis , Michael Vassilakopoulos, Cost models for distance joins queries using R-trees, Data & Knowledge Engineering, v.57 n.1, p.1-36, April 2006
	Alexandros Nanopoulos , Yannis Theodoridis , Yannis Manolopoulos, Indexed-based density biased sampling for clustering applications, Data & Knowledge Engineering, v.57 n.1, p.37-63, April 2006
	Gonzalo Navarro , Edgar Chávez, A metric index for approximate string matching, Theoretical Computer Science, v.352 n.1, p.266-279, 7 March 2006
	Apostolos Papadopoulos , Yannis Manolopoulos, Nearest Neighbor Queries in Shared-Nothing Environments, Geoinformatica, v.1 n.4, p.369-392, December 1997
	Yun-Wu Huang , Matthew Jones , Elke A. Rundensteiner, Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins, Geoinformatica, v.2 n.2, p.149-174, June 1998
	Nikos Mamoulis , Dimitris Papadias , Dinos Arkoumanis, Complex Spatial Query Processing, Geoinformatica, v.8 n.4, p.311-346, December 2004
	Ning An , Sudhanva Gurumurthi , Anand Sivasubramaniam , Narayanan Vijaykrishnan , Mahmut Kandemir , Mary Jane Irwin, Energy-performance trade-offs for spatial access methods on memory-resident data, The VLDB Journal — The International Journal on Very Large Data Bases, v.11 n.3, p.179-197, November 2002
	Seokjin Hong , Jinuk Bae , Taewon Lee , Sukho Lee, Histogram-by: A grouping operator for continuous domains, Data & Knowledge Engineering, v.60 n.3, p.451-467, March, 2007
	Marios Hadjieleftheriou , George Kollios , J. Tsotras , Dimitrios Gunopulos, Indexing spatiotemporal archives, The VLDB Journal — The International Journal on Very Large Data Bases, v.15 n.2, p.143-164, June 2006
	Taewon Lee , Bongki Moon , Sukho Lee, Bulk insertion for R-trees by seeded clustering, Data & Knowledge Engineering, v.59 n.1, p.86-106, October 2006
	Jimeng Sun , Yufei Tao , Dimitris Papadias , George Kollios, Spatio-temporal join selectivity, Information Systems, v.31 n.8, p.793-813, December 2006
	Susanne Hambrusch , Chuan-Ming Liu , Walid G. Aref , Sunil Prabhakar, Efficient query execution on broadcasted index tree structures, Data & Knowledge Engineering, v.60 n.3, p.511-529, March, 2007
	Houman Alborzi , Hanan Samet, Execution time analysis of a top-down R-tree construction algorithm, Information Processing Letters, v.101 n.1, p.6-12, 16 January 2007
	Jingren Zhou , Kenneth A. Ross, Buffering accesses to memory-resident index structures, Proceedings of the 29th international conference on Very large data bases, p.405-416, September 09-12, 2003, Berlin, Germany
	Gisli R. Hjaltason , Hanan Samet, Speeding up construction of PMR quadtree-based spatial indexes, The VLDB Journal — The International Journal on Very Large Data Bases, v.11 n.2, p.109-137, October 2002
	Stratos Papadomanolakis , Anastassia Ailamaki , Julio C. Lopez , Tiankai Tu , David R. O'Hallaron , Gerd Heber, Efficient query processing on unstructured tetrahedral meshes, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA
	Simonas Šaltenis , Christian S. Jensen, Indexing of now-relative spatio-bitemporal data, The VLDB Journal — The International Journal on Very Large Data Bases, v.11 n.1, p.1-16, August 2002
	Shu-Ching Chen , Xinran Wang , Naphtali Rishe , Mark Allen Weiss, A high-performance Web-based system design for spatial data accesses, Proceedings of the 8th ACM international symposium on Advances in geographic information systems, p.33-38, November 06-11, 2000, Washington, D.C., United States
	Alexandros Nanopoulos , Yannis Theodoridis , Yannis Manolopoulos, C2P: Clustering based on Closest Pairs, Proceedings of the 27th International Conference on Very Large Data Bases, p.331-340, September 11-14, 2001
	Ning An , Anand Sivasubramaniam , Narayanan Vijaykrishnan , Mahmut T. Kandemir , Mary Jane Irwin , Sudhanva Gurumurthi, Analyzing energy behavior of spatial access methods for memory-resident data, Proceedings of the 27th International Conference on Very Large Data Bases, p.411-420, September 11-14, 2001
	Jochen Van den Bercken , Bernhard Seeger, An Evaluation of Generic Bulk Loading Techniques, Proceedings of the 27th International Conference on Very Large Data Bases, p.461-470, September 11-14, 2001
	Ibrahim Kamel , Christos Faloutsos, Hilbert R-tree: An Improved R-tree using Fractals, Proceedings of the 20th International Conference on Very Large Data Bases, p.500-509, September 12-15, 1994
	Yun-Wu Huang , Ning Jing , Elke A. Rundensteiner, Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations, Proceedings of the 23rd International Conference on Very Large Data Bases, p.396-405, August 25-29, 1997
	Jochen Van den Bercken , Bernhard Seeger , Peter Widmayer, A Generic Approach to Bulk Loading Multidimensional Index Structures, Proceedings of the 23rd International Conference on Very Large Data Bases, p.406-415, August 25-29, 1997
	David J. DeWitt , Navin Kabra , Jun Luo , Jignesh M. Patel , Jie-Bing Yu, Client-Server Paradise, Proceedings of the 20th International Conference on Very Large Data Bases, p.558-569, September 12-15, 1994
	Yván J. García , Mario A. Lopez , Scott T. Leutenegger, On Optimal Node Splitting for R-trees, Proceedings of the 24rd International Conference on Very Large Data Bases, p.334-344, August 24-27, 1998
	Kenneth C. Sevcik , Nick Koudas, Filter Trees for Managing Spatial Data over a Range of Size Granularities, Proceedings of the 22th International Conference on Very Large Data Bases, p.16-27, September 03-06, 1996
	Victor Teixeira De Almeida , Ralf Hartmut Güting, Indexing the Trajectories of Moving Objects in Networks*, Geoinformatica, v.9 n.1, p.33-60, March 2005
	Xiaowei Xu , Jochen Jäger , Hans-Peter Kriegel, A Fast Parallel Clustering Algorithm for Large Spatial Databases, Data Mining and Knowledge Discovery, v.3 n.3, p.263-290, September 1999
	Li Chen , Rupesh Choubey , Elke A. Rundensteiner, Merging R-Trees: Efficient Strategies for Local Bulk Insertion, Geoinformatica, v.6 n.1, p.7-34, March 2002
	Yong-Ju Lee , Chin-Wan Chung, The DR-tree: A Main Memory Data Structure for Complex Multi-dimensional Objects, Geoinformatica, v.5 n.2, p.181-207, June 2001
	Jeffrey Scott Vitter, Algorithms and data structures for external memory, Foundations and Trends® in Theoretical Computer Science, v.2 n.4, p.305-474, January 2008
	Seon Ho Kim , Byunggu Yu , Jae-young Chang, Zoned-partitioning of tree-like access methods, Information Systems, v.33 n.3, p.315-331, May, 2008
	Todd Eavis , Alex Lopez, Rk-hist: an r-tree based histogram for multi-dimensional selectivity estimation, Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, November 06-10, 2007, Lisbon, Portugal
	Lars Arge , Mark De Berg , Herman Haverkort , Ke Yi, The priority R-tree: A practically efficient and worst-case optimal R-tree, ACM Transactions on Algorithms (TALG), v.4 n.1, p.1-30, March 2008
	Xiao Zhang , Wang-Chien Lee , Prasenjit Mitra , Baihua Zheng, Processing transitive nearest-neighbor queries in multi-channel access environments, Proceedings of the 11th international conference on Extending database technology: Advances in database technology, March 25-29, 2008, Nantes, France
	Tochukwu Iwuchukwu , Jeffrey F. Naughton, K-anonymization as spatial indexing: toward scalable and incremental anonymization, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
	Michael Morse , Jignesh M. Patel , William I. Grosky, Efficient evaluation of radial queries using the target tree, International Journal of Bioinformatics Research and Applications, v.3 n.1, p.24-41, December 2007
	Baihua Zheng , Wang-Chien Lee , Dik Lun Lee, On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems, IEEE Transactions on Mobile Computing, v.6 n.7, p.748-761, July 2007
	Kyriakos Mouratidis , Dimitris Papadias , Spiros Papadimitriou, Tree-based partition querying: a methodology for computing medoids in large spatial datasets, The VLDB Journal — The International Journal on Very Large Data Bases, v.17 n.4, p.923-945, July 2008
	Kai Xu , Xiaofang Zhou , Xuemin Lin , Heng Tao Shen , Ke Deng, A Multiresolution Terrain Model for Efficient Visualization Query Processing, IEEE Transactions on Knowledge and Data Engineering, v.18 n.10, p.1382-1396, October 2006