Abstract: An upgrade of a first version of a database application to a second version of a database application that both have a same data schema is initiated. The first database application has a first access schema such that at least one table in the data schema is linked to the first access schema. The second version of the database application has a second access schema such that at least one table in the data schema is linked to the second access schema. The first access schema differs from the second access schema. Subsequently, concurrent access is provided for each access schema to at least one database table in the data schema to both the first version of the database application and the second version of the database application. The concurrent access is enabled by using separate read and write channels. Related apparatus, systems, techniques and articles are also described.

Abstract: A system and method for processing raw transaction records received from multiple data sources. The system and method receive multiple raw transaction records from multiple data sources. Transaction pair records are generated from the raw transaction records. Location and entity fields including raw information are identified from the transaction pair records. The raw location and entity information is resolved to generate resolved location and entity information capable of aggregation and further processing, such as the deriving of analytics.

Abstract: The present systems and methods relate to a concept for providing media recommendations targeted to particular, “subject” user. The present systems and methods involve obtaining historical usage data associated with the subject user; identifying candidate users; calculating media preference overlap scores with respect to the subject user and each candidate user; ranking the candidate user according to their media preference overlap scores, and generating recommendations for the subject user from the historical usage data associated with the candidate users.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying implicit question queries. In one aspect, a method includes receiving a query in unstructured form, comparing terms of the query to query templates, determining, based on the comparison, a match of the query terms to a first query template, wherein the first query template is not determined to be indicative of a question query, determining, based on the first query template, a second query template, and determining that the query is an implicit question query in response to the second query template being indicative of a question queries.

Abstract: In a corpus of scientific articles such as a digital library, documents are connected by citations and one document plays two different roles in the corpus: document itself and a citation of other documents. A Bernoulli Process Topic (BPT) model is provided which models the corpus at two levels: document level and citation level. In the BPT model, each document has two different representations in the latent topic space associated with its roles. Moreover, the multi-level hierarchical structure of the citation network is captured by a generative process involving a Bernoulli process. The distribution parameters of the BPT model are estimated by a variational approximation approach.

Abstract: A metadata layer management system is presented. Layers of metadata objects can be constructed where each metadata layer object comprises a rights policy. As entities interaction with the metadata layer objects, possibly by navigating links among the objects, each entity's access rights to the objects are governed by the rights policy. Further, the disclosed techniques provide for resolving rights conflicts among the rights policies of the metadata layer objects.

Abstract: A method for setting transactions of multiple data objects is provided. The method includes steps of: (a) a server acquiring information on multiple data objects used for a service object, and obtaining information on data sources which are set to correspond respectively to the data objects by referring to a setting file; and (b) the server determining the multiple data objects to be used by local transactions or distributed transactions by referring to the information on the data source.

Abstract: A method and apparatus for automatically backing up application data and performing restoration as required are disclosed in the embodiments of the present document, which relates to application data backup and restoration technology of a terminal system. The method includes: an application layer setting an application data directory of an application into a system constant according to a backup instruction; a bottom layer acquiring a directory permission of the application data directory through the application data directory in the system constant; the bottom layer setting a permission of the application data directory to read-write; and the application layer backing up the application data under the application data directory of which the permission has been set to read-write, to perform restoration as required by using a backed-up application data hereafter.

Abstract: Query models for document sets (such as XML documents or records in a relational database) typically involve a schema defining the structure of the documents. However, rigidly defined schemas often raise difficulties with document validation with even inconsequential structural variations. Additionally, queries developed against schema-constrained documents are often sensitive to structural details and variations that are not inconsequential to the query, resulting in inaccurate results and development complications, and that may break upon schema changes. Instead, query models for hierarchically structured documents that enable “twig” queries specifying only the structural details of document nodes that are relevant to the query (e.g., students in a student database having a sibling named “Lee” and a teacher named “Smith,” irrespective of unrelated structural details of the document).

Abstract: A method of providing a level of certification of an attribute of an item is disclosed. A requirement is determined for a level of certification for an attribute of an item. A notification is provided of an evidence item that is to be submitted to evaluate the level of certification of the attribute of the item. The evidence item is received. The level of certification of the attribute of the item is determined based on the received evidence item.

Abstract: A system and a method are disclosed for efficiently executing database queries using a computing device that includes a central processing unit (CPU) and a processing unit based on single instruction multiple thread (SIMT) architecture, for example, a GPU. A query engine determines a target processing unit to execute a database query based on factors including the type and amount of data processed by the query, the complexity of the query, and the current load on the processing units. An intermediate executable representation generator generates an intermediate executable representation for executing a query on a database virtual machine. If the query engine determines that the database query should be executed on an SIMT based processing unit, a native code generator generates native code from the intermediate executable representation. The native code is optimized for execution using a particular processing unit.

