Abstract: The execution of the one or more database queries can be optimized by using a multi-platform cost model that take into account the respective cost of execution in each one of the multiple execution platforms. The respective costs of the execution can, for example, include cost associated with one or more operators for executing the one or more database queries in each one of the multiple execution platforms and/or the costs of exchanging data between the multiple execution platforms.

Abstract: As an abstract representation, a set of equivalent logical structures representative of multiple execution plans for execution of a database query can be used to optimize a database query. A logical structure can include one or more logical operators each representing multiple physical operators for executing the database query. Group and Operator Rules can be applied as rules to the set of equivalent logical structures to obtain additional equivalent logical structures and logical operator until no additional logical operators can be obtained. A set of possible implementation plans for the total number of the obtained logical operators can be obtained, for example, based on physical and/or implementation context.

Abstract: A method includes (a) while processing data storage requests from users directed to filesystems of a plurality of filesystems served from a data storage system, receiving a request to execute a filesystem reorganization task on a filesystem of the plurality of filesystems, (b) in response to receiving the request, checking whether the filesystem reorganization task has both a global reorganization token and a filesystem-specific reorganization token, the filesystem-specific reorganization token being specific to the filesystem on which the filesystem reorganization task has been requested to execute, and (c) in response to determining that the filesystem reorganization task does have both the global reorganization token and the filesystem-specific reorganization token, executing the filesystem reorganization task to move a data block from one location within the filesystem to another location within the filesystem.

Abstract: A method for personalizing reviews for a user on a social network, comprising the steps of: receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; determining a combined rating and an combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items; and displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items.

Abstract: In accordance with an embodiment, described herein is a system and method for merging a mainframe data file to a target table in a database used by a mainframe rehosting platform. A plurality of programs can be generated by the mainframe rehosting platform based on the target table and the mainframe data file. The generated programs can be used to create in the database an empty temporary table that has the same structure as that of the target table, to upload the mainframe data file to the empty temporary table, and to use an existing merge function in the database to merge the temporary table with the target table. When uploading the mainframe data file to the temporary table, records in the mainframe data file can be read and stored into an array, which can be inserted into the temporary table in a single insert operation.

Abstract: A data management system verifies the accuracy of data retrieved from a primary data store using a checksum tree stored by a secondary data store. A checksum tree is a tree graph that represents a hierarchy of checksums. Leaf nodes of the checksum tree can store checksums for data blocks stored by the primary data store and secondary data store, and parent nodes can represent checksums of their respective child nodes. The data management system can compare reference subtrees within the checksum tree to comparison subtrees that are generated from data retrieved from the primary data store to determine whether the retrieved data is accurate. The data management system can also use the checksum tree to identify which, if any, of the retrieved data blocks are inaccurate.

Abstract: A method for accessing enterprise data is described herein. In an implementation, the method comprises receiving, by an application server), a login request from the user equipment, wherein the login request comprises login credentials corresponding to a user. Further, upon successful authentication of the user, user permissions corresponding to the user are ascertained based on one or more predetermined parameters. Further, a default application list is filtered based on the user permissions to obtain a user specific application list corresponding to the user, wherein the application list comprises a plurality of enterprise resource planning (ERP) modules, and wherein the user specific application list comprises one or more ERP modules from amongst the plurality of ERP modules. The method further comprises rendering the user specific application list to the user equipment for providing access to data corresponding to the one or more ERP modules over the web browser.

Abstract: Methods and systems for generating tailored user interface presentations based on microindustry clustering. According to various embodiments, the system accesses a set of entity profiles and a set of member profiles. The system determines a set of feature vectors for each entity of the set of entity profiles and identifies a set of movement data representing changes in association of one or more members from a first entity to a second entity. The system generates an entity graph for the set of entities and the set of members. The systems generate a first set of clusters in the entity graph, a second set of clusters by partitioning one or more of the first clusters, and a set of third clusters from the set of second clusters, combining one or more of the second clusters.

Abstract: Methods and apparatus to facilitate matching of names for same media content are disclosed. Example methods include analyzing first data associated with first media content and, when a program name/identifier and/or episode name/identifier is not identified in the first data, supplementing the data with second data to form third data and processing the third data with respect to fourth data associated with second media content and calculating a composite match score including a program match score and an episode match score based on processing the third data with respect to the fourth data. When the first media content is determined to match the second media content based on the processing of the third data with respect to the fourth data and a comparison of the composite match score to a threshold is satisfied, a normalized media name is generated for the first media content and the second media content.

Abstract: A method for filtering a product transaction data file involves receiving, by a computer, a query including one or more groups of attribute conditions for filtering the product transaction data file. The attribute conditions in the query are applicable to product attribute data records split across a set of vertically split attribute data files. The method further includes determining which of the product attribute data records split across the set of vertically split attribute data files satisfy all of the one or more groups of attribute conditions in the query, identifying product keys associated with the product attribute data records that satisfy all of the one or more groups of attribute conditions in the query, and using the so-identified product keys to filter product data records in the transaction data file.

