International Business Machines Corporation

Ricoh Company, Ltd.

Fuji Xerox Co., Ltd.

Globalfoundries Inc.

Tohru Hasegawa

Hiroshi Itagaki

Shinsuke Mitsuma

Noriko Yamamoto

Tsuyoshi Miyamura

Sosuke Matsui

Yutaka Oishi

Atsushi Abe

Masayuki Iwanaga

Terue Watanabe

Masanori Kamiya

Shunsuke Ishikawa

Asako Ono

Takashi Ashida

Naoki Imai

Takamasa Hirata

Kenta Watanabe

Hiroaki Uetsuki

Yasuyuki Tominaga

Takuya Goto

Yuhko Kanoh Hasegawa

Hiroshi Araki

Issei Yoshida

Xiangning Liu

Takahito Tashiro

Keiichiroh Yutani

Takeshi Ishimoto

Keisuke Nitta

Yasumasa Kajinaga

Daiki Tsuzuku

Hiroaki Kikuchi

Tohru Yashiro

Hiroyuki Miyoshi

Thomas D Weigold

Shinobu Fujihara

Slavisa Sarafijanovic

Kohji Takeuchi

Masaki Komedani

Hironobu Nagura

Taihei Miyamoto

Kazuhiro Ozeki

Masao Takayama

Mathias Bjoerkqvist

Martin Petermann

Masahito Sugita

Daisuke Hayashi

Yasuhiro Takahashi

Eiji Ogura

Yasuo Katano

Shigenobu Hirano

Hiroaki Kobayashi

Koh Fujimura

Yoshinori Tahara

Lucas Correia Villa Real

Toshiyuki Miyata

Takahiko Matsumoto

Fuminari Kaneko

Kazuaki Tsuji

Sukchan Kim

Steven Michael Pritko

Hidekazu Yaginuma

Izuru Narita

Junpei Amano

Takashi Tsutsui

Masaki Wakao

Tomoo Fukuda

Haruhiko Nishida

Naoki Ura

Shun Goto

Toshiyasu Motoki

Hiroki Nishiyama

Kaoru Ohashi

Kosuke Okamoto

Yansen Xu

Hiroshi Itakagi

Aaron Santavicca

Kazuki Matsumaru

A system and method iteratively update a determined structure of a digital document file to remediate disconnected text in blocks of the determined structure. In embodiments, a method includes determining a structure of a digital document file using a document understanding analysis, the structure including blocks of elements having text information; determining for each of the blocks of the digital document file whether text information in the block is disconnected; determining an order of the blocks in the digital document file; pairing two blocks from a list of blocks with disconnected text information to form a block pair, wherein the two blocks are ordered based on the determined order of the blocks; determining that the text information of the block pair forms a complete sentence using natural language processing; and consolidating the block pair to form a new block.

Iteratively updating a document structure to resolve disconnected text in element blocks

A computer implemented method includes identifying a set of target files to be migrated from a primary storage to a secondary storage, extracting text data from the set of target files, identifying a set of keywords corresponding to the extracted text data from the set of target files, determining a number of keyword appearances in each file of the set of target files, assigning an order of migration corresponding to the set of target files such that the target files are written to the secondary storage in order of decreasing number of keywords, and migrating the files to the secondary storage according to the assigned order of migration. The method may additionally include writing the files with the greatest number of keywords closest to the default position of the tape reader. A computer program product and computer system corresponding to the method are also disclosed herein.

Re-ordering files by keyword for migration

Mechanisms are provided for writing files to tape storage. A set of files to be written to the tape storage are identified and, for each file, metadata associated with the file indicating identifiers of users associated with the file is retrieved. For each file, a predicted frequency metric, specifying a predicted frequency of access of the file, is determined based on the identifiers of users associated with the file specified in the associated metadata. The files are sorted to generate a ranked set of files in which each file is ranked relative to the other files in the set of files based on their corresponding predicted frequency metric. The ranked set of files is written to the tape storage in descending order of predicted frequency metric such that files having relatively larger predicted frequency metrics are written relatively closer to a starting boundary of a partition of the tape storage.

Ordering files in magnetic tape storage

A feature of a subject file is identified. The feature is compared to a historical feature of a historical file. A similarity between the subject file and the historical file is calculated based on the comparing. A historical success metric for the historical file is identified. An intensive text extraction success value for the subject file is calculated based on the similarity and the historical success metric. Based on the intensive extraction success value, whether an intensive text extraction method should be performed on the subject file is determined.

Selecting files for intensive text extraction

A computer implemented method includes receiving a list of areas on a subject tape to be read, wherein each area of the list of areas is indicated by a first record number and a last record number corresponding to the area, identifying parameters of a tape drive configured to read the subject tape, wherein the identified parameters of the tape drive contribute to a speed with which the tape drive can read the list of areas, creating a directed graph of the areas on the subject tape based on the identified parameters, wherein the directed graph indicates how long the tape drive will take to read the areas on the subject tape, and determining a fastest reading order of the areas on the subject tape, based, at least in part, on the directed graph and the identified parameters. A computer program product and computer system are also disclosed.