Abstract: A method (200) for searching the Internet (14n). The method (200) including the steps of: in response to a user search query, identifying at least one search origin (12n) comprising an Internet resource (12n) deemed of relevance; retrieving and reviewing the contents of the search origin (12n) to identify the presence of one or more search avenues (12n) stemming from the search origin (12n), identifiable search avenues comprising: sites (12n) which are ascertained by the search origin contents (12n); submission fields presented by the search origin (12n); and/or, dynamically generated content (12n) retrieved from the search origin, and, perusing identified search avenues (12n) to identify search results to be returned in response to the user search query.

Abstract: A system having a first data storage element storing a first set of data including patient images and a second data storage element storing a second set of data that is derived from the first set of data, the second set of data including searchable data that is descriptive of the first set of data and excludes the patient images.

Abstract: An index server may be configured to collect content associated with an entity, and process the content for indexing at a primary index queue. At least one portion of the content may be marked for exclusion from the primary index queue, and the marked content may be transferred to a secondary index queue to be processed for indexing. A comprehensive index may be stored based on the processing performed at the primary and secondary index queues such that the content associated with the entity is wholly represented by indexed content. If the secondary index queue is disabled, automatically or in response to a request from the entity, the content processed for indexing at the primary index queue may be stored in an index excluding the marked content. In some examples, the comprehensive index and/or the index with excluded marked content may be provided to a compliance server for analysis.

Abstract: User interactions with a database storage system allow creation of virtual databases based on point-in-time copies associated with a source database. Multiple point-in-time copies are obtained for each source database. A point-in-time copy retrieves data changed in the source database since the retrieval of a previous point-in-time copy. A virtual database (VDB) is created by creating a set of files in the data storage system and mounting the files on a database server allowing the database server to access the files. User interactions allow the user to specify the source database, a point in time associated with the source database and a destination server to create the virtual database. User input can specify other attributes associated with the virtual database including the file paths, database parameters etc. The user can specify schedules of various actions, including making and retention of point-in-time copies.

Abstract: An optimization system includes a) one or more processors; b) a loop search engine configured to perform a loop search based on a random blending ratio of blending components for at least a product, and to generate a first optimized blending ratio; and c) a local search engine configured to perform a local search based on the first optimized blending ratio, and to generate a second optimized blending ratio. The loop search engine and the local search engine are implemented on the one or more processors.

Abstract: A system, method, and computer program product for generating healthcare data keyword files is disclosed. The system may include a reader module on a computer, a mapper module on a computer, and a generator module on a computer. The reader module may be configured to read one or more healthcare data fields associated with a first vendor and read one or more portions of healthcare data associated with the one or more data fields. The mapper module may be configured to allow a first mapping of the one or more data fields to one or more keyword fields. In accordance with the first mapping, the generator module may be configured to generate one or more keywords associated with the one or more portions of healthcare data.

Abstract: A file cloning mechanism allows for quickly creating copies (clones) of files within a filesystem, such as when a user makes a copy of a file. In exemplary embodiments, a clone of a source object is at least initially represented by a structure containing references to various elements of the source object (e.g., indirect onodes, direct onodes, and data blocks). Both read-only and mutable clones can be created. The source file and the clone initially share such elements and continue to share unmodified elements as changes are made to the source file or mutable clone. None of the user data blocks or the metadata blocks describing the data stream (i.e., the indirect/direct onodes) associated with the source file need to be copied at the time the clone is created. At appropriate times, cloned files may be “de-cloned.

Abstract: A system for exploring data in a database comprises a query parser, a parameter manager, a query submitter, and a result formatter. The query parser is to receive a base query and determine an input parameter from the base query. The parameter manager is to provide a first request for a value for the input parameter; receive the value for the input parameter; and provide a second request for the value for the input parameter. The query submitter is to determine a first query using the base query and the value for the input parameter; and provide an indication to execute the first query. The result formatter is to receive a result associated with the indication to execute the first query.

Abstract: Embodiments are directed to dynamically tuning search result rankings to control how the search results are presented in a user interface and to dynamically updating search result rankings based on tuning inputs. In one scenario, a computer system receives search results with associated search result attributes. The search results are displayed within a user interface according to each search result's determined ranking. The computer system then receives a tuning input at the user interface. The tuning input indicates that a search result ranking model is to be adjusted for various specified search result attributes. Moreover, the search result ranking model determines how each search result is ranked. The computer system then dynamically updates the displayed search results as the search result ranking model is tuned for the specified search result attributes. The dynamic updating includes repositioning, adding and removing search results according to the determined ranking for each search result.