Abstract: A computer receives a query for optimization. The query includes a SEQUENCED join between a temporal parent table and a temporal child table. The parent table has one or more rows. The child table has one or more rows. The parent table has a Primary Key (“PK”) column having a value for each row. The parent table has a temporal dimension having a value for each row. The child table has a Foreign Key (“FK”) column having a value for each row. The child table has a temporal dimension. The child table's temporal dimension has a value for each row. The computer determines that the query, the parent table, the child table, and the join satisfy a set of CURRENT temporal join elimination criteria. The computer determines that the query, the parent table, the child table, and the join satisfy a set of SEQUENCED temporal join elimination criteria. In response, the computer eliminates the join from the query to produce an optimized form of the query.

Abstract: A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.

Abstract: To determine if a set of items belongs to a class of interest, the set of items is binned into sub-populations based on a score, ranking, or trait associated with each item. The sub-populations may be created based on the score associated with each item, such as an equal score interval, or with the distribution of the items within the overall population, such as a proportion interval. A determination is made of how may samples are needed from each sub-population in order to make an estimation regarding the entire set of items. Then a calculation of the precision and variance for each sub-population is completed and are combined to provide an overall precision and variance value for the overall population.

Abstract: A method includes: classifying sampling points (SPs) into ranks so as to satisfy a condition such as a condition that no SP belonging to a certain rank is dominated by another SP belonging to a rank higher than the certain rank; determining, in ascending order from a lowest rank, whether a first SP belonging to a first rank dominates a second SP belonging to a second rank higher than the first rank. When the first SP dominates, while changing the rank from a rank immediately lower than the first rank to the lowest rank, the first SP and SPs dominating the first SP and included in a first set of the first SP are added to a dominating source set of the second SP, and the first SP and SPs in the first set are excluded from SPs for which the determining is executed with respect to the second SP.

Abstract: Described herein are a system and method for remote mirroring of data and metadata from a local node to a remote node using out-of-order delivery (OOD), while also providing data integrity at the remote node. OOD may utilize increased throughput of multiple connection paths between nodes. A mirroring layer/engine executing on the local node may receive related groups of data and metadata for storing to the remote node, each related group comprising one or more data sets and one metadata set that describes and is associated with each of the one or more data sets in the related group. The mirroring layer provides data integrity at the remote node by ensuring that the metadata set of a related group is stored to the remote node only after all the data sets in the related group are stored to the remote node, thus ensuring data consistency at the remote node.

Abstract: Described herein are a system and method for remote mirroring/copying data and metadata sets from a local node to a remote node that reduces the number of metadata sets that are mirrored. In some embodiments, the local node may coalesce metadata sets into metadata chains, each metadata chain comprising a grouping of two or more metadata sets. In some instances, a “representative” metadata set of a metadata chain may be selected for sending to the remote node for storing, wherein the other metadata sets of the metadata chain are not sent to the remote node. In these embodiments, the selected metadata set may represent all the metadata sets in the chain and be the only metadata set in the chain that is transmitted and stored to the remote node. As such, the network congestion between the local and remote nodes may be reduced.

Abstract: With a new function introduced neither to a file server nor to a client terminal, control of displaying only a file or a folder whose access right is held by a user is enabled by using existing file server and client terminal. A gateway server connected to a file server and a client terminal through a network, which has the function of filtering structure information of a folder and a file that the file server has based on access authorization of a user of the client terminal on the user basis and presenting the filtered structure information of the folder and the file to the client terminal of a user who has access authorization for the folder and the file.

Abstract: Aspects of the present invention are directed to a system for next day reconciliation of transportation records. The system having a transportation record storage provider (TRSP) that receives and stores storage medium transportation requests; an outside service provider (OSP) inventory manager that receives and maintains records of transported storage mediums scanned at the OSP; and a reconciliation provider that receives a first list from the TRSP and a second list from the OSP inventory manger, for reconciliation. The reconciliation provider includes receivers for receiving the first and second list; a processing engine that reconciles the first list and the second list; and a reporting unit that reports the results of the reconciliation. The processing engine matches inbound and outbound records of the first list and second list, and processes invalid records; and analyzes and accounts for un-matched records.

Abstract: A first set of search results responsive to a first query during a search session is identified. A snippet is identified for each search result related to the first query. The snippet can be selected based on the location the search tokens from the query in the search result. A second set of search results responsive to a second query during a search session is identified. Repetitive search results can be identified. A second snippet for the repetitive search result is identified. The second snippet can be selected based on the location of the second search tokens in the repetitive search result and the content of the first snippet.

Abstract: In a storage system in which plural end servers 104, intermediate servers 103 and clients 101 are connected to each other via a network 105, when a migration-source end server 104 transfers file-level data to a migration-destination end server 104 via the intermediate server 103, the migration-source end server 104 also transfers data in a differential volume simultaneously, and the migration-destination end sever 104 reconstructs data in a snapshot volume based on the transferred data and transfers response information regarding the reconstructed data to the client 101.

