International Business Machines Corporation

Hewlett Packard Enterprise Development LP

University of Utah Research Foundation

Feifei Li

Anastasios Kementsietsidis

Songyun Duan

Wangchao Le

Philip Shilung Yu

Yuan-Chi Chang

Achille Belly Fokoue-Nkoutche

Kavitha Srinivas

George Andrei Mihaila

Ioana Roxana Stanoi

Jimeng Sun

Qin Yue Chen

Spyridon Papadimitriou

Han Su

Chang Xin Miao

Chao Wei

Min Wang

Yu Sun

Qi Liang

Zhao Cao

Xiaoyang Wang

Shimin Chen

Cody Hansen

Su Han

Liu Xin

A method for network communication across application containers in a computer server system includes executing, by a computer system, a host operating system (OS). The host OS is an instance of an OS. The host OS includes multiple application containers operatively coupled to a memory. The method further includes executing, by the host OS, a virtual network interface for each of the application containers. The method further includes implementing, by the host OS, a remote direct memory access (RDMA) transparently for communications amongst the application containers by utilizing shared memory communications.

High performance networking across docker containers

Embodiments of the present disclosure relate to a computer-implemented method for container scheduling in a container orchestration system (COS). According to the method, a new unit comprising one or more containers are detected. Available memory for each of a plurality of candidate nodes deployed in the COS is predicted based on page sharing information of each candidate node. The plurality of candidate nodes filtered to obtain a set of filtered nodes are, wherein the available memory of each of the set of filtered node meets a memory size limitation of the new unit. Priorities of the set of filtered nodes are ranked according to one or more priority functions. The new unit is deployed to one of the filtered nodes based on the priorities.

Container scheduling in a container orchestration system

Providing web search results which are verifiable via the blockchain may offer transparency into valid web pages and their availability when conducting a search. One example method of operation may include performing a plurality of web page interactions by a plurality of network node devices operating on a network, validating existence of valid web pages, detecting invalid web pages based on the plurality of web page interactions, and storing a valid page package with the valid web pages in a blockchain.

Trustable web searching verification in a blockchain

A computing system receives as inputs data records stored in a database. The computing parses the data records into file pairs that each include a keyword file and record ID file and merge file pairs into a keyword file and record ID file, where the keyword file includes keywords in sorted order, and where the record ID file includes a list of record IDs for keywords in the keyword file. The computing system further creates an offset file which stores offset values for starting addresses of record ID lists in the record ID file, and generates an index of keywords by assigning unique identifiers to keywords in the keyword file. The computing system also provides a query interface that allows the database's data records to be searched using the generated index of keywords.

Generating and implementing local search engines over large databases

Multiquery optimization is performed in the context of RDF/SPARQL. Heuristic algorithms partition an input batch of queries into groups such that each group of queries can be optimized together. The optimization incorporates an efficient algorithm to discover the common sub-structures of multiple SPARQL queries and an effective cost model to compare candidate execution plans. No assumptions are made about the underlying SPARQL query engine. This provides portability across different RDF stores.

Scalable multi-query optimization for SPARQL

An event log system and method are disclosed. The system includes a plurality of worker nodes to receive and store event log records from a plurality of log sources, and a coordinator node to maintain information about mapping from the plurality of log sources to the plurality of worker nodes. Each worker node comprises an IngestKV module to temporarily store event log records from the log sources and a TimeRangeKV module to permanently store the event log records.

Event log system

Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

Scalable summarization of data graphs

Disclosed is a method, information processing system, and computer readable medium for preserving privacy of nonstationary data streams. The method includes receiving at least one nonstationary data stream with time dependent data. Calculating, for a given instant of sub-space of time, A set of first-moment statistical values is calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.

Preserving privacy of one-dimensional data streams using dynamic correlations

A method, information processing system, and computer readable medium are provided for preserving privacy of one-dimensional nonstationary data streams. The method includes receiving a one-dimensional nonstationary data stream. A set of first-moment statistical values are calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.

Preserving privacy of one-dimensional data streams by perturbing data with noise and using dynamic autocorrelation

Growing community of inventors

Salt Lake City, UT, United States of America

Feifei Li