Abstract: Aspects of the subject matter described herein relate to backups and change journals. In aspects, a change journal is read to determine changes that have occurred to objects of a file system. From these changes a data structure is created to capture path information and collect changes for each object. Where the data structure is insufficient to identify a complete path, the live file system is consulted. After the data structure is complete, a data protection engine uses the data structure to update a catalog at least to provide the capability to view the namespace of the protected objects at one or more times covered by the catalog.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: The present invention provides a computing device including a system ranking unit, a subset ranking unit, an evaluation module of computing units and a decision module. The system ranking unit is configured to rank at least one or more elements to acquire a first ranking based on features of at least one set of data. The subset ranking unit is configured to select a subset from the elements, and is configured to re-rank elements in the subset to acquire a second ranking. The computing units are configured to calculate a relevance of consistency between the first ranking and the second ranking, and are configured to calculate a second rating associated with a first identification message. The decision module is configured to determine a data access level of the first identification message, and configured to access the data based on the data access level.

Abstract: In an approach, the database server generates a request for data representing rows of a table, the request identifying one or more data blocks stored on a storage system. The database server then generates metadata describing one or more filtering conditions to be applied to the rows and sends the metadata along with the request to the storage system. The storage system, when applying filtering conditions to a column containing a LOB, determines whether the LOB is stored in-line or out-of-line. If the column contains an out-of-line LOB, the storage system skips the filtering conditions on the column. If the column contains an in-line LOB, the storage system applies the filtering conditions to the column. Upon obtaining the filtered data from the storage system, the database server retrieves the data blocks for out-of-line LOBs and applies the skipped filtering conditions to create a final result set.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a query provided from a user device, and determining that the query is implicitly about some entity, and in response: obtaining an approximate location of the user device when the user device provided the query, obtaining a set of entities including one or more entities, each entity in the set of entities being associated with the approximate location, and determining that the query is implicitly about an entity in the set of entities, and in response: providing a revised query based on the query and the entity, the revised query explicitly referencing the entity.

Abstract: Disclosed are various embodiments for a navigation element. An insertion point is identified in a ranking of search results. A navigation element is included in the search results. A selection of the navigation element modifies a constraint used to generate the search result.

Abstract: A system is provided for creating selective snapshots of a database that is stored as one or more segments, wherein a segment comprises one or more memory pages. The system includes a memory storage comprising instructions and one or more processors in communication with the memory. The one or more processors execute the instructions to determine whether a snapshot process is configured to access a selected segment of the one or more segments, assign a positive mapping status to an accessed segment for which the determining unit has determined that it is accessed by the snapshot process and to assign a negative mapping status to a non-accessed segment, and create a snapshot comprises a step of forking the snapshot process with an address space that comprises a subset of the one or more segments.

Abstract: In an approach, the database server generates a request for data representing rows of a table, the request identifying one or more data blocks stored on a storage system. The database server then generates metadata describing one or more filtering conditions to be applied to the rows and sends the metadata along with the request to the storage system. The storage system, when applying filtering conditions to a column containing a LOB, determines whether the LOB is stored in-line or out-of-line. If the column contains an out-of-line LOB, the storage system skips the filtering conditions on the column. If the column contains an in-line LOB, the storage system applies the filtering conditions to the column. Upon obtaining the filtered data from the storage system, the database server retrieves the data blocks for out-of-line LOBs and applies the skipped filtering conditions to create a final result set.

Abstract: A method, system and computer program product for improving the quality of subsequent searches. A request is received from a user to perform a search using the term(s) provided by the user. A search is then performed using the provided term(s). A representation of the search result is depicted as an area (e.g., bubble) with terms of interest displayed outside the area. The area represents a set of documents that were found in the performed search and the terms of interest represent terms that may be of interest to the user based on this set of documents. These terms of interest may be selected by the user to adjust the search result. In this manner, the user is presented with an intuitive view as to how different terms or different searches will have an impact on the search results thereby improving the quality of subsequent searches.

Abstract: A method, system and computer program product for improving the quality of subsequent searches. A request is received from a user to perform a search using the term(s) provided by the user. A search is then performed using the provided term(s). A representation of the search result is depicted as an area (e.g., bubble) with terms of interest displayed outside the area. The area represents a set of documents that were found in the performed search and the terms of interest represent terms that may be of interest to the user based on this set of documents. These terms of interest may be selected by the user to adjust the search result. In this manner, the user is presented with an intuitive view as to how different terms or different searches will have an impact on the search results thereby improving the quality of subsequent searches.