Yván J. García R
ABSTRACT
No abstract available.
- 1.Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B., '~he /{*-tree: an Efficient and robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, 323-331, 1990. Google Scholar
Digital Library
- 2.Garcia, Y.J, Lopez, M.A., Leutenegger, S.T., "A Greedy Algorithm for Bulk Loadin~ l~-Trees', University of Denver Technical Report ~ 97-02, www. cs.du.edu/users/leut/TGS.ps.Google Scholar
- 3.Guttmau, A., ""l{-trees: a Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, 47-57, 1984. Google ScholarDigital Library
- 4.Kamel, i., Faloutsos, C., "On Packing P~-trees", Proc. 2nd International Conference on Information and Knowledge Management, 490-499, 1993. Google ScholarDigital Library
- 5.Kamel, I., Faloutsos, C., "Hilbert R-tree: An improved R- tree Using Fractals", Proc. International Conference on Very Large Databases, 500-509, 1995. Google ScholarDigital Library
- 6.Leutenegger, S.T., Lopez, M.A., Edgington, J., "STR: A Simple and Efficient Algorithm for R-Tree Packing ,, Proc. 13th International Conference on Data Engineering, 497-506, 1997. Google ScholarDigital Library
- 7.Lopez, M.A., janardan, R., Sahni S., ':Efficient Net Extraction for Restricted Orientation Designs", 1EEE Transactions on Computer-Aided Design, Vol. 15, No 9, 1151-1159, 1996. Google ScholarDigital Library
- 8.Roussopoulos, N, Leifker, D., "Direct Spatial Search on Pictorial Databases Using Packed R-trees,", Proc. ACM SIG- MOD, 17-31, 1985. Google ScholarDigital Library
Index Terms
- A greedy algorithm for bulk loading R-trees
Recommendations
Sort-based query-adaptive loading of R-trees
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge managementBulk-loading of R-trees has been an important problem in academia and industry for more than twenty years. Current algorithms create R-trees without any information about the expected query profile. However, query profiles are extremely useful for the ...
Sort-based parallel loading of R-trees
BigSpatial '12: Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial DataDue to the increasing amount of spatial data, parallel algorithms for processing big spatial data become more and more important. In particular, the shared nothing architecture is attractive as it offers low cost data processing. Moreover, popular ...
Bulk-loading the ND-tree in non-ordered discrete data spaces
DASFAA'08: Proceedings of the 13th international conference on Database systems for advanced applicationsApplications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach to building such an index structure for a large data set is inefficient. ...
Comments