{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:44Z","timestamp":1763468084542},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312342"},{"type":"electronic","value":"9783642312359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31235-9_21","type":"book-chapter","created":{"date-parts":[[2012,6,14]],"date-time":"2012-06-14T12:12:45Z","timestamp":1339675965000},"page":"316-333","source":"Crossref","is-referenced-by-count":8,"title":["Finding the Largest Empty Rectangle Containing Only a Query Point in Large Multidimensional Databases"],"prefix":"10.1007","author":[{"given":"Gilberto","family":"Guti\u00e9rrez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 R.","family":"Param\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"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)"},{"key":"21_CR2","unstructured":"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)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/41958.41988","volume-title":"Proceedings of the Third Annual Symposium on Computational Geometry, SCG 1987","author":"A. Aggarwal","year":"1987","unstructured":"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\u2013290. ACM, New York (1987)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-44801-2_29","volume-title":"Data Warehousing and Knowledge Discovery","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Kriegel, H.-P.: Determining the Convex Hull in Large Multidimensional Databases. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol.\u00a02114, pp. 294\u2013306. Springer, Heidelberg (2001)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0215022","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Drysdalet, R.L., Lee, D.T.: Computing the largest empty rectangle. SIAM Journal Computing\u00a015, 300\u2013315 (1986)","journal-title":"SIAM Journal Computing"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A. Corral","year":"2004","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for processing k-closest-pair queries in spatial databases. Data & Knowledge Engineering\u00a049(1), 67\u2013104 (2004)","journal-title":"Data & Knowledge Engineering"},{"key":"21_CR7","unstructured":"Corral, A.: Algoritmos para el Procesamiento de Consultas Espaciales utilizando R-trees. La Consulta de los Pares M\u00e1s Cercanos y su Aplicaci\u00f3n en Bases de Datos Espaciales. PhD thesis, Universidad de Almer\u00eda, Escuela Polit\u00e9cnica Superior, Espa\u00f1a, Enero (2002)"},{"key":"21_CR8","unstructured":"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)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0304-3975(02)00738-7","volume":"296","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for empty spaces in large data sets. Theoretical Computer Science\u00a0296, 435\u2013452 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: ACM SIGMOD Conference on Management of Data, pp. 47\u201357. ACM (1984)","DOI":"10.1145\/971697.602266"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: ACM SIGMOD Conference on Management of Data, Seattle, WA, pp. 237\u2013248 (1998)","DOI":"10.1145\/276305.276326"},{"key":"21_CR13","unstructured":"King, J.J.: Query optimization by semantic reasoning. PhD thesis, Stanford University, CA, USA (1981)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Sharir, M.: Finding the maximal empty rectangle containing a query point. CoRR, abs\/1106.3628 (2011)","DOI":"10.1145\/2261250.2261292"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","volume":"8","author":"A. Naamad","year":"1984","unstructured":"Naamad, A., Lee, D.T., Hsu, W.-L.: On the maximum empty rectangle problem. Discrete Applied Mathematics\u00a08, 267\u2013277 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01840377","volume":"5","author":"M. Orlowski","year":"1990","unstructured":"Orlowski, M.: A new algorithm for the largest empty rectangle problem. Algorithmica\u00a05, 65\u201373 (1990)","journal-title":"Algorithmica"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/223784.223794","volume-title":"SIGMOD 1995: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data","author":"N. Roussopoulos","year":"1995","unstructured":"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\u201379. ACM Press, New York (1995)"},{"key":"21_CR18","unstructured":"Shekhar, S., Chawla, S.: Spatial databases - a tour. Prentice Hall (2003)"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31235-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:52:45Z","timestamp":1620129165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31235-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312342","9783642312359"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31235-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}