Abstract: A method of providing enterprise applications with shared access to a data warehouse. A web service request is issued over a data network from a first client enterprise application to a second server enterprise application. A database query is then constructed at the second server enterprise application. It is then determined whether a response to the web service request will include the results of posing the database query against the data warehouse, or the SQL syntax necessary to pose the query. If the response is to include the results of posing then the second server enterprise application poses the query against the data warehouse and issues the results to the first client enterprise application. If the response to the request is to include the SQL syntax necessary to pose the query, then the second server enterprise application provides the database query syntax to the first client enterprise application.

Abstract: Embodiments of the present invention provide mechanisms that overcome limitations of existing indexes by creating two-dimensional (2D) spatial indexes to quickly locate data containers that match two or more predicates. This is accomplished by representing metadata attributes describing a data container as dimensions in a 2D space so that a data container can be expressed as a point or a cell in a 2D space with coordinates being a pair of values of the selected attributes. A space filling curve is used to traverse the 2D space and convert each pair of the 2D coordinates to a single space filling curve value. A 2D spatial index is then created based on the computed space filling curve values so that one value can be associated with one or more points (data containers) in the index. Advantageously, the created spatial index provides for searching and processing fewer metadata entries, thereby decreasing the time typically used to search for data.

Abstract: Systems, methods and computer program products for the comparison of anonymized data entries are described. In one embodiment the present invention is a computer-implemented method for comparing anonymized data entries, including separately processing data entries in a query list and a search database by: normalizing, generating variants, scoring, and anonyminizing. The expanded and anonymized data entries in the query list and the search database are then compared to find an exact match. In another embodiment, the present invention is a system for comparing anonymized data entries, having a list expansion module, an anonymizer module, and a matching module.

Abstract: A computer system, method and/or computer-readable medium provide independent data objects to a token in compressed form. The independent data objects are representative of security information associated with the token. The system includes an interface operable to communicate with a token, and a processor cooperatively operable with the interface. The processor is configured to determine a set of independent data objects that are associated with the token, and to aggregate the set of independent data objects associated with the token into a group. Also, the processor is configured for compressing the group into a unit of contiguous data, and writing the unit of contiguous data to the token via the interface.

Abstract: A system to create a first database object in the object-oriented database, the first database object associated with a primary key, a first group ID m, and a first delta ID m, associate a first pointer with the first database object, create a second database object in the object-oriented database, the second database object associated with the primary key, a second group ID n, and a second delta ID n, associate a second pointer with the second database object, and create a third database object in the object-oriented database, the third database object associated with the primary key, the first group ID m, and a third delta ID m+1. The third database object is associated with a change to the first database object.

Abstract: Systems, methods and articles of manufacture are disclosed for detecting a duplicate document. A plurality of documents may be assigned to categories, each category corresponding to a collection of duplicates, or near duplicate documents. A new document may be received. The new document may be evaluated against each category to determine a similarity score between the new document and each category. The new document may be identified as a duplicate based on the similarity scores and thresholds for each category. An action may then be performed on the duplicate based on duplication rules. The thresholds and duplication rules may be customized by a user.

Abstract: A data visualization interactivity architecture may be provided. The architecture may allow the creation of a data visualization, such as a chart, and may expose an interactive feature on the visualization. The architecture may provide integration with multiple rendering platforms. When a user selects the exposed feature, the architecture may translate the selection into a common format and modify the data visualization according to layout rules independent of the rendering platform.

Abstract: A method and system are provided for maintaining profiles of information channels available on the Web, wherein the information channels are accessed via pull-only protocols. The method includes monitoring one or more channels by a channel pull action at a monitoring rate, wherein the monitoring rate is determined for the one or more channels based on the number of update events in a previous time period. The method may optimally include filtering the update events in the time period by a novelty measure, wherein the filtering disregards events that do not include significant novel information. The monitoring rate is adapted based on reinforcement learning applying iterative learning rules over time.

Abstract: A ranking component ranks documents, such as web pages or web sites, to obtain a ranking score that defines a quality judgment of the document. The ranking score of a particular document is based on the ranking score of the documents which link to it and based on affiliation among the documents.

