Abstract
Given a two-dimensional space, let S be a set of points stored in an R-tree, let R be the minimum rectangle containing the elements of S, and let q be a query point such that q ∉ S and R ∩ q ≠ ∅. In this paper, we present an algorithm for finding the empty rectangle with the largest area, sides parallel to the axes of the space, and containing only the query point q. The idea behind algorithm is to use the points that define the minimum bounding rectangles (MBRs) of some internal nodes of the R-tree to avoid reading as many nodes of the R-tree as possible, given that a naive algorithm must access all of them. We present several experiments considering synthetic and real data. The results show that our algorithm uses around 0.71–38% of the time and around 3–4% of the main storage needed by previous computational geometry algorithms. Furthermore, to the best of our knowledge, this is the first work that solves this problem considering that the points are stored in an R-tree.
This work was supported in part by the project MECESUP UBB0704 (Chile) in the context of a postdoctoral stay of the first author at the University of A Coruña (Spain); and (for second author) by the Spanish Ministerio de Educación y Ciencia [TIN2010-21246-C02-01].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Augustine, J., Das, S., Maheshwari, A., Nandy, S.C., Roy, S., Sarvattomananda, S.: Recognizing the largest empty circle and axis-parallel rectangle in a desired location. CoRR, abs/1004.0558 (2010)
Augustine, J., Das, S., Maheshwari, A., Nandy, S.C., Roy, S., Sarvattomananda, S.: Querying for the largest empty geometric object in a desired location. CoRR, abs/1004.0558v2 (2010)
Aggarwal, A., Suri, S.: Fast algorithms for computing the largest empty rectangle. In: Proceedings of the Third Annual Symposium on Computational Geometry, SCG 1987, pp. 278–290. ACM, New York (1987)
Böhm, C., Kriegel, H.-P.: Determining the Convex Hull in Large Multidimensional Databases. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 294–306. Springer, Heidelberg (2001)
Chazelle, B., Drysdalet, R.L., Lee, D.T.: Computing the largest empty rectangle. SIAM Journal Computing 15, 300–315 (1986)
Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for processing k-closest-pair queries in spatial databases. Data & Knowledge Engineering 49(1), 67–104 (2004)
Corral, A.: Algoritmos para el Procesamiento de Consultas Espaciales utilizando R-trees. La Consulta de los Pares Más Cercanos y su Aplicación en Bases de Datos Espaciales. PhD thesis, Universidad de Almería, Escuela Politécnica Superior, España, Enero (2002)
De, M., Nandy, S.C.: Inplace algorithm for priority search tree and its use in computing largest empty axis-parallel rectangle. CoRR, abs/1104.3076 (2011)
Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for empty spaces in large data sets. Theoretical Computer Science 296, 435–452 (2003)
Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170–231 (1998)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: ACM SIGMOD Conference on Management of Data, pp. 47–57. ACM (1984)
Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: ACM SIGMOD Conference on Management of Data, Seattle, WA, pp. 237–248 (1998)
King, J.J.: Query optimization by semantic reasoning. PhD thesis, Stanford University, CA, USA (1981)
Kaplan, H., Sharir, M.: Finding the maximal empty rectangle containing a query point. CoRR, abs/1106.3628 (2011)
Naamad, A., Lee, D.T., Hsu, W.-L.: On the maximum empty rectangle problem. Discrete Applied Mathematics 8, 267–277 (1984)
Orlowski, M.: A new algorithm for the largest empty rectangle problem. Algorithmica 5, 65–73 (1990)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD 1995: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 71–79. ACM Press, New York (1995)
Shekhar, S., Chawla, S.: Spatial databases - a tour. Prentice Hall (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutiérrez, G., Paramá, J.R. (2012). Finding the Largest Empty Rectangle Containing Only a Query Point in Large Multidimensional Databases. In: Ailamaki, A., Bowers, S. (eds) Scientific and Statistical Database Management. SSDBM 2012. Lecture Notes in Computer Science, vol 7338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31235-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-31235-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31234-2
Online ISBN: 978-3-642-31235-9
eBook Packages: Computer ScienceComputer Science (R0)