Information Processing Letters, volume 101, issue 1, pages 6-12
Execution time analysis of a top-down R-tree construction algorithm
Publication type: Journal Article
Publication date: 2007-01-01
Journal:
Information Processing Letters
Q3
Q4
SJR: 0.404
CiteScore: 1.8
Impact factor: 0.7
ISSN: 00200190, 18726119
Computer Science Applications
Information Systems
Theoretical Computer Science
Signal Processing
Abstract
A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to Garcia et al. [Y.J. Garcia, M.A. Lopez, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS'98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163-164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches.
Found
Found
Top-30
Journals
|
1
|
|
|
International Journal of Data Warehousing and Mining
1 publication, 7.14%
|
|
|
Health and Place
1 publication, 7.14%
|
|
|
Concurrency Computation Practice and Experience
1 publication, 7.14%
|
|
|
IEEE Internet of Things Journal
1 publication, 7.14%
|
|
|
Journal of Navigation
1 publication, 7.14%
|
|
|
Mathematical Problems in Engineering
1 publication, 7.14%
|
|
|
IEEE Transactions on Aerospace and Electronic Systems
1 publication, 7.14%
|
|
|
1
|
Publishers
|
1
2
3
4
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
4 publications, 28.57%
|
|
|
IGI Global
1 publication, 7.14%
|
|
|
Elsevier
1 publication, 7.14%
|
|
|
Wiley
1 publication, 7.14%
|
|
|
Cambridge University Press
1 publication, 7.14%
|
|
|
Hindawi Limited
1 publication, 7.14%
|
|
|
1
2
3
4
|
- We do not take into account publications without a DOI.
- Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
Cite this
GOST |
RIS |
BibTex |
MLA
Cite this
GOST
Copy
Alborzi H., SAMET H. Execution time analysis of a top-down R-tree construction algorithm // Information Processing Letters. 2007. Vol. 101. No. 1. pp. 6-12.
GOST all authors (up to 50)
Copy
Alborzi H., SAMET H. Execution time analysis of a top-down R-tree construction algorithm // Information Processing Letters. 2007. Vol. 101. No. 1. pp. 6-12.
Cite this
RIS
Copy
TY - JOUR
DO - 10.1016/j.ipl.2006.07.010
UR - https://doi.org/10.1016/j.ipl.2006.07.010
TI - Execution time analysis of a top-down R-tree construction algorithm
T2 - Information Processing Letters
AU - Alborzi, Houman
AU - SAMET, HANAN
PY - 2007
DA - 2007/01/01
PB - Elsevier
SP - 6-12
IS - 1
VL - 101
SN - 0020-0190
SN - 1872-6119
ER -
Cite this
BibTex (up to 50 authors)
Copy
@article{2007_Alborzi,
author = {Houman Alborzi and HANAN SAMET},
title = {Execution time analysis of a top-down R-tree construction algorithm},
journal = {Information Processing Letters},
year = {2007},
volume = {101},
publisher = {Elsevier},
month = {jan},
url = {https://doi.org/10.1016/j.ipl.2006.07.010},
number = {1},
pages = {6--12},
doi = {10.1016/j.ipl.2006.07.010}
}
Cite this
MLA
Copy
Alborzi, Houman, and HANAN SAMET. “Execution time analysis of a top-down R-tree construction algorithm.” Information Processing Letters, vol. 101, no. 1, Jan. 2007, pp. 6-12. https://doi.org/10.1016/j.ipl.2006.07.010.