Abstract: A method enables identification of a similarity level between a user-provided data item and a data item within a set of data documents. The method includes a representation generator determining, for each term in an enumeration of terms, occurrence information. The representation generator generates, for each term, a sparse distributed representation (SDR) using the occurrence information. The method includes receiving, by a filtering module, a filtering criterion. The method includes generating, by the representation generator, for the filtering criterion, at least one SDR. The method includes generating, by the representation generator, for a first of a plurality of streamed documents received from a data source, a compound SDR. The method includes determining, by a similarity engine executing on the second computing device, a distance between the filtering criterion SDR and the generated compound SDR. The method includes acting on the first streamed document, based upon the determined distance.

Abstract: The present invention relates to a system and methodology to facilitate the automated creation of an XML object model which overlays a standard relational database to allow both saving and retrieval of data via hierarchical XML objects from within the actual database server itself. The Automated Database Object Model (ADOM) process generates a set of log tables, triggers, stored procedures, functions, and views for all objects as determined by a database schema interrogation process. The result is a select query for every hierarchical object in the database, and a single point of entry stored procedure for all inserts, updates, and deletes. A managed application programming interface (API) is also provided to automatically generate a class object library in the application layer which matches the automated database object model, thus abstracting the application developer from directly managing the underlying database structure.

Abstract: In one embodiment, a method includes preparing an initialized user-embedding matrix, where the user-embedding matrix includes multiple columns corresponding to a user, preparing an initialized concept-embedding matrix, constructing an interaction table representing interactions between entities, where an element (i,j) of the table indicates one or more directional interactions from an entity represented by row i to an entity represented by column j, running a training algorithm for the embeddings in the user-embedding matrix and in the concept-embedding matrix, where the training algorithm trains the embeddings such that embeddings representing entities with interactions are located nearby in the embedding space while embeddings representing entities without interactions are located far apart, and providing the embeddings in the user-embedding matrix and in the concept-embedding matrix to a downstream service.

Abstract: Access and management of a user's content may be facilitated by, in response to receiving a request for content related to a specified entity from the repository associated with at least the user's account, identifying, in a content of a file in the repository, an entity container of at least one entity container associated with the specified entity; and communicating the entity container that is associated with the specific entity to a source of the request.

Abstract: A system and method for database migration is provided. In an example embodiment, the database migration technique may include execution modules having a first connection to a source database and a second connection to a target database, and orchestration modules adapted to identify first and second subsets of statements from a single storage table, wherein the first and second subsets of statements are executed by the execution modules during an uptime period of the source database.

Abstract: In accordance with an embodiment, described herein is a system and method for use of immutable accessors with dynamic byte arrays. In accordance with an embodiment, a database driver provides access by software applications executing at an application server to data at a database, including associating a result set cache manager with a pool of result set caches. Each result set cache can be associated with one or more immutable accessors. In response to receiving a request from an application, to access a set of data, the set of data from the database is received into a particular result set cache. In response to receiving a subsequent request for a same set of data, from a same or another application using a same or another database connection, access is provided to the immutable accessor associated with the particular result set cache, for use in accessing the data therein.

Abstract: Mail service method for searching for mail in a mail service system. At least one of a plurality of items configuring a format of mail data is set as at least one card item. A keyword is received, and for mail data that includes the keyword is searched for. A separate mail list for the at least one card item is configured by selecting mail data including the keyword in the at least one card item, and creating a mail card including a tag indicating the at least one card item and a link to the configured separate mail list. A search result that including the created mail card is provided.

Abstract: Provided are techniques for interpreting invalid data that is a portion of a data set as valid data. A request is received to convert data from a first format to a second format for an application, wherein the data is a portion of a data set. It is determined that the data is invalid, wherein the invalid data cannot be processed by the application in the first format. It is determined whether the invalid data is to be interpreted as valid based on a flag. In response to determining that the invalid data is to be interpreted as valid, setting the invalid data to a new value in the second format that can be processed by the application.

Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.

Abstract: The present invention relates to an apparatus and method for executing a query, and a system for processing data by using the same. The apparatus for executing a query includes: a processor receiving a query and returning a result value; and a storage storing data on the query. The storage includes: a first storage temporarily storing data required for the execution of the query; and a second storage constructing a DB and storing data, and the processor combines a plurality of primitives in the query to configure a composite primitive, generates a binary code for the composite primitive in run time, and executes a generated code.

Abstract: Provided are techniques for interpreting invalid data that is a portion of a data set as valid data. A request is received to convert data from a first format to a second format for an application, wherein the data is a portion of a data set. It is determined that the data is invalid, wherein the invalid data cannot be processed by the application in the first format. It is determined whether the invalid data is to be interpreted as valid based on a flag. In response to determining that the invalid data is to be interpreted as valid, setting the invalid data to a new value in the second format that can be processed by the application.

