{"id":1617,"date":"2014-12-16T19:32:12","date_gmt":"2014-12-16T19:32:12","guid":{"rendered":"https:\/\/www.couchbase.com\/blog\/?p=1617"},"modified":"2019-03-24T04:56:28","modified_gmt":"2019-03-24T11:56:28","slug":"geocouch-bulk-insertion","status":"publish","type":"post","link":"https:\/\/www.couchbase.com\/blog\/pt\/geocouch-bulk-insertion\/","title":{"rendered":"GeoCouch: Inser\u00e7\u00e3o em massa"},"content":{"rendered":"<p>O <a href=\"\/blog\/pt\/new-release-geocouch-extension\/\">nova vers\u00e3o<\/a>\u00a0de\u00a0<a href=\"https:\/\/github.com\/couchbase\/geocouch\">GeoCouch<\/a>\u00a0melhora muito o tempo de cria\u00e7\u00e3o do \u00edndice espacial (at\u00e9 10 vezes). Isso se deve ao uso de um novo algoritmo de inser\u00e7\u00e3o em massa. O \u00edndice espacial (um\u00a0<a href=\"https:\/\/en.wikipedia.org\/wiki\/R-tree\">\u00c1rvore R<\/a>) \u00e9 implementado como uma estrutura de dados somente de acr\u00e9scimo - assim como as \u00e1rvores B do CouchDB - que se beneficia da natureza das inser\u00e7\u00f5es em massa, permitindo que grandes blocos do \u00edndice sejam acrescentados de uma s\u00f3 vez.<\/p>\n<p class=\"rtecenter\" style=\"padding: 0px; margin: 0px 0px 1em 0px;\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-medium wp-image-5296\" src=\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2014\/12\/insertion-single007-300x248.png\" alt=\"\" width=\"300\" height=\"248\" srcset=\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2014\/12\/insertion-single007-300x248.png 300w, https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2014\/12\/insertion-single007-20x17.png 20w, https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2014\/12\/insertion-single007.png 517w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/p>\n<h2 style=\"font-size: 1.7em; font-weight: bold; padding: 0px; margin: 1em 0px 1em 0px;\">Implementa\u00e7\u00e3o antiga<\/h2>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">Nas vers\u00f5es anteriores do GeoCouch, cada entrada de geometria era inserida uma a uma. Isso gerava uma enorme quantidade de pequenas opera\u00e7\u00f5es de disco, pois cada adi\u00e7\u00e3o era gravada no \u00edndice. Aqui est\u00e1 um resumo do algoritmo antigo.<\/p>\n<ul style=\"padding: 0px; margin: 0px 1em 0px 2em;\">\n<li style=\"list-style-type: disc; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">Iniciar no n\u00f3 raiz<\/li>\n<li style=\"list-style-type: disc; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">Encontre o primeiro filho cuja caixa delimitadora precise de menos expans\u00e3o<\/li>\n<li style=\"list-style-type: disc; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">Percorrer a R-Tree at\u00e9 atingir a folha de destino<\/li>\n<li style=\"list-style-type: disc; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">Inserir o novo n\u00f3 em um n\u00f3 folha<\/li>\n<li style=\"list-style-type: disc; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">Reescreva todos os n\u00f3s no caminho do n\u00f3 rec\u00e9m-inserido at\u00e9 o n\u00f3 raiz<\/li>\n<\/ul>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">As primeiras etapas s\u00e3o as etapas b\u00e1sicas necess\u00e1rias para uma inser\u00e7\u00e3o em qualquer implementa\u00e7\u00e3o de \u00e1rvore R. O problema com esse m\u00e9todo \u00e9 que, ao usar uma estrutura de dados append-only, \u00e9 necess\u00e1rio um grande n\u00famero de grava\u00e7\u00f5es, pois todos os n\u00f3s, desde o n\u00f3 inserido at\u00e9 o n\u00f3 raiz, precisam ser reescritos e anexados ao \u00edndice. Voc\u00ea pode encontrar mais informa\u00e7\u00f5es sobre a natureza das estruturas de dados append-only em meu artigo\u00a0<a href=\"https:\/\/vmx.cx\/couchdb\/tutorial\/indexer.html\">Tutorial de cria\u00e7\u00e3o de um novo indexador<\/a><\/p>\n<h2 style=\"font-size: 1.7em; font-weight: bold; padding: 0px; margin: 1em 0px 1em 0px;\">Implementa\u00e7\u00e3o atual<\/h2>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-medium wp-image-5298\" src=\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2014\/12\/insertion-bulk008-300x191.png\" alt=\"\" width=\"300\" height=\"191\" srcset=\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2014\/12\/insertion-bulk008-300x191.png 300w, https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2014\/12\/insertion-bulk008-768x490.png 768w, https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2014\/12\/insertion-bulk008-20x13.png 20w, https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2014\/12\/insertion-bulk008.png 800w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/p>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">O \u00edndice espacial \u00e9 implementado de forma semelhante \u00e0s exibi\u00e7\u00f5es; o \u00edndice \u00e9 atualizado quando \u00e9 feita uma solicita\u00e7\u00e3o para us\u00e1-lo, e n\u00e3o quando um novo documento \u00e9 inserido. O resultado \u00e9 que, quando o \u00edndice \u00e9 acessado, ele precisa acompanhar o documento inserido mais recentemente. Assim que mais de um documento \u00e9 alterado, faz mais sentido process\u00e1-lo em massa, reduzir as modifica\u00e7\u00f5es no disco do \u00edndice e melhorar o desempenho geral da atualiza\u00e7\u00e3o.<\/p>\n<h3 style=\"font-size: 17px; font-weight: bold; padding: 0px; margin: 1em 0px 1em 0px;\">Carregamento e inser\u00e7\u00e3o a granel<\/h3>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">H\u00e1 uma diferen\u00e7a entre carregamento em massa e inser\u00e7\u00e3o em massa. Carregamento significa a cria\u00e7\u00e3o de uma nova estrutura de dados a partir do zero. J\u00e1 a inser\u00e7\u00e3o em massa significa que v\u00e1rios itens novos s\u00e3o inseridos em uma estrutura j\u00e1 existente. A implementa\u00e7\u00e3o do GeoCouch precisa de ambos e se baseia principalmente em dois documentos. Para a inser\u00e7\u00e3o\u00a0<a href=\"https:\/\/www.cs.arizona.edu\/~bkmoon\/papers\/dke06-bulk.pdf\">Inser\u00e7\u00e3o em massa para \u00e1rvores R por clustering semeado<\/a>\u00a0e para o carregamento em massa\u00a0<a href=\"https:\/\/ftp.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/Vol-74\/files\/FORUM_18.pdf\">OMT: Algoritmo de carregamento em massa top-down com minimiza\u00e7\u00e3o de sobreposi\u00e7\u00e3o para \u00e1rvore R<\/a>\u00a0foi implementado (com pequenas modifica\u00e7\u00f5es).<\/p>\n<h3 style=\"font-size: 17px; font-weight: bold; padding: 0px; margin: 1em 0px 1em 0px;\">O algoritmo<\/h3>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">Para aqueles que n\u00e3o querem ler a descri\u00e7\u00e3o completa, aqui est\u00e1 um breve resumo do algoritmo de inser\u00e7\u00e3o em massa. A ideia b\u00e1sica \u00e9 criar clusters a partir de toda a atualiza\u00e7\u00e3o em massa que correspondam \u00e0 estrutura de \u00edndice existente no momento (ou seja, o\u00a0<em style=\"font-style: italic; font-weight: inherit;\">\u00e1rvore de destino<\/em>). Em seguida, esses clusters s\u00e3o carregados em massa nas \u00e1rvores R, sendo inseridos literalmente na \u00e1rvore de destino.<\/p>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">Vamos dar uma olhada mais de perto em cada etapa. O algoritmo come\u00e7a com o carregamento dos n\u00edveis superiores da \u00e1rvore de destino na mem\u00f3ria (no m\u00e1ximo 3, caso contr\u00e1rio, o consumo de mem\u00f3ria est\u00e1 prestes a explodir), esse \u00e9 o chamado\u00a0<em style=\"font-style: italic; font-weight: inherit;\">\u00e1rvore de sementes<\/em>. As folhas s\u00e3o ent\u00e3o usadas para realizar o agrupamento. Cada item da inser\u00e7\u00e3o em massa \u00e9 incorporado \u00e0 \u00e1rvore semente com um algoritmo semelhante ao algoritmo normal de inser\u00e7\u00e3o da \u00e1rvore R. A diferen\u00e7a \u00e9 que os novos itens n\u00e3o s\u00e3o gravados no disco, mas mantidos temporariamente na mem\u00f3ria enquanto o restante do processo de inser\u00e7\u00e3o em massa continua. A diferen\u00e7a \u00e9 que os novos itens n\u00e3o s\u00e3o gravados no disco, mas mantidos temporariamente na mem\u00f3ria enquanto o restante do processo de inser\u00e7\u00e3o em massa continua.<\/p>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">Depois que todos os itens forem processados, a travessia da \u00e1rvore de sementes ser\u00e1 iniciada. Descendo em\u00a0<a href=\"https:\/\/en.wikipedia.org\/wiki\/Depth-first_search\">profundidade em primeiro lugar<\/a>\u00a0algum processamento \u00e9 devido quando um n\u00f3 folha \u00e9 alcan\u00e7ado. Todos os itens armazenados temporariamente do n\u00f3 atual s\u00e3o carregados em massa em uma nova \u00e1rvore R (o\u00a0<em style=\"font-style: italic; font-weight: inherit;\">\u00e1rvore de origem<\/em>) usando o algoritmo OMT. Essa \u00e1rvore \u00e9 anexada aos n\u00f3s filhos originais da folha da \u00e1rvore semente. Mas h\u00e1 um problema. Uma \u00e1rvore R \u00e9 sempre altamente balanceada, mas a altura da \u00e1rvore de origem pode n\u00e3o caber se ela for anexada como est\u00e1. H\u00e1 basicamente tr\u00eas casos:<\/p>\n<ol style=\"padding: 0px; margin: 0px 1em 0px 2em;\">\n<li style=\"list-style-type: decimal; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">A \u00e1rvore de origem se encaixa: A \u00e1rvore pode ser inserida como est\u00e1<\/li>\n<li style=\"list-style-type: decimal; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">A \u00e1rvore de origem \u00e9 muito pequena: Uma nova \u00e1rvore de sementes \u00e9 criada. Seu n\u00f3 raiz \u00e9 o n\u00f3 folha da \u00e1rvore de origem atual. Proceder de forma recursiva.<\/li>\n<li style=\"list-style-type: decimal; list-style-position: outside; list-style-image: initial; padding: 0px; margin: 0px;\">A \u00e1rvore de origem \u00e9 muito grande: use os n\u00f3s filhos em vez do n\u00f3 raiz da \u00e1rvore de origem (recursivamente, des\u00e7a at\u00e9 que a altura corresponda).<\/li>\n<\/ol>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">O n\u00f3 raiz da \u00e1rvore de origem pode cobrir a maior parte da \u00e1rea do n\u00f3 em que \u00e9 inserido, portanto, \u00e9 feito um reempacotamento para melhorar o desempenho da consulta. Os filhos de todos os n\u00f3s que cruzam o n\u00f3 da \u00e1rvore de origem e os filhos da \u00e1rvore de origem s\u00e3o reorganizados para minimizar a \u00e1rea que cobrem (o algoritmo OMT \u00e9 utilizado). Ap\u00f3s a conclus\u00e3o desse processo, os n\u00f3s reempacotados s\u00e3o finalmente gravados no disco.<\/p>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">Os n\u00f3s pai s\u00e3o gravados no disco sempre que uma sub\u00e1rvore \u00e9 conclu\u00edda. O resultado \u00e9 que o processo de atualiza\u00e7\u00e3o do \u00edndice em massa economiza muitas grava\u00e7\u00f5es em disco f\u00edsico em compara\u00e7\u00e3o com a estrat\u00e9gia tradicional de inser\u00e7\u00e3o de um \u00fanico item, em que todos os n\u00f3s pai at\u00e9 a raiz s\u00e3o reescritos em cada inser\u00e7\u00e3o.<\/p>\n<h3 style=\"font-size: 17px; font-weight: bold; padding: 0px; margin: 1em 0px 1em 0px;\">Desafios da inser\u00e7\u00e3o em massa<\/h3>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">Embora os algoritmos b\u00e1sicos sejam simples, algumas pessoas podem se perguntar por que parte do c\u00f3digo necess\u00e1rio para alcan\u00e7\u00e1-los \u00e9 t\u00e3o complexa. O maior desafio \u00e9 manter a altura da \u00e1rvore R resultante equilibrada e o n\u00famero de filhos por n\u00f3 abaixo do n\u00famero m\u00e1ximo. Quando voc\u00ea insere em massa, pode haver inser\u00e7\u00f5es que resultem em um estouro (e, portanto, em divis\u00f5es) e isso precisa ser realizado recursivamente at\u00e9 o topo da \u00e1rvore.<\/p>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">Outro desafio \u00e9 rastrear na mem\u00f3ria a altura atual da \u00e1rvore de destino, a posi\u00e7\u00e3o atual dentro da \u00e1rvore de destino\/semente e a altura esperada da \u00e1rvore de origem que ser\u00e1 inserida. Isso precisa ser feito de forma eficiente para evitar o consumo excessivo de mem\u00f3ria.<\/p>\n<h2 style=\"font-size: 1.7em; font-weight: bold; padding: 0px; margin: 1em 0px 1em 0px;\">Melhorias futuras<\/h2>\n<p style=\"padding: 0px; margin: 0px 0px 1em 0px;\">A inser\u00e7\u00e3o em massa atual leva a um desempenho e a tamanhos de arquivo muito melhores em compara\u00e7\u00e3o com a inser\u00e7\u00e3o tradicional de um \u00fanico item, por meio de uma combina\u00e7\u00e3o de reconstru\u00e7\u00e3o e balanceamento eficientes da \u00e1rvore e da redu\u00e7\u00e3o de grava\u00e7\u00f5es f\u00edsicas no disco. A implementa\u00e7\u00e3o geralmente precisa pesquisar os n\u00f3s para obter sua caixa delimitadora, sem a necessidade de solicitar outras coisas (como seus filhos). As altera\u00e7\u00f5es na estrutura de dados atual (que s\u00e3o os primeiros fragmentos de c\u00f3digo que foram escritos para o GeoCouch) poderiam levar a ainda menos pesquisas.<\/p>","protected":false},"excerpt":{"rendered":"<p>The new release\u00a0of\u00a0GeoCouch\u00a0improves the spatial index building time a lot (up to 10x). This comes from using a new bulk insertion algorithm. The spatial index (an\u00a0R-tree) is implemented as an append-only data structure \u2014 just as CouchDB&#8217;s B-trees are \u2014 [&hellip;]<\/p>","protected":false},"author":32,"featured_media":13873,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"inline_featured_image":false,"footnotes":""},"categories":[1],"tags":[],"ppma_author":[8991],"class_list":["post-1617","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-uncategorized"],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v25.7.1 (Yoast SEO v25.7) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>GeoCouch: Bulk Insertion - The Couchbase Blog<\/title>\n<meta name=\"description\" content=\"Learn about the new release of GeoCouch improves the spatial index building time a lot (up to 10x) which comes from using a new bulk insertion algorithm.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.couchbase.com\/blog\/pt\/geocouch-bulk-insertion\/\" \/>\n<meta property=\"og:locale\" content=\"pt_BR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"GeoCouch: Bulk Insertion\" \/>\n<meta property=\"og:description\" content=\"Learn about the new release of GeoCouch improves the spatial index building time a lot (up to 10x) which comes from using a new bulk insertion algorithm.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.couchbase.com\/blog\/pt\/geocouch-bulk-insertion\/\" \/>\n<meta property=\"og:site_name\" content=\"The Couchbase Blog\" \/>\n<meta property=\"article:published_time\" content=\"2014-12-16T19:32:12+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2019-03-24T11:56:28+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2022\/11\/couchbase-nosql-dbaas.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1800\" \/>\n\t<meta property=\"og:image:height\" content=\"630\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Volker Mische, Software Engineer, Couchbase\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Volker Mische, Software Engineer, Couchbase\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutos\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/\"},\"author\":{\"name\":\"Volker Mische, Software Engineer, Couchbase\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/b58f2bd342f110c188a5fd7652a9154b\"},\"headline\":\"GeoCouch: Bulk Insertion\",\"datePublished\":\"2014-12-16T19:32:12+00:00\",\"dateModified\":\"2019-03-24T11:56:28+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/\"},\"wordCount\":1047,\"commentCount\":1,\"publisher\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/#organization\"},\"image\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png\",\"articleSection\":[\"Uncategorized\"],\"inLanguage\":\"pt-BR\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/\",\"url\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/\",\"name\":\"GeoCouch: Bulk Insertion - The Couchbase Blog\",\"isPartOf\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png\",\"datePublished\":\"2014-12-16T19:32:12+00:00\",\"dateModified\":\"2019-03-24T11:56:28+00:00\",\"description\":\"Learn about the new release of GeoCouch improves the spatial index building time a lot (up to 10x) which comes from using a new bulk insertion algorithm.\",\"breadcrumb\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#breadcrumb\"},\"inLanguage\":\"pt-BR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"pt-BR\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage\",\"url\":\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png\",\"contentUrl\":\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png\",\"width\":1800,\"height\":630},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.couchbase.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"GeoCouch: Bulk Insertion\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/#website\",\"url\":\"https:\/\/www.couchbase.com\/blog\/\",\"name\":\"The Couchbase Blog\",\"description\":\"Couchbase, the NoSQL Database\",\"publisher\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.couchbase.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"pt-BR\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/#organization\",\"name\":\"The Couchbase Blog\",\"url\":\"https:\/\/www.couchbase.com\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"pt-BR\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2023\/04\/admin-logo.png\",\"contentUrl\":\"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2023\/04\/admin-logo.png\",\"width\":218,\"height\":34,\"caption\":\"The Couchbase Blog\"},\"image\":{\"@id\":\"https:\/\/www.couchbase.com\/blog\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/b58f2bd342f110c188a5fd7652a9154b\",\"name\":\"Volker Mische, Software Engineer, Couchbase\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"pt-BR\",\"@id\":\"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/image\/b784e0ed70ddc6a966cca0cd67ea590d\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/36d6008327e7c68a3cb8b871b2232cb728b1097bce985c73052cfcc73479d576?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/36d6008327e7c68a3cb8b871b2232cb728b1097bce985c73052cfcc73479d576?s=96&d=mm&r=g\",\"caption\":\"Volker Mische, Software Engineer, Couchbase\"},\"description\":\"Volker Mische is a Software Engineer, Couchbase. He is in the view-engine team working mostly in Erlang, C\/C++ to improve the geospatial &amp; mapreduce indexing.\",\"url\":\"https:\/\/www.couchbase.com\/blog\/pt\/author\/volker-mische\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"GeoCouch: Bulk Insertion - The Couchbase Blog","description":"Learn about the new release of GeoCouch improves the spatial index building time a lot (up to 10x) which comes from using a new bulk insertion algorithm.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.couchbase.com\/blog\/pt\/geocouch-bulk-insertion\/","og_locale":"pt_BR","og_type":"article","og_title":"GeoCouch: Bulk Insertion","og_description":"Learn about the new release of GeoCouch improves the spatial index building time a lot (up to 10x) which comes from using a new bulk insertion algorithm.","og_url":"https:\/\/www.couchbase.com\/blog\/pt\/geocouch-bulk-insertion\/","og_site_name":"The Couchbase Blog","article_published_time":"2014-12-16T19:32:12+00:00","article_modified_time":"2019-03-24T11:56:28+00:00","og_image":[{"width":1800,"height":630,"url":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2022\/11\/couchbase-nosql-dbaas.png","type":"image\/png"}],"author":"Volker Mische, Software Engineer, Couchbase","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Volker Mische, Software Engineer, Couchbase","Est. reading time":"5 minutos"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#article","isPartOf":{"@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/"},"author":{"name":"Volker Mische, Software Engineer, Couchbase","@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/b58f2bd342f110c188a5fd7652a9154b"},"headline":"GeoCouch: Bulk Insertion","datePublished":"2014-12-16T19:32:12+00:00","dateModified":"2019-03-24T11:56:28+00:00","mainEntityOfPage":{"@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/"},"wordCount":1047,"commentCount":1,"publisher":{"@id":"https:\/\/www.couchbase.com\/blog\/#organization"},"image":{"@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage"},"thumbnailUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png","articleSection":["Uncategorized"],"inLanguage":"pt-BR","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/","url":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/","name":"GeoCouch: Bulk Insertion - The Couchbase Blog","isPartOf":{"@id":"https:\/\/www.couchbase.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage"},"image":{"@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage"},"thumbnailUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png","datePublished":"2014-12-16T19:32:12+00:00","dateModified":"2019-03-24T11:56:28+00:00","description":"Learn about the new release of GeoCouch improves the spatial index building time a lot (up to 10x) which comes from using a new bulk insertion algorithm.","breadcrumb":{"@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#breadcrumb"},"inLanguage":"pt-BR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/"]}]},{"@type":"ImageObject","inLanguage":"pt-BR","@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#primaryimage","url":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png","contentUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/sites\/1\/2022\/11\/couchbase-nosql-dbaas.png","width":1800,"height":630},{"@type":"BreadcrumbList","@id":"https:\/\/www.couchbase.com\/blog\/geocouch-bulk-insertion\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.couchbase.com\/blog\/"},{"@type":"ListItem","position":2,"name":"GeoCouch: Bulk Insertion"}]},{"@type":"WebSite","@id":"https:\/\/www.couchbase.com\/blog\/#website","url":"https:\/\/www.couchbase.com\/blog\/","name":"Blog do Couchbase","description":"Couchbase, o banco de dados NoSQL","publisher":{"@id":"https:\/\/www.couchbase.com\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.couchbase.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"pt-BR"},{"@type":"Organization","@id":"https:\/\/www.couchbase.com\/blog\/#organization","name":"Blog do Couchbase","url":"https:\/\/www.couchbase.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"pt-BR","@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2023\/04\/admin-logo.png","contentUrl":"https:\/\/www.couchbase.com\/blog\/wp-content\/uploads\/2023\/04\/admin-logo.png","width":218,"height":34,"caption":"The Couchbase Blog"},"image":{"@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/b58f2bd342f110c188a5fd7652a9154b","name":"Volker Mische, engenheiro de software, Couchbase","image":{"@type":"ImageObject","inLanguage":"pt-BR","@id":"https:\/\/www.couchbase.com\/blog\/#\/schema\/person\/image\/b784e0ed70ddc6a966cca0cd67ea590d","url":"https:\/\/secure.gravatar.com\/avatar\/36d6008327e7c68a3cb8b871b2232cb728b1097bce985c73052cfcc73479d576?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/36d6008327e7c68a3cb8b871b2232cb728b1097bce985c73052cfcc73479d576?s=96&d=mm&r=g","caption":"Volker Mische, Software Engineer, Couchbase"},"description":"Volker Mische \u00e9 engenheiro de software da Couchbase. Ele faz parte da equipe de engenharia de visualiza\u00e7\u00e3o, trabalhando principalmente em Erlang, C\/C++ para aprimorar a indexa\u00e7\u00e3o geoespacial e de mapreduce.","url":"https:\/\/www.couchbase.com\/blog\/pt\/author\/volker-mische\/"}]}},"authors":[{"term_id":8991,"user_id":32,"is_guest":0,"slug":"volker-mische","display_name":"Volker Mische, Software Engineer, Couchbase","avatar_url":"https:\/\/secure.gravatar.com\/avatar\/36d6008327e7c68a3cb8b871b2232cb728b1097bce985c73052cfcc73479d576?s=96&d=mm&r=g","first_name":"Volker","last_name":"Mische","user_url":"","author_category":"","description":"Volker Mische \u00e9 engenheiro de software da Couchbase. Ele faz parte da equipe de engenharia de visualiza\u00e7\u00e3o, trabalhando principalmente em Erlang, C\/C++ para aprimorar a indexa\u00e7\u00e3o geoespacial e de mapreduce."}],"_links":{"self":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/1617","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/users\/32"}],"replies":[{"embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/comments?post=1617"}],"version-history":[{"count":0,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/1617\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/media\/13873"}],"wp:attachment":[{"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/media?parent=1617"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/categories?post=1617"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/tags?post=1617"},{"taxonomy":"author","embeddable":true,"href":"https:\/\/www.couchbase.com\/blog\/pt\/wp-json\/wp\/v2\/ppma_author?post=1617"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}