Read order determination on a tape

Systems, methods, and computer programming products for estimating ingestion time of ingested files to be transformed into a searchable state for content mining by an on-premises computing environment or cloud environment, including multi-tenant cloud environments. Ingested files being indexed are analyzed for divisibility. Ingestion time varies based on the number of divisible elements (such as lines) of data within the ingested file and the amount of data per divisible element. A converter divides files into a plurality of elements treated as independent data and calculates the estimated ingestion time based on the number of divisions and file size for each divisible element. Estimated ingestion time is stored to internal fields corresponding to each divisible element in the index for the search data. During content mining, an internal condition is added to received search queries, displaying only search results where the estimated ingestion time is older than the current time.

File ingestion in a multi-tenant cloud environment

A tool for tape library hierarchical storage management. The tool determines there is available tape capacity on a tape cartridge mounted to a tape drive to migrate data from a migration queue during recall operations. The tool sends a locate end of data (EOD) command to the tape drive. The tool determines the migration queue is within a longitudinal position (LPOS) range. The tool writes data from the migration queue to the tape cartridge within the LPOS range.

Appending data to a tape cartridge during recall operations

Described is a content mining system comprising a crawler configured to retrieve a plurality of files from a data storage system. The content mining system further comprises a plurality of converters configured to extract data from the plurality of files retrieved by the crawler from the data storage system, where each of the plurality of converters is configured to process a respective type of data. The content mining system further comprises a plurality of queues interposed between the crawler and the plurality of converters, where each queue is associated with a single converter.

Archived data crawling

A computer-implemented method for altering a current position in a Data Partition of a tape at which the tape transitions to a DATA_FULL state is disclosed. The computer-implemented method includes determining a size of a last Index appended to the Data Partition of the tape. The computer-implemented method further includes altering, based on the size of the last Index appended to the Data Partition of the tape, the current position in the Data Partition of the tape at which the tape transitions to DATA_FULL state to a new position in the DATA Partition of the tape at which the tape transitions to the DATA_FULL state, wherein the DATA_FULL state is a state on the tape in which only metadata write operations are permitted in the Data Partition.

Dynamic tape storage device data buffer

A computer-implemented method, a computer program product, and a computer system for ranking explanatory variables in multivariate analysis. A computer system extracts words from documents related to categories, creates a histogram of the words in each category, and selects top words in each histogram, where the top words are used as representing words in each category. A computer system generates respective feature vectors of explanatory variable candidates and a feature vector of an objective variable, where a feature vector of a corresponding variable includes elements corresponding to respective ones of the categories and a value of element indicates whether a name of the corresponding variable is included in the top words. A computer system calculates cosine similarity between each of the respective feature vectors of the explanatory variable candidates and the feature vector of the objective variable. A computer system ranks the explanatory variable candidates, based on the cosine similarity.

Ranking explanatory variables in multivariate analysis

Described are techniques for a tape unmounting protocol. The techniques include selecting a tape for unmounting from a plurality of tape drives, where the tape for unmounting includes a remaining capacity below a first threshold and a number of migrated files below a second threshold. The techniques further include unmounting the tape for unmounting from a tape drive.

Tape unmounting protocol

An approach for deleting a file from a primary file system. The approach deletes a directory entry, associated with a file, from an in-memory index associated with a secondary file system. The approach updates an index cache associated with a secondary file system, based on the in-memory index. The approach updates a dirty flag, associated with the secondary file system, to a value of TRUE.

Optimizing removable media library file removal

A computer implemented method searches data. A number of processor units generates a candidate search result using an index for a data source in response to a search query by a user, wherein the candidate search result comprises files accessible by the user based on access control information in the index. The number of processor units generates a completed search result with a set of the files from the candidate search result having a confidentiality level less than or equal to a threshold confidentiality level. The number of processor units determines whether the user has access to a file in the candidate search result in which the file has the confidentiality level greater than the threshold confidentiality level for the data source. The number of processor units adds the file to the completed search result in response to the file being accessible by the user in the data source.

Access rights based search results

In an approach to improve magnetic tape file systems through tape-to-tape copying between nodes on a Linear Tape File System using a cluster-wide named pipe. Embodiments transfer data between a first node and a second node. Additionally, both the first node and the second node implement a parallel shared-disk file system through a data path for node data reading and writing from a shared-disk and to the shared-disk. Further, to transfer data between the first node and the second node, embodiments, write, by the first node, the data for tape-to-tape copy from a first tape drive to the shared-disk, and write, by the second node, the data written from the shared-disk to a second tape drive.

Tape-to-tape copying between nodes of magnetic tape file systems

A computer-implemented method for unoptimized tape drive read detection is disclosed. The computer-implemented includes determining whether a read order of a trio of related files is consistent with an order in which the trio of related files are stored on a magnetic tape media. The computer-implemented method further includes generating an unoptimized tape drive read warning in response to determining that the read order of the trio of related files is inconsistent with the order in which the trio of related files are stored on the magnetic tape media.

Linear tape file system unoptimized read detection

Growing community of inventors

Tokyo, Japan

Tohru Hasegawa