Abstract: There is provided a method and system generate rules and identify data items. The system receives an aspect that is used to describe a data item and a request for at least one candidate value to associate with the aspect. Next, the system identifies a string of text in a database based on the aspect, analyzes the string of text based on the aspect to identify at least one candidate value in the string of text and receives a selection identifying a candidate value. Next, the system generates a rule that includes the aspect-value pair that includes the aspect and the selected candidate value. Next, system associates the aspect-value pair to a first data item based on a publication of the rule. Next, the system receives a query, associates the aspect-value pair to the query, based on the rule, generates a second query that includes the aspect-value pair and identifies the first data item based on the aspect-value pair in the second query for an interface that includes the first data item.

Abstract: Comprehensive methods and systems are described for creating, managing, searching, personalizing, and monetizing a knowledge system defined over a corpus of digital content. Systems and methods are described in which a user can initiate in-depth searches of subject matter and can browse, navigate, pinpoint, and select relevant contexts, concepts, and documents to gain knowledge. Systems and methods are described in which knowledge can be personalized through tagged, personalized context, and personalized context can be shared within social and professional networks, securely and confidentially and with the desired access control. Systems and methods are described in which products and services can be advertised in context and advertising can be selected through a bidding process. Systems and methods are described by which a user can navigate contexts and concepts to obtain relevant information, products and services.

Abstract: A computer implemented method, data processing system, and computer program product for automating information sharing and propagation of control commands and events between software objects created in Web applications and 3D virtual world objects created in virtual world applications. A relationship is created to link a Web object with one or more virtual world objects, or to link a virtual world object with one or more Web objects. A Web application may retrieve the meta-data of one or more virtual world objects or send commands or events to manipulate one or more virtual world objects to which a Web object within the Web application is linked. A virtual world system may retrieve the meta-data of one or more Web objects or send commands or events to manipulate one or more Web objects to which a virtual world object within the virtual world system is linked.

Abstract: A method of presenting search results includes sending to a server a search query, wherein the search query does not include any term that identifies a geographic location, and receiving a set of search results corresponding to a search query. The search results include first results and second results. The first results match the search query. Each first result corresponds to one or more locations associated with a respective geographic location and include links to additional information about the one or more locations. The respective geographic location is associated with a client or a user of the client. The second results correspond to Internet accessible documents that satisfy the search query and include links to the Internet accessible documents that satisfy the search query. The method further includes presenting the first results and second results in a single web browser window.

Abstract: A method and apparatus for referencing a partition of a data storage space in a request to perform an operation with relation to the partition are disclosed. The techniques disclosed do not rely on knowing the partition's name, thus simplifying the process of requesting a database to perform an operation on a partition when that partition's name is unknown. Data such as a DDL statement is received. The data indicates a value in a FOR clause in lieu of the partition name. The data also indicates an operation to be performed with respect to a particular partition of the partitioned space. The particular partition is not named in the received data. Based on the value, it is determined that the particular partition is a first partition. The operation is performed with respect to the first partition.

Abstract: A method and system for determining an updated data source from first and second disparate data sources. A first and second data list is received from the first and second data sources, respectively. The data elements in the first data list matching data elements in the second data list are written to a first aggregation data list. The data elements in the first data list not matching data elements in the second data list are written to an additions data list. The data elements in the second data list not matching data elements in the first data list are written to a first deletions data list. All data elements in the first aggregation data list and the additions data list are written into a second aggregation data list. All data elements matching the data elements in the first deletions data list are written into a second deletions data list.

Abstract: A compact binary encoding technique for information that is logically hierarchically structured, such as XML data, maintains all of the features of XML data in a useable form, such as the hierarchical structure underlying the data. Hence, data encoded in this format can undergo XML-based processing on-the-fly as it is being received or fetched, as if the data was being processed linearly in its textual character-based format. Processing of data encoded in this format can begin without having to wait for and decode the entire data set. The overhead due to XML tags is significantly minimized. The encoded data can be processed more efficiently because the data is pre-parsed. Values may be stored in their native type formats and, therefore, processing of the encoded data avoids costly type conversions. Further, any available structural constraint information can be effectively exploited.

Abstract: XML schema evolutions can be performed on an XML-type database using partial data copy techniques. The partial data copy techniques provide mechanisms to identify a minimal set of data in the database that needs be copied out in order for schema evolution operations to occur. Identifying the minimal set of data involves comparing an existing XML schema to a new XML schema and determining the differences between the two schemas. Based on those differences, a minimal set of data can be determined. That data can then be copied to a temporary storage location, while the XML schema and its associated database structure are updated to conform to the new XML schema. Then, the minimal set of data is copied back into the modified database structure.

Abstract: An application for a computer system providing a social network for traveling people includes social network software executing on a server computer for providing social network functions. The social network software maintains a list of members and, for each member, maintains a list of buddies of the member, the buddies also being in the list of members. At least one schedule is available, either internal to the social network or external to the social network and extraction software extracts layover data from the schedule(s) and analysis software finds members with layovers in the layover data.

Abstract: Methods, systems, graphical user interfaces, and computer-readable media for visually searching and exploring a set of objects are provided. A computer system executes a method that generates three-dimensional representations or two-dimensional representations for a set of objects in response to a user interaction with an interface that displays the three-dimensional representations or the two-dimensional representations. The interface includes filter controls, sorting controls, and classification controls, which are dynamically altered based on the content of a user query or the attributes of the objects in the three-dimensional representations or two-dimensional representations.