{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:38:24Z","timestamp":1781102304514,"version":"3.54.1"},"reference-count":25,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7,1]]},"abstract":"<p>Multi-dimensional data is present across multimedia, data mining and other data-driven applications. The R-Tree is a popular index structure that DBMSs are implementing as core for efficient retrieval of such data. The gap between the best and worst-case performance is very wide in an R-tree. Thus, building quality R-trees quickly is desirable. Variations differ in how node overflow are approached during the building process. This article studies the R-Tree technique that the open-source PostgreSQL DBMS uses. Focus is on a specific parameter controlling node overflows as an optimisation target, and improved configurations are proposed. This parameter is hard-wired into the DBMS, and therefore, an implementation is presented to allow this parameter to become accessible through an SQL construct. The access method designer can resort to configuring this parameter when trying to meet specific storage or time-related performance targets. With this study, the reader can gain an insight into the effects of changing the parameter by considering the spatial indexes on well-known workloads.<\/p>","DOI":"10.4018\/jcit.2019070103","type":"journal-article","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T09:03:57Z","timestamp":1556010237000},"page":"40-50","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Dimensional Indexes in DBMSs"],"prefix":"10.4018","volume":"21","author":[{"given":"Thomas","family":"Mercieca","sequence":"first","affiliation":[{"name":"Faculty of ICT, University of Malta, Msida, Malta"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph G.","family":"Vella","sequence":"additional","affiliation":[{"name":"Faculty of ICT, University of Malta, Msida, Malta"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"JCIT.2019070103-0","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63238-7_38"},{"key":"JCIT.2019070103-1","unstructured":"Aoki, P. M. (1998, February). Generalizing \u201csearch\u201d in generalized search trees. In Proceedings, 14th International Conference onData Engineering (pp. 380-389). IEEE."},{"key":"JCIT.2019070103-2","doi-asserted-by":"publisher","DOI":"10.1145\/93605.98741"},{"key":"JCIT.2019070103-3","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"JCIT.2019070103-4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"JCIT.2019070103-5","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"JCIT.2019070103-6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1989.47268"},{"key":"JCIT.2019070103-7","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"JCIT.2019070103-8","unstructured":"Hellerstein, J. M., Naughton, J. F., & Pfeffer, A. (1995). Generalized Search Trees for Database Systems. In Proceedings Of The 21th International Conference On Very Large Data Bases (pp. 562-573). San Francisco, CA: Morgan Kaufmann Publishers Inc."},{"key":"JCIT.2019070103-9","unstructured":"Introduction to PostGIS. Boundless. Retrieved 20 November 2017, from http:\/\/workshops.boundlessgeo.com\/postgis-intro\/"},{"key":"JCIT.2019070103-10","first-page":"500","article-title":"Hilbert R-tree: An Improved R-tree Using Fractals.","author":"I.Kamel","year":"1994","journal-title":"Proceedings of the 20th International Conference on Very Large Data Bases"},{"key":"JCIT.2019070103-11","unstructured":"Kornacker, M. (2000). Access Methods for Next-generation Database Systems [doctoral dissertation]. University of California, Berkeley."},{"key":"JCIT.2019070103-12","doi-asserted-by":"publisher","DOI":"10.1134\/S0361768812030024"},{"key":"JCIT.2019070103-13","unstructured":"Korotkov, A. (2016). Extensible Access Methods Are Committed to 9.6. Akorotkov.github.io. Retrieved from http:\/\/akorotkov.github.io\/blog\/2016\/04\/06\/extensible-access-methods\/"},{"key":"JCIT.2019070103-14","author":"Y.Manolopoulos","year":"2010","journal-title":"R-trees: Theory and Applications"},{"key":"JCIT.2019070103-15","author":"R.Obe","year":"2015","journal-title":"PostGIS in Action"},{"key":"JCIT.2019070103-16","author":"M.Owens","year":"2010","journal-title":"The definitive guide to SQLite"},{"key":"JCIT.2019070103-17","first-page":"43","article-title":"Performance Comparison of Spatial Indexing Structures for Different Query Types.","author":"N.Pant","year":"2016","journal-title":"Proceedings of 57th IRF International Conference"},{"key":"JCIT.2019070103-18","unstructured":"PostgreSQL: CREATE INDEX. (n.d.). Retrieved 20 November 2017, from https:\/\/www.postgresql.org\/docs\/9.6\/static\/sql-createindex.html"},{"key":"JCIT.2019070103-19","unstructured":"PostgreSQL: EXPLAIN. (n.d.). Retrieved 20 November 2017, from https:\/\/www.postgresql.org\/docs\/10\/static\/sql-explain.html"},{"key":"JCIT.2019070103-20","unstructured":"PostgreSQL: Release 6.5.1. (1999). Postgresql.org. Retrieved 20 November 2017, from https:\/\/www.postgresql.org\/docs\/10\/static\/release-6-5-1.html"},{"key":"JCIT.2019070103-21","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"JCIT.2019070103-22","first-page":"507","article-title":"The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.","author":"T. K.Sellis","year":"1987","journal-title":"Proceedings of the 13th international conference on very large data bases"},{"issue":"2","key":"JCIT.2019070103-23","first-page":"16","article-title":"Extendability in POSTGRES.","volume":"10","author":"M.Stonebraker","year":"1987","journal-title":"IEEE Data Eng. Bull."},{"key":"JCIT.2019070103-24","unstructured":"Understanding caching in Postgres - An in-depth guide. (2016). Madusudanan.com. Retrieved 20 November 2017, from https:\/\/madusudanan.com\/blog\/understanding-postgres-caching-in-depth\/"}],"container-title":["Journal of Cases on Information Technology"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=227677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T14:00:10Z","timestamp":1651845610000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/JCIT.2019070103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,7,1]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jcit.2019070103","relation":{},"ISSN":["1548-7717","1548-7725"],"issn-type":[{"value":"1548-7717","type":"print"},{"value":"1548-7725","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,1]]}}}