Yannis Theodoridis
Timos Sellis
- BKSS90.N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, "The R*-tree: an efficient and robust access method for points and rectangles", In Proceedings of ACM SIGMOD Conference on Management of Data, May 1990. Google Scholar
Digital Library
- Com79.D. Comer, "The Ubiquitous B-Tree", ACM Computing Surveys, vol. 11 (2), pp. 121-137, June 1979. Google ScholarDigital Library
- FK94.C. Faloutsos, I. KameI, "Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension", In Proceedings of the 13th A CM Symposium on Principles of Database Systems (PODS), May 1994. Google ScholarDigital Library
- Fre87.M. Frecston, "The BANG file: a new kind of grid file", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1987. Google ScholarDigital Library
- FSR87.C. Faloutsos, T. Sellis, N. Roussopoulos, "Analysis of Object Oriented Spatial Access Methods", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1987. Google ScholarDigital Library
- Gut84.A. Guttman, "R-trees: a dynamic index structure for spatial searching", In Proceedings of A CM SIGMOD Conference on Management of Data, June 1984. Google ScholarDigital Library
- Gut94.R.H. Guting, "An Introduction to Spatial Database Systems", VLDB Journal, vol.3(4), pp. 357-399, October 1994. Google ScholarDigital Library
- HSW89.A. Henrich, H.-W. Six, P. Widmayer, "The LSD tree: spatial access to multidimensional point and non point objects", In Proceedings of the 15th international Conference on Very Large Data Bases (VLDB), August 1989. Google ScholarDigital Library
- KF93.I. Kamel, C. Faloutsos, "On Packing R-trees", In Proceedings of the 2nd International Conference on bzformation and Knowledge Management (CIKM), November 1993. Google ScholarDigital Library
- KF94.I. Kamel, C. Faloutsos, "Hilbert R-tree: An Improved R-tree Using Fractals", In Proceedings of the 20th International Conference on Very. Large Data Bases (VLDB), September 1994. Google ScholarDigital Library
- Knu73.D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Addison- Wesley, Reading, MA, 1973. Google ScholarDigital Library
- Knu81.D. Knuth, The Art of Computer Programming, vol.2, Addison Wesley, 1981. Google ScholarDigital Library
- NHS84.J. Nievergelt, H. Hinterberger, K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey file Structure", A CM Transactions on Database Systems, vol.9(1), pp. 38-71, March 1984. Google ScholarDigital Library
- PSTW93.B.-U. Pagel, H.-W. Six, H. Toben, P. Widmayer, "Towards an Analysis of Range Query performance", in Proceedings of the 12th ACM Symposium on Principles of Database Systems (PODS), May 1993. Google ScholarDigital Library
- PSW95.B.-U. Pagel, H.-W. Six, M. Winter, "Window Query-Optimal Clustering of Spatial Objects", In Proceedings of the 14th A CM Symposium on Principles of Database Systems (PODS), May 1995. Google ScholarDigital Library
- PTSE95.D. Papadias, Y. Theodoridis, T. Sellis, M.J. Egenhofer, "Topological Relations in the World of Minimum Bounding Rectangles: a Study with R-trees", in Proceedings of A CM SIGMOD Conference on Management of Data, May 1995. Google ScholarDigital Library
- RKV95.N. Roussopoulos, S. Kelley, F. Vincent, "Nearest Neighbor Queries", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1995. Google ScholarDigital Library
- RL85.N. Roussopoulos, D. Leifker, "Direct Spatial Search on Pictorial Databases Using Packed R-trees", In Proceedings of A CM SIGMOD Conference on Management of Data, May 1985. Google ScholarDigital Library
- SRF87.T. Sellis, N. Roussopoulos, C. Faloutsos, "The R+-tree: a dynamic index for multidimensional objects", In Proceedings of the 13th International Conference on Very Large Data Bases (VLDB), September 1987. Google ScholarDigital Library
- TS94.Y. Theodoridis, T. Sellis, "Optimization Issues in R-tree Construction", In Proceedings of International Workshop on Geographic Information Systems (IGIS), March 1994. Google ScholarDigital Library
- TP95.Y. Theodoridis, D. Papadias, "Range Queries Involving Spatial Relations: A Performance Analysis", In Proceedings of the 2nd International Conference on Spatial hzformation Theory (COSIT), September 1995.Google Scholar
- TVS96.Y. Theodoridis, M. Vazirgiannis, T. Sellis, "Spatio-Temporal Indexing for Large Multimedia Applications", In Proceedings of the 3rd IEEE Conference on Multimedia Computing and Systems (ICMCS), June 1996. Google ScholarDigital Library
- Vit84.J.S. Vitter, "Faster Methods for Random Sampling", Communications of the A CM, vol. 27(7), pp. 703-718, July 1984. Google ScholarDigital Library
- Vit85.J.S. Vitter, "Random Sampling with Reservoir", A CM Transactions on Mathematical Software, vol. 11, pp. 37-57, March 1985. Google ScholarDigital Library
Index Terms
- A model for the prediction of R-tree performance
Recommendations
Temporally enhanced network-constrained (TENC) R-tree
MobiGIS '16: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information SystemsThis paper describes a new Network-constrained Moving objects indexing structure, which extends the state-of-the-art for this kind of data. The indexing structure we propose is called Temporally Enhanced Network-Constrained R-tree (TENC R-tree), which ...
Performance of R-Tree with Slim-Down and Reinsertion Algorithm
ICSAP '10: Proceedings of the 2010 International Conference on Signal Acquisition and ProcessingWith the development of information technology, the amount of the multimedia data become more and more. The growth of these data brings the need for more effective methods in retrieval. The multimedia retrieval systems always index these data on the ...
The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation
IDEAS '07: Proceedings of the 11th International Database Engineering and Applications SymposiumIn multi-dimensional database environments, we typically require effective indexing mechanisms for all but the smallest data sets. While numerous such methods have been proposed, the R-tree has emerged as one of the most common and reliable indexing ...
Comments