Abstract: A method for optimizing loading of relational data for applications is disclosed. The method includes monitoring a plurality of requests selecting entities and processes to be executed for the selected entities. The plurality of requests is generated in an application server. The method also includes associating an application context with each of the processes to be executed for the selected entities. The application context includes the process to be executed using an entity stored in a database external to the application server. The method further includes generating a fetch plan for the entity stored in the database and modifying, the generated fetch plan in view of the selected entities and the associated application context. The fetch plan may include lazy loading of the entity stored in the database (e.g., by loading the entity from the database and deferring loading of one or more attributes of the entity form the database).

Abstract: A local computing device replicates data stored in a cloud-based storage resource in a way that is substantially transparent to end users. A counter generation module provides a source for sequentially increasing counter indices, each of which is associated with a creation timestamp. When a data record managed by the cloud-based storage resource is created, updated or deleted, an address of the modified data record is recorded in a journal, along with unique counter index and timestamp values. Later, when data records stored in the cloud-based storage resource are to be replicated at the local computing device, data records corresponding to the sequential counter indices listed in the journal are sent to the local computing device. Only those data records which correspond to blocks of uninterrupted sequential counter indices are transmitted to the local computing device, thereby ensuring consistency of the replicated data.

Abstract: Technologies are disclosed for indexing and searching using a single table index. A processing device receives a query and processes a global index associated with a database with respect to the query to identify corresponding identifiers and/or strings, processes indexes associated with data items within the database with respect to the identifiers and/or strings, scans adjacent rows in the index that include identifiers and/or strings, identifies identifiers that are associated with the identifiers and/or strings, scans rows of the indexes to identify additional rows that also include the other identifiers, identifies search results in response to the query, prioritizes the search results based on priority status indicators associated with the search results, and provides the search results, as prioritized, in response to the query.

Abstract: Provided are techniques for distributed balanced optimization for an Extract, Transform, and Load (ETL) job across distributed systems of participating ETL servers using a data flow graph with links and stages for an ETL job to be executed by participating ETL servers is received. A distributed job execution plan is generated that breaks the data flow graph into job segments. The job segments each include a subset of the links and stages and map to one participating ETL server from the distributed systems to meet an optimization criteria across the distributed systems. The job segments are distributed to the participating ETL servers based on the mappings for parallel execution. Also, the distributed job execution plan utilizes statistics to reduce data movement and redundancies and to balance workloads across the distributed systems.

Abstract: Provided are techniques for distributed balanced optimization for an Extract, Transform, and Load (ETL) job across distributed systems of participating ETL servers using a data flow graph with links and stages for an ETL job to be executed by participating ETL servers is received. A distributed job execution plan is generated that breaks the data flow graph into job segments. The job segments each include a subset of the links and stages and map to one participating ETL server from the distributed systems to meet an optimization criteria across the distributed systems. The job segments are distributed to the participating ETL servers based on the mappings for parallel execution. Also, the distributed job execution plan utilizes statistics to reduce data movement and redundancies and to balance workloads across the distributed systems.

Abstract: Provided is a method of collecting and managing information relating to medical diagnostic procedures which includes collecting objective information about a plurality of procedures and subjective information about the results of those procedures. The objective information provides information about the parameters of the procedure and the patient who underwent the procedure while the subjective information includes an assessment of the quality of the results of the procedure. This information can be stored in a database. The database can be accessed and the information therein used in connection with understanding the results of past procedures and planning for future procedures.

