research-article

The priority R-tree

Author:

Ke YiAuthors Info & Claims

SIGSPATIAL Special, Volume 4, Issue 2

Pages 8 - 12

https://doi.org/10.1145/2367574.2367576

Published: 01 July 2012 Publication History

Get Access

References

[1]

P. K. Agarwal, M. de Berg, J. Gudmundsson, M. Hammar, and H. J. Haverkort, Box-trees and R-trees with near-optimal query time, Discrete and Computational Geometry, 28 (2002), pp. 291--312.

Digital Library

Google Scholar

[2]

L. Arge, M. de Berg, H. J. Haverkort, and K. Yi, The priority R-tree: A practically efficient and worst-case optimal R-tree, in Proc. SIGMOD International Conference on Management of Data, 2004, pp. 347--358.

Digital Library

Google Scholar

[3]

L. Arge, V. Samoladas, and J. S. Vitter, On two-dimensional indexability and optimal range search indexing, in Proc. ACM Symposium on Principles of Database Systems, 1999, pp. 346--357.

Digital Library

Google Scholar

[4]

L. Arge, V. Samoladas, and K. Yi, Optimal external memory planar point enclosure, in Proc. European Symposium on Algorithms, 2004.

Crossref

Google Scholar

[5]

N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in Proc. SIGMOD International Conference on Management of Data, 1990, pp. 322--331.

Digital Library

Google Scholar

[6]

D. J. DeWitt, N. Kabra, J. Luo, J. M. Patel, and J.-B. Yu, Client-server paradise, in Proc. International Conference on Very Large Databases, 1994, pp. 558--569.

Digital Library

Google Scholar

[7]

Y. J. García, M. A. López, and S. T. Leutenegger, A greedy algorithm for bulk loading R-trees, in Proc. 6th ACM Symposium on Advances in GIS, 1998, pp. 163--164.

Digital Library

Google Scholar

[8]

A. Guttman, R-trees: A dynamic index structure for spatial searching, in Proc. SIGMOD International Conference on Management of Data, 1984, pp. 47--57.

Digital Library

Google Scholar

[9]

I. Kamel and C. Faloutsos, On packing R-trees, in Proc. International Conference on Information and Knowledge Management, 1993, pp. 490--499.

Digital Library

Google Scholar

[10]

I. Kamel and C. Faloutsos, Hilbert R-tree: An improved R-tree using fractals, in Proc. International Conference on Very Large Databases, 1994, pp. 500--509.

Digital Library

Google Scholar

[11]

K. V. R. Kanth and A. K. Singh, Optimal dynamic range searching in non-replicating index structures, in Proc. International Conference on Database Theory, LNCS 1540, 1999, pp. 257--276.

Digital Library

Google Scholar

[12]

S. T. Leutenegger, M. A. Lopez, and J. Edington, STR: A simple and efficient algorithm for R-tree packing, in Proc. 13th IEEE International Conference on Data Engineering, 1997, pp. 497--506.

Digital Library

Google Scholar

[13]

Y. Manolopoulos, A. Nanopoulos, A. N. Papadopoulos, and Y. Theodoridis, R-trees: Theory and Applications, Springer, 2005.

Digital Library

Google Scholar

[14]

T. Sellis, N. Roussopoulos, and C. Faloutsos, The R⁺-tree: A dynamic index for multi-dimensional objects, in Proc. International Conference on Very Large Databases, 1987, pp. 507--518.

Digital Library

Google Scholar

Cited By

View all

Sureshkumar TLingaraj MAnand BPremkumar T(2018)Hybrid firefly bat algorithm (HFBA)–based network security policy enforcement for PSAInternational Journal of Communication Systems10.1002/dac.374031:14Online publication date: 11-Jul-2018
https://doi.org/10.1002/dac.3740

The priority R-tree

Recommendations

The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data

We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)¹ ^1/d + T/B) I/Os, where N is the number of d-dimensional (hyper-) rectangles stored in the R-tree, B is the disk block size, ...
M/G/1/r retrial queueing systems with priority of primary customers

We analyze a single-server retrial queueing system with finite buffer, Poisson arrivals, and general distribution of service time. If an arriving customer finds the queue completely occupied he joins a retrial group (or orbit) in order to seek service ...
The impact of priority generations in a multi-priority queueing system: a simulation approach
WSC '09: Winter Simulation Conference

In this paper, we consider a preemptive (multiple) priority queueing model in which arrivals occur according to a Markovian arrival process (MAP). An arriving customer belongs to priority type i, 1 ≤ i ≤ m+1, with probability p_i. The highest priority, ...

Comments

Information & Contributors

Information

Published In

SIGSPATIAL Special Volume 4, Issue 2

July 2012

26 pages

EISSN:1946-7729

DOI:10.1145/2367574

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2012

Published in SIGSPATIAL Volume 4, Issue 2

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
122
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sureshkumar TLingaraj MAnand BPremkumar T(2018)Hybrid firefly bat algorithm (HFBA)–based network security policy enforcement for PSAInternational Journal of Communication Systems10.1002/dac.374031:14Online publication date: 11-Jul-2018
https://doi.org/10.1002/dac.3740

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

References

Cited By

Recommendations