Ibrahim Kamel
Christos Faloutsos
- 1.Walid G. Aref and Hanan Samet. Optimization strategies for spatial query processing. Proc. of VLDB (Very Large Da~a Bases), pages 81-90, September 1991. Google Scholar
Digital Library
- 2.N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: an efficient and robust access method for points and rectangles. A CM $IG- MOD, pages 322-331, May 1990. Google ScholarDigital Library
- 3.J.L. Bentley. Multidimensional binary search trees used for associative searching. CA CM, 18(9):509- 517, September 1975. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 5.C. Faloutsos. Gray codes for partial match and range queries. IEEE Trans. on Software Engineering, 14(10):1381-1393, October 1988. early version available as UMIACS-TR-87-4, also CS-TR- 1796. Google ScholarDigital Library
- 6.C. Faloutsos and S. Roseman. Fractals for secondary key retrieval. Eighth A CM SIGA CT- SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 247-252, March 1989. also available as UMIACS-TR-89-47 and CS- TR-2242. Google ScholarDigital Library
- 7.I. Gargantini. An effective way to represent quadtrees. Comm. of A CM (CA CM), 25(12):905- 910, December 1982. Google ScholarDigital Library
- 8.D. Greene. An implementation and performance analysis of spatial data access methods. Proc. of Data Engineering, pages 606-615, 1989. Google ScholarDigital Library
- 9.J.G. Griflqths. An algorithm for displaying a class of space-filling curves. Software-Practice and Experience, 16(5):403-411, May 1986. Google ScholarDigital Library
- 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.Google Scholar
- 11.A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. A CM $IGMOD, pages 47-57, June 1984. Google ScholarDigital Library
- 12.L. M. Haas, J. C. Freytag, G. M. Lohman, and H. Pirahesh. Extensible query processing in starburst. Proc. A CM-SIGMOD 1989 Int'l Conf. Management of Data, pages 377-388, May 1989. Google ScholarDigital Library
- 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.Google Scholar
- 14.H. V. Jagadish. Spatial search with polyhedra. Proc. Sizth iEEE Int'l Conf. on Data Engineering, February 1990. Google ScholarDigital Library
- 15.H.V. Jagadish. Linear clustering of objects with multiple attributes. A CM $iGMOD Conf., pages 332-342, May 1990. Google ScholarDigital Library
- 16.Curtis P. Kolovson and Michael Stonebraker. Segmen~ indexes: Dynamic indexing techniques for multi-dimensional interval data. Proc. A CM SIG- MOD, pages 138-147, May 1991. Google ScholarDigital Library
- 17.David B. Lomet and Betty Salzberg. The hb-tree: a multiattribute indexing method with good guaranteed performance. ACM TOD$, 15(4):625-658, December 1990. Google ScholarDigital Library
- 18.B. Mandelbrot. Fractal Geometry of Nature. W.H. Freeman, New York, 1977.Google Scholar
- 19.J. Orenstein. Spatial query processing in an objectoriented database system. Proc. A CM $I~MOD, pages 326-336, May 1986. Google ScholarDigital Library
- 20.j.T. Robinson. The k-d-b-tree: a search structure for large multidimensional dynamic indexes. Proc. ACM $IGMOD, pages 10-18, 1981. Google ScholarDigital Library
- 21.N. Roussopoulos and D. Leifker. Direct spatial search on pictorial databases using packed r-trees. Proc. A CM $IGMOD, May 1985. Google ScholarDigital Library
- 22.H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1989. Google ScholarDigital Library
- 23.T. Sellis, N. Roussopoulos, and C. Faloutsos. The r+ tree: a dynamic index for multi-dimensional objects. In Proc. 13ih International Con,t~rence on VLDB, pages 507-518, England,, September 1987. also available as $RC-TR-87-32, UMIACS-TR-87- 3, CS-TR-1795. Google ScholarDigital Library
Index Terms
- On packing R-trees
Recommendations
Packing R-trees with Space-filling Curves: Theoretical Optimality, Empirical Efficiency, and Bulk-loading Parallelizability
Best of ICDT 2019 and Regular PapersThe massive amount of data and large variety of data distributions in the big data era call for access methods that are efficient in both query processing and index management, and over both practical and worst-case workloads. To address this need, we ...
Parallel R-trees
SIGMOD '92: Proceedings of the 1992 ACM SIGMOD international conference on Management of dataWe consider the problem of exploiting parallelism to accelerate the performance of spacial access methods and specifically, R-trees [11]. Our goal is to design a server for spatial data, so that to maximize the throughput of range queries. This can be ...
Master-Client R-Trees: A New Parallel R-Tree Architecture
SSDBM '99: Proceedings of the 11th International Conference on Scientific and Statistical Database ManagementScientific databases must be able to efficiently run subset retrievals of multi-dimensional data sets. If the data sets are very large significant retrieval speedups can be obtained via parallelism. In this paper we present a new parallel distributed ...
Comments