Abstract: A system, method, and computer program product for researching online reviews to assess the performance and functionality of digital media consumer products bought online or not (e.g. eBooks, movies, TV shows, music, DVD's, etc.). The system extracts reviews from multiple online sources, including online “stores”, professional articles, blogs, online magazines, websites, etc.; and, utilizes sentiment analysis algorithms and supervised machine learning analysis to present more informative summaries for each product's reviews, wherein each summary includes a sentence that encapsulates a sentiment held by many users; the most positive and negative comments; and a list of features with average scores (e.g. performance, price, etc.). Additionally, the user may view a separate review detail page per product that provides further summaries, such as a short list of other products that the same reviewer gave a very positive review for the features. The user is then able to purchase the product via a link.

Abstract: Described herein are methods, systems and computer program products for entity resolution. Entity resolution, also known as entity matching or record linkage, seeks to identify equivalent data objects between or among datasets. An example method includes creating a deterministic model by defining an entity to be resolved, selecting two datasets for comparison, defining matching predicates for attributes of the datasets to select a set of candidate matches, and defining a precedence rule for the candidate matches to select a subset of the candidate matches. The method includes running the deterministic model on the two datasets. Running the deterministic model includes applying the matching predicates and the precedence rule to data in the datasets that correspond to the attributes. The method also includes applying a cardinality rule to results of the running, and outputting the matching candidates for which the cardinality rule is satisfied.

Abstract: Disclosed are techniques for identifying data items to display in a feed of an enterprise social networking system. A first subset of data items is identified as associated with an inner circle of data sources with which a user interacts at or exceeding a designated frequency, a second subset of data items is identified as associated with an interest graph associated with the user, and a third subset of data items is identified as associated with a group or an organization. A highlights feed can be displayed with different channels, where a first channel is defined by the first subset of data items, a second channel is defined by the second subset of data items, and a third channel is defined by the third subset of data items.

Abstract: A skyline query is a query on a set of tuples which are not dominated by other tuples. The skyline query system includes a sky quad tree generator that generates a quad tree from data, and marks a leaf node, which cannot include a local skyline, as being dominated; a local skyline calculator that computes a local skyline of each leaf node, which is not marked as being dominated, in the sky quad tree; and a global skyline calculator that computes a global skyline by using the local skyline. A quad tree is a tree where each internal node has exactly four children. The skyline query is a query for calculating a skyline, a dynamic skyline, or a reverse skyline from the data, where a dynamic skyline includes dynamic attributes and a reverse skyline identifies queries corresponding to certain skyline results.

Abstract: Systems and methods are provided to improve the efficiency and productivity of using a remote server to display data in a grid. In one embodiment, a method for managing data in a grid displayed on a client device comprises, responsive to receiving a data request from the client device, returning to a cell or cells in the grid a cached calculation result corresponding to the data request if the data request is stored in a cache, and otherwise processing a calculation corresponding to the data request. In this way, a relational database may efficiently handle numerous data requests that would normally be handled by an online analytic processing server.

Abstract: Techniques are described for creating a context-aware landing page. A context-aware landing page is capable of dynamically updating its tiles to include content tiles which are related to a received triggering event. The triggering event can be received from a business context source. When the triggering event is received, a weighting table that contains a plurality of content tiles can be retrieved. The method can then select one or more content tiles to include in the context-aware landing page. The selection of the one or more content tiles can depend on the triggering event.

Abstract: A data management system for calculating and retrieving analytic data involves a computing device coupled to a database. The system includes a measure data structure including a measure-data element, a collection data structure including a collection-data element, and a fact data structure configured to store a fact-data element which includes an aggregated value, a link to the measure-data element, and a link to the collection-data element. The data structures may be, for example, database table structures. The system also includes a fact-analyzer module configured to generate the aggregated value (i.e., a result generated by a query computation performed on the database). The measure-data element defines how the aggregated value is calculated and the collection-data element defines a categorization of the aggregated value. The fact-analyzer module is also configured to store the aggregated value and links to the measure-data element and the collection-data element in the fact-data element.

Abstract: An aspect of the present invention is a computer executable method for characterizing, e.g. for diagnostic purposes, utilizing a reference database, a query sample tissue based on the gene expression data of the tissue. The method is characterized in that it comprises the steps of calculating an expression match score (EM-score) indicating the likelihood of having the gene expression level observed in the query sample in each of the tissue categories of the reference database, calculating for the genes of the sample tissue, using e.g. the EM-score, tissue specificity score (TS-score), that expresses how uniquely a gene identifies the query sample as belonging to a certain tissue category, calculating, utilizing e.g. the TS-score, overall similarity of the sample tissue in relation to a tissue category of the reference database, and storing at least some resulting characterization data to a memory device or outputting the data to an output device of a computer.

Abstract: This invention provides a contextual search tool to a user. The contextual search tool receives a search from the user and provides search results, content, and dynamic contextual information (e.g., dynamic contextual questions, user information, and account information) to the user. The contextual search tool then receives contextual information input from the user with an indication that the user would like to communicate with an advisor, and a communication channel is opened between the user and the advisor. The advisor has access the user's search and provides contextual information input, which allows the contextual search tool to update the search results and the dynamic contextual information. As such, the invention of the present invention improves the ability of the contextual search tool to provide tailored, customized, and relevant search results to the user based in part on advisor input.

Abstract: A technique for providing access to a data object serving as a target of snapshot-shipping replication includes taking a system snap of the data object after completion of each of multiple snapshot-shipping updates. In response to a data storage system receiving an IO (input/output) request to read and/or write to the data object, a data storage system redirects the IO request to a previously generated system snap, so that the data storage system performs the operation specified in the IO request on the system snap rather than of the data object itself.

Abstract: There are instances of a content item having synchronization information, one being an instance of a reference content item, another being a candidate content item. A synchronizing processor determines a synchronization point between the reference content item and the candidate content item, on the basis of matching the synchronization information of the reference content item and the candidate content item. A timeline metadata transmitter transmits stored timeline metadata to a device on which the reference content item is playing, the transmission of the stored timeline metadata beginning from the synchronization point. The stored timeline metadata includes timeline metadata that has been previously aggregated from earlier broadcasts of instances of the reference content item. Related systems, apparatus, and methods are also described.

Abstract: A method and apparatus for content management are provided. The method and apparatus efficiently manage content so as to provide a convenient user interface in an electronic device supporting content playback, browsing and storage. The method includes obtaining attribute information of a content item from a storage device, registering the attribute information in a content database, determining content items to be played back by a content player using the attribute information registered in the content database, creating a content list on the basis of the determined content items, displaying the content list, and playing back a content item selected by a user from the content list.

Abstract: A clustered source code management system is described. The system comprises a plurality of cluster nodes, a shared file server storing repository data, and a load balancer. Each of the plurality of cluster nodes is configured to receive an incoming request sent from a client computer, the incoming request being a source code management request to access repository data stored on the shared file server and process the incoming request to determine if a type of the incoming request is a cacheable request type. If the incoming request is of a cacheable request type, the cluster node is configured to determine if a valid cached response to the incoming request is available on storage media locally accessible to the cluster node; and, if so, respond to the incoming request by communicating the valid cached response to the client computer.

Abstract: Techniques are described for providing visual bundlers that group and represent specified data subsets of very large datasets in a manner that is expressive and intuitive for a user, and which provide a dynamic, configurable visualization that may be leveraged by the user to search, aggregate, or otherwise interact with the data of a very large dataset. By nesting such visual bundlers, a geometric equivalent of a dynamically-generated search tree is realized, in which a structure for executing a search for a desired data element is not required to be fixed or otherwise predefined. Consequently, during a runtime of providing related visualizations, multiple alternative search trees may be created for the same underlying content, with minimal effort, and in a manner that is highly intuitive and useful for the user.