Abstract: The software system discretises continuous attributes by initially sorting attribute value pairs. The system creates partitions based on unique attribute index. The computing system adds attribute value records to the partition element until minimum frequency has been reached. The system calculates whether new partition element is mutually insignificant compared with each of partition elements in a bucket. The system adds the mutually insignificant partition element into the bucket; otherwise, the system closes the bucket and creates a new bucket to add the mutually significant partition element to the new bucket. After all the buckets have been created, the system groups buckets of continuous attributes in to a bucket group so that the buckets in a group are mutually insignificant. If bucket is mutually significant, the system creates a new bucket group and adds subsequent mutually significant bucket to said new bucket group.

Abstract: Described is a system for geocoding social networks by minimizing total variation. A set of social media data from a social media platform having users is received. A social network is generated from the set of social media data based on communication between users. A ground truth set of locations is determined for users who make their locations public, and the ground truth set of locations is propagated across the social network to generate a location estimate for each user. A confidence measure for each location estimate is then generated.

Abstract: Methods and apparatus are provided to categorize and process an incomplete transaction. A transaction pattern table is provided that includes a plurality of records, each record being defined by a transaction pattern identifier. Each record includes a transaction pattern and a metric of occurrence of the transaction pattern. An incomplete transaction is automatically compared to the transaction patterns in the table and a subset of transaction patterns in the table are identified that are potential candidates for matching the incomplete transaction. The incomplete transaction is categorized using the metric of occurrence of the transaction pattern for each transaction pattern in the subset. The incomplete transaction is then processed using the categorization of the incomplete transaction.

Abstract: A system and method of performing backups of a system having persistent and non-persistent virtual desktop infrastructure components, database storage components, and file management components. The method first backs up the file management components, then a database server of the database storage components, and then the virtual desktop infrastructure components in an order of a virtual center server, connection server, and then a composer server. If the virtual desktop environment is non-persistent, the system backs up a master image that is used to create non-persistent desktops, and if the virtual desktop environment is persistent, the system backs up the master image that is used to create non-persistent desktops and virtual storage objects that maintain persistence of an identity of the virtual desktop environment.

Abstract: In general, embodiments of the technology relate to a method for processing read-only transactions. The method includes receiving a read-only transaction, wherein the read-only transaction specifies a page, obtaining a page descriptor, from a page cache, for the page, where the page descriptor comprises a plurality of entries, identifying an entry of the plurality of entries in the page descriptor for the read-only transaction, and processing the read-only transaction using a snapshot of the page associated with the entry.

Abstract: Method, system, and programs for providing content recommendation are disclosed. A first set of candidate content items may be generated based on a user profile, and a second set of candidate items may be generated based on the likelihood that the user will click a corresponding candidate content item in the second set. The candidate content items in the first and second sets may be ranked together using a learning model and presented to the user as content recommendations based on their rankings. The likelihood that the user will click a given candidate content item in the second set may be estimated based on similarities between the given content item and content items related to the given content item. Such a similarity may be computed based on activities performed by users who have viewed both the given content item and a related content item.

Abstract: Various technologies described herein pertain to controlling execution of an automated search task on search results returned by a search engine. The search results are received, where the search results are returned by the search engine responsive to the search engine receiving a seed query. An instantiation of a parameterized query for the automated search task is executed over documents specified by the search results, where the instantiation of the parameterized query describes a linguistic pattern, a structural pattern, and a visual pattern. Further, a set of answer strings is extracted from the documents. The answer strings in the set match the linguistic pattern, the structural pattern, and the visual pattern. The search engine is controlled to provide an output in response to the user search query, the output being based on the set of answer strings extracted from the documents.

Abstract: Save and synchronization status information is provided. The save and synchronization status information may be concise yet informative to a user and may provide an indication of the current save state of the document: “saved,” “dirty,” or “saving.” The indication of the current save state may be displayed in a consistent and reliable spot such that the user may reliably know where to look to find the document's save status. Other save states may be included, such as offline or error. The indication may be selectable, such that when selected, the user may see additional save and synchronization status detail, and may be enabled to rename the document.

Abstract: According to an aspect, a system includes a query engine configured to obtain a multi-provider query model for a query specifying a filter to be applied on provider partitions. The obtained multi-provider query model incorporates a pruning plan. The query engine includes a query optimizer configured to execute the pruning plan during optimization of the multi-provider query model. The pruning plan determines if each of the provider partitions includes content that is required to execute the filter based on pruning information. The query optimizer configured to reduce a scope of the query by excluding at least one provider partition that is determined as not required to execute the filter.