Abstract: The present invention is directed to a method for managing transactions in a telecommunications network. The method includes creating an XML transaction detail file. At least one transaction detail record is stored in the XML transaction detail file in response to a telecommunications transaction. The at least one transaction detail record includes transaction data corresponding to the telecommunications transaction.

Abstract: The invention relates to a system and/or methodology for selectivity estimation of set similarity queries. More specifically, the invention relates to a selectivity estimation technique employing hashed sampling. The invention providing for samples constructed a priori that can efficiently and quickly provide accurate estimates for arbitrary queries, and can be updated efficiently as well.

Abstract: In order to reduce a period of time required for a database operation and maintenance job, provided is a database management method in a database management apparatus that manages a database stored in a storage apparatus including: executing load processing of storing data which is read from the storage apparatus in a memory; executing job processing by reading and writing the data which is stored in the memory; executing unload processing of writing the data which is stored in the memory in the storage apparatus; and executing maintenance processing for the database using the data which is stored in the memory at timing for executing at least one of the load processing and the unload processing.

Abstract: A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.

Abstract: A converter for converting an application program that is executed for every job request into a batch processing program for collectively processing a plurality of job requests. The converter includes: a code identifier for identifying a portion of the application program that includes a service request to another server, and a portion that does not include a service request; an integration unit for converting the service request into a collective service request that collectively issues a plurality of service requests corresponding to the plurality of job requests; a multiplexing unit for converting the processing code in the application program into a multiplexed code for executing multiple processings corresponding to the plurality of job requests; and an output unit for outputting, as the batch processing program, the application program that the integration unit and the multiplexing unit have processed.

Abstract: Real-time attributes are processed according to a syntax schema for a directory access protocol service by associating by a computer a real-time attribute with a directory structure, the real-time attribute being externally stored from the directory structure; responsive to an access request via a directory access protocol for access to a database value for the real-time attribute, obtaining by a computer a current value from a real-time data source external to the directory structure, and converting by a computer the obtained value from a format not compatible with the directory access protocol to a compatible format; and returning by a computer to a requester the converted real-time attribute directly in the directory access protocol, wherein storing and updating of the converted real-time attribute value in the directory structure are eliminated or avoided.

Abstract: A method for transmitting records of changes to data from a production location to a storage location. The method stores in a log, records of changes to data stored at a production location. Those records are transmitted and a transmitted records checkpoint is generated that is transmitted at the end of the transmitted records. A records checkpoint conformation is received and the plurality of transmitted records are purged from the log.

Abstract: A system for administrating over changes to a record shared by a plurality of users authorized to do so is provided with a resource to officiate over an official version of the record and to communicate with the plurality of users over a medium for non-persistent communications. Typically, this medium is the Internet. In response to a request of a given user, the resource replies with a communication sending a copy of the official version. In consequence of a return by the given user of a request to effect given changes, the resource compares a saved original edition of the sent copy to the official version so if in case of a match the resource effects the given changes to the official version, or else not.

Abstract: A method, apparatus, and computer program product provide the ability to locate and display data in a taxonomy. A canonical taxonomy is defined (that is not exposed to a user that is searching for parts) by defining canonical categories and canonical attributes in a hierarchical structure. Mapping taxonomies are defined that define mapping categories that map to both canonical categories and canonical categories plus canonical attributes. Part data is processed based on the mapping taxonomies during which the data is mapped to a canonical category. A search request is specified in a particular mapping taxonomy format and results are returned (and displayed) that include data from multiple different taxonomies.

Abstract: Systems and methods are disclosed for analyzing data-flow using program expressions or terms by extracting a control flow graph node from a work list; merging symbolic term values at join nodes; performing simplification of term values using rewriting logic; determining successors of the graph node to which data must be propagated; and updating symbolic data for elements of the successors.

Abstract: A method, a device and a computer readable storage medium for enhancing user experience associated with searching data associated with one or more applications/services accessible on a mobile computing device. The result of the search is selected organized based on previous history of user actions to present the most relevant data entries to the user. Options associated with the searched data entries are also selected and organized based on previous history of user actions to facilitate performing of the user's intended functions on the mobile computing device. Further, searched data entries may be presented to the user in an argument oriented presentation mode where the searched data entries represent arguments for functions or a function oriented presentation mode where the searched data entries represent functions to be performed on the mobile computing device.