. "Invertovan\u00FD soubor (t\u00E9\u017E fulltextov\u00FD index) je datov\u00E1 struktura pou\u017E\u00EDvan\u00E1 pro fulltextov\u00E9 vyhled\u00E1v\u00E1n\u00ED v rozs\u00E1hl\u00FDch kolekc\u00EDch dokument\u016F. \u00DA\u010Delem invertovan\u00E9ho souboru je umo\u017Enit rychl\u00E9 vyhled\u00E1v\u00E1n\u00ED za cenu dodate\u010Dn\u00FDch operac\u00ED v okam\u017Eiku p\u0159id\u00E1n\u00ED dokumentu do datab\u00E1ze. Obvykle se jedn\u00E1 o se\u0159azen\u00FD soubor v\u00FDznamn\u00FDch slov, upraven\u00FDch na z\u00E1kladn\u00ED tvar lemmatiz\u00E1torem. Ke ka\u017Ed\u00E9mu slovu je p\u0159i\u0159azen seznam dokument\u016F, ve kter\u00FDch se slovo vyskytuje, s p\u0159\u00EDpadn\u00FDmi dal\u0161\u00EDmi informacemi (m\u00EDsto v\u00FDskytu)."@cs . "\u5012\u6392\u7D22\u5F15\uFF08\u82F1\u8BED\uFF1AInverted index\uFF09\uFF0C\u4E5F\u5E38\u88AB\u79F0\u4E3A\u53CD\u5411\u7D22\u5F15\u3001\u7F6E\u5165\u6863\u6848\u6216\u53CD\u5411\u6863\u6848\uFF0C\u662F\u4E00\u79CD\u7D22\u5F15\u65B9\u6CD5\uFF0C\u88AB\u7528\u6765\u5728\u4E0B\u67D0\u4E2A\u5355\u8BCD\u5728\u4E00\u4E2A\u6587\u6863\u6216\u8005\u4E00\u7EC4\u6587\u6863\u4E2D\u7684\u7684\u6620\u5C04\u3002\u5B83\u662F\u4E2D\u6700\u5E38\u7528\u7684\u6570\u636E\u7ED3\u6784\u3002 \u6709\u4E24\u79CD\u4E0D\u540C\u7684\u53CD\u5411\u7D22\u5F15\u5F62\u5F0F\uFF1A \n* \u4E00\u6761\u8BB0\u5F55\u7684\u6C34\u5E73\u53CD\u5411\u7D22\u5F15\uFF08\u6216\u8005\u53CD\u5411\u6863\u6848\u7D22\u5F15\uFF09\u5305\u542B\u6BCF\u4E2A\u5F15\u7528\u5355\u8BCD\u7684\u6587\u6863\u7684\u5217\u8868\u3002 \n* \u4E00\u4E2A\u5355\u8BCD\u7684\u6C34\u5E73\u53CD\u5411\u7D22\u5F15\uFF08\u6216\u8005\u5B8C\u5168\u53CD\u5411\u7D22\u5F15\uFF09\u53C8\u5305\u542B\u6BCF\u4E2A\u5355\u8BCD\u5728\u4E00\u4E2A\u6587\u6863\u4E2D\u7684\u4F4D\u7F6E\u3002 \u540E\u8005\u7684\u5F62\u5F0F\u63D0\u4F9B\u4E86\u66F4\u591A\u7684\u517C\u5BB9\u6027\uFF08\u6BD4\u5982\uFF09\uFF0C\u4F46\u662F\u9700\u8981\u66F4\u591A\u7684\u65F6\u95F4\u548C\u7A7A\u95F4\u6765\u521B\u5EFA\u3002"@zh . . "\u00CDndex invertit"@ca . "En informatique, un index invers\u00E9 est une correspondance entre du contenu, comme des mots ou des nombres, et sa position dans un ensemble de donn\u00E9es comme un enregistrement en base de donn\u00E9es, un document ou un ensemble de documents ; sur le m\u00EAme principe qu'un index terminologique. Le but de l'index invers\u00E9 est de permettre une recherche plein texte plus rapide, contre un temps d'insertion de nouvelles donn\u00E9es augment\u00E9."@fr . . . . "\u0418\u043D\u0432\u0435\u0440\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u0438\u043D\u0434\u0435\u043A\u0441"@ru . . . . "\u5012\u6392\u7D22\u5F15\uFF08\u82F1\u8BED\uFF1AInverted index\uFF09\uFF0C\u4E5F\u5E38\u88AB\u79F0\u4E3A\u53CD\u5411\u7D22\u5F15\u3001\u7F6E\u5165\u6863\u6848\u6216\u53CD\u5411\u6863\u6848\uFF0C\u662F\u4E00\u79CD\u7D22\u5F15\u65B9\u6CD5\uFF0C\u88AB\u7528\u6765\u5728\u4E0B\u67D0\u4E2A\u5355\u8BCD\u5728\u4E00\u4E2A\u6587\u6863\u6216\u8005\u4E00\u7EC4\u6587\u6863\u4E2D\u7684\u7684\u6620\u5C04\u3002\u5B83\u662F\u4E2D\u6700\u5E38\u7528\u7684\u6570\u636E\u7ED3\u6784\u3002 \u6709\u4E24\u79CD\u4E0D\u540C\u7684\u53CD\u5411\u7D22\u5F15\u5F62\u5F0F\uFF1A \n* \u4E00\u6761\u8BB0\u5F55\u7684\u6C34\u5E73\u53CD\u5411\u7D22\u5F15\uFF08\u6216\u8005\u53CD\u5411\u6863\u6848\u7D22\u5F15\uFF09\u5305\u542B\u6BCF\u4E2A\u5F15\u7528\u5355\u8BCD\u7684\u6587\u6863\u7684\u5217\u8868\u3002 \n* \u4E00\u4E2A\u5355\u8BCD\u7684\u6C34\u5E73\u53CD\u5411\u7D22\u5F15\uFF08\u6216\u8005\u5B8C\u5168\u53CD\u5411\u7D22\u5F15\uFF09\u53C8\u5305\u542B\u6BCF\u4E2A\u5355\u8BCD\u5728\u4E00\u4E2A\u6587\u6863\u4E2D\u7684\u4F4D\u7F6E\u3002 \u540E\u8005\u7684\u5F62\u5F0F\u63D0\u4F9B\u4E86\u66F4\u591A\u7684\u517C\u5BB9\u6027\uFF08\u6BD4\u5982\uFF09\uFF0C\u4F46\u662F\u9700\u8981\u66F4\u591A\u7684\u65F6\u95F4\u548C\u7A7A\u95F4\u6765\u521B\u5EFA\u3002"@zh . . . . . . . . "Un \u00EDndice invertido es una forma de estructurar la informaci\u00F3n que va a ser recuperada por un motor de b\u00FAsqueda. Por tanto, el objetivo es crear la estructura de datos para llevar a cabo una b\u00FAsqueda de texto completa. En un \u00EDndice invertido, el buscador crea los \u00EDndices, o t\u00E9rminos de b\u00FAsqueda, a partir de una serie de documentos, indicando el o los documentos que los contienen. De esta manera, cuando el usuario teclea un t\u00E9rmino de b\u00FAsqueda determinado, el buscador le indica los documentos que contienen dicho t\u00E9rmino."@es . . "In computer science, an inverted index (also referred to as a postings list, postings file, or inverted file) is a database index storing a mapping from content, such as words or numbers, to its locations in a table, or in a document or a set of documents (named in contrast to a forward index, which maps from documents to content). The purpose of an inverted index is to allow fast full-text searches, at a cost of increased processing when a document is added to the database. The inverted file may be the database file itself, rather than its index. It is the most popular data structure used in document retrieval systems, used on a large scale for example in search engines. Additionally, several significant general-purpose mainframe-based database management systems have used inverted list a"@en . "\u8EE2\u7F6E\u30A4\u30F3\u30C7\u30C3\u30AF\u30B9"@ja . . "Index invers\u00E9"@fr . . . "Listas invertidas"@pt . . . "En inform\u00E0tica, un \u00EDndex invertit (tamb\u00E9 anomenat fitxer de publicacions o fitxer invertit ) \u00E9s un \u00EDndex de base de dades que emmagatzema un mapatge des de contingut, com ara paraules o n\u00FAmeros, fins a les ubicacions d\u2019una taula, d\u2019un document o d\u2019un conjunt de documents (anomenats en contrast amb un \u00EDndex directe, que assigna els documents al contingut). L\u2019objectiu d\u2019un \u00EDndex invertit \u00E9s permetre cerques r\u00E0pides de text complet, amb un cost de processament augmentat quan s\u2019afegeix un document a la base de dades. El fitxer invertit pot ser el propi fitxer de base de dades, en lloc del seu \u00EDndex. \u00C9s l'estructura de dades m\u00E9s popular que s'utilitza en sistemes de recuperaci\u00F3 de documents utilitzada a gran escala, per exemple en motors de cerca . A m\u00E9s, diversos sistemes significatius de gesti\u00F3 de bases de dades basats en mainframe per a usos generals han utilitzat arquitectures de llistes invertides, incloses ADABAS, DATACOM / DB i Model 204 . Hi ha dues variants principals dels \u00EDndexs invertits: un \u00EDndex invertit a nivell de registre (o un \u00EDndex de fitxer invertit o simplement un fitxer invertit ) cont\u00E9 una llista de refer\u00E8ncies a documents per a cada paraula. Un \u00EDndex invertit a nivell de paraula (o \u00EDndex invertit complet o llista invertida ) cont\u00E9 addicionalment les posicions de cada paraula dins d'un document. Aquest darrer formulari ofereix m\u00E9s funcionalitats (com ara cerques de frases ), per\u00F2 necessita m\u00E9s poder de processament i espai per crear-se."@ca . . . "\u0406\u043D\u0432\u0435\u0440\u0442\u043E\u0432\u0430\u043D\u0438\u0439 \u0456\u043D\u0434\u0435\u043A\u0441"@uk . . . . . "\u8EE2\u7F6E\u30A4\u30F3\u30C7\u30C3\u30AF\u30B9\uFF08\u3066\u3093\u3061\u30A4\u30F3\u30C7\u30C3\u30AF\u30B9\u3001Inverted index\uFF09\u3068\u306F\u3001\u5168\u6587\u691C\u7D22\u3092\u884C\u3046\u5BFE\u8C61\u3068\u306A\u308B\u6587\u66F8\u7FA4\u304B\u3089\u5358\u8A9E\u306E\u4F4D\u7F6E\u60C5\u5831\u3092\u683C\u7D0D\u3059\u308B\u305F\u3081\u306E\u7D22\u5F15\u69CB\u9020\u3092\u3044\u3046\u3002\u8EE2\u7F6E\u7D22\u5F15\u3001\u8EE2\u7F6E\u30D5\u30A1\u30A4\u30EB\u3001\u9006\u5F15\u304D\u7D22\u5F15\u306A\u3069\u3068\u3082\u547C\u3070\u308C\u308B\u3002"@ja . . . . "3125116"^^ . . . . . . . . . . . "\u0418\u043D\u0432\u0435\u0440\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u0438\u043D\u0434\u0435\u043A\u0441 (\u0430\u043D\u0433\u043B. inverted index) \u2014 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u043D\u044B\u0445, \u0432 \u043A\u043E\u0442\u043E\u0440\u043E\u0439 \u0434\u043B\u044F \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430 \u043A\u043E\u043B\u043B\u0435\u043A\u0446\u0438\u0438 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u043E\u0432 \u0432 \u0441\u043E\u043E\u0442\u0432\u0435\u0442\u0441\u0442\u0432\u0443\u044E\u0449\u0435\u043C \u0441\u043F\u0438\u0441\u043A\u0435 \u043F\u0435\u0440\u0435\u0447\u0438\u0441\u043B\u0435\u043D\u044B \u0432\u0441\u0435 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u044B \u0432 \u043A\u043E\u043B\u043B\u0435\u043A\u0446\u0438\u0438, \u0432 \u043A\u043E\u0442\u043E\u0440\u044B\u0445 \u043E\u043D\u043E \u0432\u0441\u0442\u0440\u0435\u0442\u0438\u043B\u043E\u0441\u044C. \u0418\u043D\u0432\u0435\u0440\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u0438\u043D\u0434\u0435\u043A\u0441 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u0435\u0442\u0441\u044F \u0434\u043B\u044F \u043F\u043E\u0438\u0441\u043A\u0430 \u043F\u043E \u0442\u0435\u043A\u0441\u0442\u0430\u043C. \u0415\u0441\u0442\u044C \u0434\u0432\u0430 \u0432\u0430\u0440\u0438\u0430\u043D\u0442\u0430 \u0438\u043D\u0432\u0435\u0440\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0433\u043E \u0438\u043D\u0434\u0435\u043A\u0441\u0430: \n* \u0438\u043D\u0434\u0435\u043A\u0441, \u0441\u043E\u0434\u0435\u0440\u0436\u0430\u0449\u0438\u0439 \u0442\u043E\u043B\u044C\u043A\u043E \u0441\u043F\u0438\u0441\u043E\u043A \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u043E\u0432 \u0434\u043B\u044F \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430, \n* \u0438\u043D\u0434\u0435\u043A\u0441, \u0434\u043E\u043F\u043E\u043B\u043D\u0438\u0442\u0435\u043B\u044C\u043D\u043E \u0432\u043A\u043B\u044E\u0447\u0430\u044E\u0449\u0438\u0439 \u043F\u043E\u0437\u0438\u0446\u0438\u044E \u0441\u043B\u043E\u0432\u0430 \u0432 \u043A\u0430\u0436\u0434\u043E\u043C \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0435."@ru . . "Inverted index"@en . . . . . "\u8EE2\u7F6E\u30A4\u30F3\u30C7\u30C3\u30AF\u30B9\uFF08\u3066\u3093\u3061\u30A4\u30F3\u30C7\u30C3\u30AF\u30B9\u3001Inverted index\uFF09\u3068\u306F\u3001\u5168\u6587\u691C\u7D22\u3092\u884C\u3046\u5BFE\u8C61\u3068\u306A\u308B\u6587\u66F8\u7FA4\u304B\u3089\u5358\u8A9E\u306E\u4F4D\u7F6E\u60C5\u5831\u3092\u683C\u7D0D\u3059\u308B\u305F\u3081\u306E\u7D22\u5F15\u69CB\u9020\u3092\u3044\u3046\u3002\u8EE2\u7F6E\u7D22\u5F15\u3001\u8EE2\u7F6E\u30D5\u30A1\u30A4\u30EB\u3001\u9006\u5F15\u304D\u7D22\u5F15\u306A\u3069\u3068\u3082\u547C\u3070\u308C\u308B\u3002"@ja . "\u0406\u043D\u0432\u0435\u0440\u0442\u043E\u0432\u0430\u043D\u0438\u0439 \u0456\u043D\u0434\u0435\u043A\u0441 (\u0430\u043D\u0433\u043B. inverted index) \u2014 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445, \u0432 \u044F\u043A\u0456\u0439 \u0434\u043B\u044F \u043A\u043E\u0436\u043D\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430 \u043A\u043E\u043B\u0435\u043A\u0446\u0456\u0457 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0456\u0432 \u0443 \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E\u043C\u0443 \u0441\u043F\u0438\u0441\u043A\u0443 \u043F\u0435\u0440\u0435\u0440\u0430\u0445\u043E\u0432\u0430\u043D\u0456 \u0432\u0441\u0456 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0438 \u0432 \u043A\u043E\u043B\u0435\u043A\u0446\u0456\u0457 \u2014 \u0432 \u044F\u043A\u0438\u0445 \u0432\u043E\u043D\u043E \u0437\u0443\u0441\u0442\u0440\u0456\u043B\u043E\u0441\u044F. \u0406\u043D\u0432\u0435\u0440\u0442\u043E\u0432\u0430\u043D\u0438\u0439 \u0456\u043D\u0434\u0435\u043A\u0441 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u0434\u043B\u044F \u043F\u043E\u0448\u0443\u043A\u0443 \u0437\u0430 \u0442\u0435\u043A\u0441\u0442\u0430\u043C\u0438. \u0404 \u0434\u0432\u0430 \u0432\u0430\u0440\u0456\u0430\u043D\u0442\u0438 \u0456\u043D\u0432\u0435\u0440\u0442\u043E\u0432\u0430\u043D\u043E\u0433\u043E \u0456\u043D\u0434\u0435\u043A\u0441\u0443: \n* \u0456\u043D\u0434\u0435\u043A\u0441, \u044F\u043A\u0438\u0439 \u043C\u0456\u0441\u0442\u0438\u0442\u044C \u043B\u0438\u0448\u0435 \u0441\u043F\u0438\u0441\u043E\u043A \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0456\u0432 \u0434\u043B\u044F \u043A\u043E\u0436\u043D\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430, \n* \u0456\u043D\u0434\u0435\u043A\u0441, \u0434\u043E\u0434\u0430\u0442\u043A\u043E\u0432\u043E \u0432\u043A\u043B\u044E\u0447\u0430\u0454 \u043F\u043E\u0437\u0438\u0446\u0456\u044E \u0441\u043B\u043E\u0432\u0430 \u0432 \u043A\u043E\u0436\u043D\u043E\u043C\u0443 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0443"@uk . "Un \u00EDndice invertido es una forma de estructurar la informaci\u00F3n que va a ser recuperada por un motor de b\u00FAsqueda. Por tanto, el objetivo es crear la estructura de datos para llevar a cabo una b\u00FAsqueda de texto completa. En un \u00EDndice invertido, el buscador crea los \u00EDndices, o t\u00E9rminos de b\u00FAsqueda, a partir de una serie de documentos, indicando el o los documentos que los contienen. De esta manera, cuando el usuario teclea un t\u00E9rmino de b\u00FAsqueda determinado, el buscador le indica los documentos que contienen dicho t\u00E9rmino."@es . . . . . . . "In computer science, an inverted index (also referred to as a postings list, postings file, or inverted file) is a database index storing a mapping from content, such as words or numbers, to its locations in a table, or in a document or a set of documents (named in contrast to a forward index, which maps from documents to content). The purpose of an inverted index is to allow fast full-text searches, at a cost of increased processing when a document is added to the database. The inverted file may be the database file itself, rather than its index. It is the most popular data structure used in document retrieval systems, used on a large scale for example in search engines. Additionally, several significant general-purpose mainframe-based database management systems have used inverted list architectures, including ADABAS, DATACOM/DB, and Model 204. There are two main variants of inverted indexes: A record-level inverted index (or inverted file index or just inverted file) contains a list of references to documents for each word. A word-level inverted index (or full inverted index or inverted list) additionally contains the positions of each word within a document. The latter form offers more functionality (like phrase searches), but needs more processing power and space to be created."@en . . "\u0418\u043D\u0432\u0435\u0440\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u0438\u043D\u0434\u0435\u043A\u0441 (\u0430\u043D\u0433\u043B. inverted index) \u2014 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u043D\u044B\u0445, \u0432 \u043A\u043E\u0442\u043E\u0440\u043E\u0439 \u0434\u043B\u044F \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430 \u043A\u043E\u043B\u043B\u0435\u043A\u0446\u0438\u0438 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u043E\u0432 \u0432 \u0441\u043E\u043E\u0442\u0432\u0435\u0442\u0441\u0442\u0432\u0443\u044E\u0449\u0435\u043C \u0441\u043F\u0438\u0441\u043A\u0435 \u043F\u0435\u0440\u0435\u0447\u0438\u0441\u043B\u0435\u043D\u044B \u0432\u0441\u0435 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u044B \u0432 \u043A\u043E\u043B\u043B\u0435\u043A\u0446\u0438\u0438, \u0432 \u043A\u043E\u0442\u043E\u0440\u044B\u0445 \u043E\u043D\u043E \u0432\u0441\u0442\u0440\u0435\u0442\u0438\u043B\u043E\u0441\u044C. \u0418\u043D\u0432\u0435\u0440\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u0438\u043D\u0434\u0435\u043A\u0441 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u0435\u0442\u0441\u044F \u0434\u043B\u044F \u043F\u043E\u0438\u0441\u043A\u0430 \u043F\u043E \u0442\u0435\u043A\u0441\u0442\u0430\u043C. \u0415\u0441\u0442\u044C \u0434\u0432\u0430 \u0432\u0430\u0440\u0438\u0430\u043D\u0442\u0430 \u0438\u043D\u0432\u0435\u0440\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0433\u043E \u0438\u043D\u0434\u0435\u043A\u0441\u0430: \n* \u0438\u043D\u0434\u0435\u043A\u0441, \u0441\u043E\u0434\u0435\u0440\u0436\u0430\u0449\u0438\u0439 \u0442\u043E\u043B\u044C\u043A\u043E \u0441\u043F\u0438\u0441\u043E\u043A \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u043E\u0432 \u0434\u043B\u044F \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430, \n* \u0438\u043D\u0434\u0435\u043A\u0441, \u0434\u043E\u043F\u043E\u043B\u043D\u0438\u0442\u0435\u043B\u044C\u043D\u043E \u0432\u043A\u043B\u044E\u0447\u0430\u044E\u0449\u0438\u0439 \u043F\u043E\u0437\u0438\u0446\u0438\u044E \u0441\u043B\u043E\u0432\u0430 \u0432 \u043A\u0430\u0436\u0434\u043E\u043C \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0435."@ru . "\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C \uC5ED\uC0C9\uC778, \uC5ED \uC778\uB371\uC2A4(inverted index), \uC5ED \uD30C\uC77C(inverted file)\uC740 \uB0B1\uB9D0\uC774\uB098 \uC22B\uC790\uC640 \uAC19\uC740 \uB0B4\uC6A9\uBB3C\uB85C\uBD80\uD130\uC758 \uB9E4\uD551 \uC815\uBCF4\uB97C \uB370\uC774\uD130\uBCA0\uC774\uC2A4 \uD30C\uC77C\uC758 \uD2B9\uC815 \uC9C0\uC810\uC774\uB098 \uBB38\uC11C \uB610\uB294 \uBB38\uC11C \uC9D1\uD569 \uC548\uC5D0 \uC800\uC7A5\uD558\uB294 \uC0C9\uC778 \uB370\uC774\uD130 \uAD6C\uC870\uC774\uB2E4. \uC5ED\uC0C9\uC778\uC758 \uBAA9\uC801\uC740 \uBB38\uC11C\uAC00 \uB370\uC774\uD130\uBCA0\uC774\uC2A4\uC5D0 \uCD94\uAC00\uB420 \uB54C \uB298\uC5B4\uB098\uB294 \uCC98\uB9AC\uB97C \uC704\uD574 \uBE60\uB978 \uC804\uBB38 \uAC80\uC0C9\uC744 \uAC00\uB2A5\uCF00 \uD558\uB294 \uAC83\uC774\uB2E4. \uC5ED \uD30C\uC77C\uC740 \uC0C9\uC778\uC774 \uC544\uB2CC, \uB370\uC774\uD130\uBCA0\uC774\uC2A4 \uD30C\uC77C \uADF8 \uC790\uCCB4\uB97C \uAC00\uB9AC\uD0AC \uC218\uB3C4 \uC788\uB2E4. \uC2DC\uC2A4\uD15C\uC5D0 \uC4F0\uC774\uB294 \uAC00\uC7A5 \uB300\uC911\uC801\uC778 \uB370\uC774\uD130 \uAD6C\uC870\uB85C\uC11C, \uC774\uB97C\uD14C\uBA74 \uAC80\uC0C9 \uC5D4\uC9C4\uACFC \uAC19\uC740 \uB300\uADDC\uBAA8\uC5D0 \uC4F0\uC778\uB2E4. \uC77C\uBD80 \uC911\uC694\uD55C \uC77C\uBC18 \uBAA9\uC801 \uBA54\uC778\uD504\uB808\uC784 \uAE30\uBC18 \uB370\uC774\uD130\uBCA0\uC774\uC2A4 \uAD00\uB9AC \uC2DC\uC2A4\uD15C\uB4E4\uC740 \uC5ED\uC0C9\uC778 \uAD6C\uC870\uB97C \uC0AC\uC6A9\uD574 \uC654\uC73C\uBA70 \uC544\uB2E4\uBC14\uC2A4, \uB370\uC774\uD130\uCF64/DB, \uBAA8\uB378 204 \uB4F1\uC774 \uC788\uB2E4. \uC5ED\uC0C9\uC778\uC740 \uB450 \uAC00\uC9C0 \uC8FC\uB41C \uC885\uB958\uAC00 \uC788\uB2E4: \uB808\uCF54\uB4DC \uB2E8\uC704\uC758 \uC5ED\uC0C9\uC778, \uB0B1\uB9D0 \uB2E8\uC704\uC758 \uC5ED\uC0C9\uC778"@ko . "Em ci\u00EAncia da computa\u00E7\u00E3o, Lista Invertida (do ingl\u00EAs inverted list ou inverted index) \u00E9 uma estrutura de dados que mapeia termos \u00E0s suas ocorr\u00EAncias em um documento ou conjunto de documentos, armazenados em um banco de dados. \u00C9 uma estrat\u00E9gia de indexa\u00E7\u00E3o que permite a realiza\u00E7\u00E3o de buscas precisas e r\u00E1pidas, em troca de maior dificuldade no ato de inser\u00E7\u00E3o e atualiza\u00E7\u00E3o de documentos. \u00C9 a mais popular estrat\u00E9gia de sistemas para obten\u00E7\u00E3o de dados, usada em larga escala em sistemas de gerenciamento de bancos de dados (como o Adabas) e servi\u00E7os de busca (como o Google)."@pt . . "Invertierte Datei"@de . . . . "1060313151"^^ . "\u0406\u043D\u0432\u0435\u0440\u0442\u043E\u0432\u0430\u043D\u0438\u0439 \u0456\u043D\u0434\u0435\u043A\u0441 (\u0430\u043D\u0433\u043B. inverted index) \u2014 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445, \u0432 \u044F\u043A\u0456\u0439 \u0434\u043B\u044F \u043A\u043E\u0436\u043D\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430 \u043A\u043E\u043B\u0435\u043A\u0446\u0456\u0457 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0456\u0432 \u0443 \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E\u043C\u0443 \u0441\u043F\u0438\u0441\u043A\u0443 \u043F\u0435\u0440\u0435\u0440\u0430\u0445\u043E\u0432\u0430\u043D\u0456 \u0432\u0441\u0456 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0438 \u0432 \u043A\u043E\u043B\u0435\u043A\u0446\u0456\u0457 \u2014 \u0432 \u044F\u043A\u0438\u0445 \u0432\u043E\u043D\u043E \u0437\u0443\u0441\u0442\u0440\u0456\u043B\u043E\u0441\u044F. \u0406\u043D\u0432\u0435\u0440\u0442\u043E\u0432\u0430\u043D\u0438\u0439 \u0456\u043D\u0434\u0435\u043A\u0441 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u0434\u043B\u044F \u043F\u043E\u0448\u0443\u043A\u0443 \u0437\u0430 \u0442\u0435\u043A\u0441\u0442\u0430\u043C\u0438. \u0404 \u0434\u0432\u0430 \u0432\u0430\u0440\u0456\u0430\u043D\u0442\u0438 \u0456\u043D\u0432\u0435\u0440\u0442\u043E\u0432\u0430\u043D\u043E\u0433\u043E \u0456\u043D\u0434\u0435\u043A\u0441\u0443: \n* \u0456\u043D\u0434\u0435\u043A\u0441, \u044F\u043A\u0438\u0439 \u043C\u0456\u0441\u0442\u0438\u0442\u044C \u043B\u0438\u0448\u0435 \u0441\u043F\u0438\u0441\u043E\u043A \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0456\u0432 \u0434\u043B\u044F \u043A\u043E\u0436\u043D\u043E\u0433\u043E \u0441\u043B\u043E\u0432\u0430, \n* \u0456\u043D\u0434\u0435\u043A\u0441, \u0434\u043E\u0434\u0430\u0442\u043A\u043E\u0432\u043E \u0432\u043A\u043B\u044E\u0447\u0430\u0454 \u043F\u043E\u0437\u0438\u0446\u0456\u044E \u0441\u043B\u043E\u0432\u0430 \u0432 \u043A\u043E\u0436\u043D\u043E\u043C\u0443 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0443"@uk . . . . . . "En inform\u00E0tica, un \u00EDndex invertit (tamb\u00E9 anomenat fitxer de publicacions o fitxer invertit ) \u00E9s un \u00EDndex de base de dades que emmagatzema un mapatge des de contingut, com ara paraules o n\u00FAmeros, fins a les ubicacions d\u2019una taula, d\u2019un document o d\u2019un conjunt de documents (anomenats en contrast amb un \u00EDndex directe, que assigna els documents al contingut). L\u2019objectiu d\u2019un \u00EDndex invertit \u00E9s permetre cerques r\u00E0pides de text complet, amb un cost de processament augmentat quan s\u2019afegeix un document a la base de dades. El fitxer invertit pot ser el propi fitxer de base de dades, en lloc del seu \u00EDndex. \u00C9s l'estructura de dades m\u00E9s popular que s'utilitza en sistemes de recuperaci\u00F3 de documents utilitzada a gran escala, per exemple en motors de cerca . A m\u00E9s, diversos sistemes significatius de ges"@ca . "Em ci\u00EAncia da computa\u00E7\u00E3o, Lista Invertida (do ingl\u00EAs inverted list ou inverted index) \u00E9 uma estrutura de dados que mapeia termos \u00E0s suas ocorr\u00EAncias em um documento ou conjunto de documentos, armazenados em um banco de dados. \u00C9 uma estrat\u00E9gia de indexa\u00E7\u00E3o que permite a realiza\u00E7\u00E3o de buscas precisas e r\u00E1pidas, em troca de maior dificuldade no ato de inser\u00E7\u00E3o e atualiza\u00E7\u00E3o de documentos. \u00C9 a mais popular estrat\u00E9gia de sistemas para obten\u00E7\u00E3o de dados, usada em larga escala em sistemas de gerenciamento de bancos de dados (como o Adabas) e servi\u00E7os de busca (como o Google)."@pt . "\u00CDndice invertido"@es . . . . . "7335"^^ . "En informatique, un index invers\u00E9 est une correspondance entre du contenu, comme des mots ou des nombres, et sa position dans un ensemble de donn\u00E9es comme un enregistrement en base de donn\u00E9es, un document ou un ensemble de documents ; sur le m\u00EAme principe qu'un index terminologique. Le but de l'index invers\u00E9 est de permettre une recherche plein texte plus rapide, contre un temps d'insertion de nouvelles donn\u00E9es augment\u00E9."@fr . "Invertierte Dateien werden im Bereich des Information Retrievals als Grundlage f\u00FCr die Durchf\u00FChrung verschiedener Suchanfragen ben\u00F6tigt, beispielsweise f\u00FCr die Suche mit Booleschen Operatoren und Trunkierungen. Dazu wird ein Index f\u00FCr eine Dokumentsammlung (beispielsweise eine Literaturdatenbank) angelegt, der den einzelnen suchbaren Begriffen jeweils die entsprechenden Dokumente zuordnet. Die invertierte Datei zu einem (Such-)Begriff verweist auf alle Dokumente, die mit diesem bestimmten Begriff verkn\u00FCpft sind. Dazu erh\u00E4lt die invertierte Datei Informationen wie beispielsweise die Dokumentnummern bzw. deren Adressen in der Datenbank, eine Angabe, wie h\u00E4ufig der Begriff in der Gesamtdatenbank vorkommt (bzw. die Anzahl der Dokumente, in denen der Eintrag mindestens einmal vorkommt). F\u00FCr das Retrieval und die Gewichtung der Suchergebnisse n\u00FCtzlich sind au\u00DFerdem Angaben dazu, an welcher Position im Dokument der Begriff vorkommt (als wievieltes Wort, im wievielten Satz oder Absatz). Soll eine Linkstrunkierung erm\u00F6glicht werden, muss zus\u00E4tzlich jeder Begriff r\u00FCckw\u00E4rts geschrieben mit angelegt werden. Vorteil dieses Systems ist ein rascher Zugriff auf Dokumente, da nur der Index (und nicht die Dokumente selbst) durchsucht werden muss. Der Index l\u00E4sst sich gut f\u00FCr die Erstellung von Retrievalsystemen nutzen. Suchm\u00F6glichkeiten k\u00F6nnen ausgesch\u00F6pft und die Suchoberfl\u00E4che relativ frei gestaltet werden. Nachteilig sind jedoch zum einen der enorme Aufwand, den die Erstellung eines solchen Indexes erfordert, und zum anderen der gro\u00DFe ben\u00F6tigte Speicherplatz. Zudem muss der Index jedes Mal aktualisiert werden, sobald neue Dokumente hinzukommen. Das Prinzip der Invertierten Dateien basiert auf einem System von Herman Hollerith, der 1890 als erster Lochkarten f\u00FCr die Auswertung einer Volksz\u00E4hlung in den USA einsetzte. Die technische Umsetzung geschieht durch eine Indexstruktur."@de . . . . . . . . . . . "Invertovan\u00FD soubor (t\u00E9\u017E fulltextov\u00FD index) je datov\u00E1 struktura pou\u017E\u00EDvan\u00E1 pro fulltextov\u00E9 vyhled\u00E1v\u00E1n\u00ED v rozs\u00E1hl\u00FDch kolekc\u00EDch dokument\u016F. \u00DA\u010Delem invertovan\u00E9ho souboru je umo\u017Enit rychl\u00E9 vyhled\u00E1v\u00E1n\u00ED za cenu dodate\u010Dn\u00FDch operac\u00ED v okam\u017Eiku p\u0159id\u00E1n\u00ED dokumentu do datab\u00E1ze. Obvykle se jedn\u00E1 o se\u0159azen\u00FD soubor v\u00FDznamn\u00FDch slov, upraven\u00FDch na z\u00E1kladn\u00ED tvar lemmatiz\u00E1torem. Ke ka\u017Ed\u00E9mu slovu je p\u0159i\u0159azen seznam dokument\u016F, ve kter\u00FDch se slovo vyskytuje, s p\u0159\u00EDpadn\u00FDmi dal\u0161\u00EDmi informacemi (m\u00EDsto v\u00FDskytu)."@cs . . "Invertovan\u00FD soubor"@cs . . "\uC5ED\uC0C9\uC778"@ko . . . . . . . "Invertierte Dateien werden im Bereich des Information Retrievals als Grundlage f\u00FCr die Durchf\u00FChrung verschiedener Suchanfragen ben\u00F6tigt, beispielsweise f\u00FCr die Suche mit Booleschen Operatoren und Trunkierungen. Das Prinzip der Invertierten Dateien basiert auf einem System von Herman Hollerith, der 1890 als erster Lochkarten f\u00FCr die Auswertung einer Volksz\u00E4hlung in den USA einsetzte. Die technische Umsetzung geschieht durch eine Indexstruktur."@de . . . "\u5012\u6392\u7D22\u5F15"@zh . "\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C \uC5ED\uC0C9\uC778, \uC5ED \uC778\uB371\uC2A4(inverted index), \uC5ED \uD30C\uC77C(inverted file)\uC740 \uB0B1\uB9D0\uC774\uB098 \uC22B\uC790\uC640 \uAC19\uC740 \uB0B4\uC6A9\uBB3C\uB85C\uBD80\uD130\uC758 \uB9E4\uD551 \uC815\uBCF4\uB97C \uB370\uC774\uD130\uBCA0\uC774\uC2A4 \uD30C\uC77C\uC758 \uD2B9\uC815 \uC9C0\uC810\uC774\uB098 \uBB38\uC11C \uB610\uB294 \uBB38\uC11C \uC9D1\uD569 \uC548\uC5D0 \uC800\uC7A5\uD558\uB294 \uC0C9\uC778 \uB370\uC774\uD130 \uAD6C\uC870\uC774\uB2E4. \uC5ED\uC0C9\uC778\uC758 \uBAA9\uC801\uC740 \uBB38\uC11C\uAC00 \uB370\uC774\uD130\uBCA0\uC774\uC2A4\uC5D0 \uCD94\uAC00\uB420 \uB54C \uB298\uC5B4\uB098\uB294 \uCC98\uB9AC\uB97C \uC704\uD574 \uBE60\uB978 \uC804\uBB38 \uAC80\uC0C9\uC744 \uAC00\uB2A5\uCF00 \uD558\uB294 \uAC83\uC774\uB2E4. \uC5ED \uD30C\uC77C\uC740 \uC0C9\uC778\uC774 \uC544\uB2CC, \uB370\uC774\uD130\uBCA0\uC774\uC2A4 \uD30C\uC77C \uADF8 \uC790\uCCB4\uB97C \uAC00\uB9AC\uD0AC \uC218\uB3C4 \uC788\uB2E4. \uC2DC\uC2A4\uD15C\uC5D0 \uC4F0\uC774\uB294 \uAC00\uC7A5 \uB300\uC911\uC801\uC778 \uB370\uC774\uD130 \uAD6C\uC870\uB85C\uC11C, \uC774\uB97C\uD14C\uBA74 \uAC80\uC0C9 \uC5D4\uC9C4\uACFC \uAC19\uC740 \uB300\uADDC\uBAA8\uC5D0 \uC4F0\uC778\uB2E4. \uC77C\uBD80 \uC911\uC694\uD55C \uC77C\uBC18 \uBAA9\uC801 \uBA54\uC778\uD504\uB808\uC784 \uAE30\uBC18 \uB370\uC774\uD130\uBCA0\uC774\uC2A4 \uAD00\uB9AC \uC2DC\uC2A4\uD15C\uB4E4\uC740 \uC5ED\uC0C9\uC778 \uAD6C\uC870\uB97C \uC0AC\uC6A9\uD574 \uC654\uC73C\uBA70 \uC544\uB2E4\uBC14\uC2A4, \uB370\uC774\uD130\uCF64/DB, \uBAA8\uB378 204 \uB4F1\uC774 \uC788\uB2E4. \uC5ED\uC0C9\uC778\uC740 \uB450 \uAC00\uC9C0 \uC8FC\uB41C \uC885\uB958\uAC00 \uC788\uB2E4: \uB808\uCF54\uB4DC \uB2E8\uC704\uC758 \uC5ED\uC0C9\uC778, \uB0B1\uB9D0 \uB2E8\uC704\uC758 \uC5ED\uC0C9\uC778"@ko . . . . .