Article

Free access

A greedy algorithm for bulk loading R-trees

Authors:

Yván J. García R,

Mario A. López,

Scott T. LeuteneggerAuthors Info & Claims

GIS '98: Proceedings of the 6th ACM international symposium on Advances in geographic information systems

Pages 163 - 164

https://doi.org/10.1145/288692.288723

Published: 01 November 1998 Publication History

PDF eReader

Abstract

No abstract available.

References

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[4]

Kamel, i., Faloutsos, C., "On Packing P~-trees", Proc. 2nd International Conference on Information and Knowledge Management, 490-499, 1993.

Digital Library

Google Scholar

[5]

Kamel, I., Faloutsos, C., "Hilbert R-tree: An improved R- tree Using Fractals", Proc. International Conference on Very Large Databases, 500-509, 1995.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[8]

Roussopoulos, N, Leifker, D., "Direct Spatial Search on Pictorial Databases Using Packed R-trees,", Proc. ACM SIG- MOD, 17-31, 1985.

Digital Library

Google Scholar

Cited By

View all

Huang SWang YLi G(2023)ACR-Tree: Constructing R-Trees Using Deep Reinforcement LearningDatabase Systems for Advanced Applications10.1007/978-3-031-30637-2_6(80-96)Online publication date: 14-Apr-2023
https://doi.org/10.1007/978-3-031-30637-2_6
Moti MSimatis PPapadias D(2022)WaffleProceedings of the VLDB Endowment10.14778/3574245.357425316:4(670-683)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.14778/3574245.3574253
Rasool ZZhou RChen LLiu CXu J(2022)Index-Based Solutions for Efficient Density Peak ClusteringIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.300422134:5(2212-2226)Online publication date: 1-May-2022
https://doi.org/10.1109/TKDE.2020.3004221
Show More Cited By

Index Terms

Recommendations

Sort-based query-adaptive loading of R-trees
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management

Bulk-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 Data

Due 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 applications

Applications 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

Information & Contributors

Information

Published In

GIS '98: Proceedings of the 6th ACM international symposium on Advances in geographic information systems

November 1998

169 pages

ISBN:1581131151

DOI:10.1145/288692

Chairmen:
Kia Makki
Univ. of Southern Louisiana
,
Niki Pissinou
Univ. of Southern Louisiana
,
Robert Laurini
Claude Benard Univ. of Lyon, France

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM98

Sponsor:

CIKM98: Seventh International Conference on Information and Knowledge Management

November 2 - 7, 1998

D.C., Washington, USA

Acceptance Rates

Overall Acceptance Rate 220 of 1,116 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
1,201
Total Downloads

Downloads (Last 12 months)173
Downloads (Last 6 weeks)20

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Huang SWang YLi G(2023)ACR-Tree: Constructing R-Trees Using Deep Reinforcement LearningDatabase Systems for Advanced Applications10.1007/978-3-031-30637-2_6(80-96)Online publication date: 14-Apr-2023
https://doi.org/10.1007/978-3-031-30637-2_6
Moti MSimatis PPapadias D(2022)WaffleProceedings of the VLDB Endowment10.14778/3574245.357425316:4(670-683)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.14778/3574245.3574253
Rasool ZZhou RChen LLiu CXu J(2022)Index-Based Solutions for Efficient Density Peak ClusteringIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.300422134:5(2212-2226)Online publication date: 1-May-2022
https://doi.org/10.1109/TKDE.2020.3004221
Guan YLu RZheng YZhang SShao JWei G(2022)Achieving Privacy-Preserving Discrete Frchet Distance Range QueriesIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2022.3171980(1-1)Online publication date: 2022
https://doi.org/10.1109/TDSC.2022.3171980
Lawson MGropp WLofstead J(2022)Exploring Spatial Indexing for Accelerated Feature Retrieval in HPC2022 22nd IEEE International Symposium on Cluster, Cloud and Internet Computing (CCGrid)10.1109/CCGrid54584.2022.00070(605-614)Online publication date: May-2022
https://doi.org/10.1109/CCGrid54584.2022.00070
Kalay M(2021) Novel approaches on bulk‐loading of large scale spatial datasets Concurrency and Computation: Practice and Experience10.1002/cpe.659634:9Online publication date: 10-Sep-2021
https://doi.org/10.1002/cpe.6596
Holst KGlasby RErwin JStefanski DProsser DAnderson WWood S(2020) Current Status of the COFFE Solver within HPCMP CREATE TM -AV Kestrel AIAA Scitech 2020 Forum10.2514/6.2020-1530Online publication date: 5-Jan-2020
https://doi.org/10.2514/6.2020-1530
Qi JLiu GJensen CKulik L(2020)Effectively learning spatial indicesProceedings of the VLDB Endowment10.14778/3407790.340782913:12(2341-2354)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407829
Yu AMei W(2019)Index model based on top-down greedy splitting R-tree and three-dimensional quadtree for massive point cloud managementJournal of Applied Remote Sensing10.1117/1.JRS.13.02850113:02(1)Online publication date: 1-Apr-2019
https://doi.org/10.1117/1.JRS.13.028501
Lai CWang TLiu CWang L(2019)Probabilistic Top-${k}$ Dominating Query Monitoring Over Multiple Uncertain IoT Data Streams in Edge Computing EnvironmentsIEEE Internet of Things Journal10.1109/JIOT.2019.29209086:5(8563-8576)Online publication date: Oct-2019
https://doi.org/10.1109/JIOT.2019.2920908
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Sort-based query-adaptive loading of R-trees

Sort-based parallel loading of R-trees

Bulk-loading the ND-tree in non-ordered discrete data spaces

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Sort-based query-adaptive loading of R-trees

Sort-based parallel loading of R-trees

Bulk-loading the ND-tree in non-ordered discrete data spaces

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations