Abstract: Approaches, techniques, and mechanisms are disclosed for maintaining a history of query plans executed for a database command, along with information related to each query plan. A database server receives a request to execute a particular command. The database server determines a plan for executing the particular command. The database server adds first information to a plan history associated with the particular command. The plan history comprises information related to a plurality of plans that have been generated for the particular command. The first information may include, for example, properties of the plan (including an outline of the plan) as well as statistics collected during execution of the plan. The database server may implement techniques for periodically refreshing information in a plan history. The database server may also implement techniques for purging old or less important plans.

Abstract: Embodiments of the invention provide a system and method of automatically generating weights for matching data records. Each field of a record may be compared by an exact match and/or close matches and each comparison can result in a mathematical score which is the sum of the field comparisons. To sum up the field scores accurately, the automatic weight generation process comprises an iterative process. In one embodiment, initial weights are computed based upon unmatched-set probabilities and default discrepancy weights associated with attributes in the comparison algorithm. A bulk cross-match is performed across the records using the initial weights and a candidate matched set is computed for updating the discrepancy probabilities. New weights are computed based upon the unmatched probabilities and the updated discrepancy probabilities. Test for convergence between the new weights and the old weights. Repeat with the new weight table until the weights converge to their final value.

Abstract: A set of one or more candidate parameters associated with a content item is identified. A subset of the one or more candidate parameters is determined. Performance statistics associated with the one or more candidate parameters in the subset are monitored, and the set of one or more candidate parameters or the subset of the one or more candidate parameters are modified based on the performance statistics.

Abstract: In general, one aspect of the subject matter described in this specification can be embodied in a system that includes a network-based information server system; and a computer operable to interact with a user interface device and operable to perform operations including: receiving from the network-based information server system status information corresponding to software applications, the status information including black-list information and phoenix-list information; updating a local cache, retained by the computer, with the status information received from the network-based information server system; generating an identifier for a software application, using a digital certificate and a hash value, when the software application is launched on the computer; checking the identifier for the software application against the status information; and notifying a user of the computer when a match is found during the checking.

Abstract: Embodiments of the invention provide a system and method of automatically generating weights for matching data records. Each field of a record may be compared by an exact match and/or close matches and each comparison can result in a mathematical score which is the sum of the field comparisons. To sum up the field scores accurately, the automatic weight generation process comprises an iterative process. In one embodiment, initial weights are computed based upon unmatched-set probabilities and default discrepancy weights associated with attributes in the comparison algorithm. A bulk cross-match is performed across the records using the initial weights and a candidate matched set is computed for updating the discrepancy probabilities. New weights are computed based upon the unmatched probabilities and the updated discrepancy probabilities. Test for convergence between the new weights and the old weights. Repeat with the new weight table until the weights converge to their final value.

Abstract: Embodiments for efficiently computing complex statistics from historical time series data are provided. A hierarchical summarization method includes receiving at least one stream of data and creating data blocks from the at least one stream of data. In another embodiment, a method for computing statistics for historical data includes accessing at least one online stream of historical data, the online stream of historical data including metadata, and creating data blocks from the at least one online stream of historical data. Each data block includes a pair of timestamps indicating a sampling start time and a sampling end time, a number of data samples spanned by the data block, a SUM(X) statistic, a SUM(XX) statistic, and a SUM(XY) statistic computed for the data samples spanned by the data block. Other methods are also presented, such as methods for efficiently and accurately calculating statistical queries regarding historical data for arbitrary time ranges, among others.

Abstract: The invention concerns a method of processing data to provide output data based on a group of data samples having a time stamp falling within at least one rolling time period, the method comprising: receiving a new data sample (DN) and associating said new data sample with a first time stamp; updating said output data corresponding to a first rolling time period to be based on said group of data samples including said new data sample; programming a first callback based on said first time stamp and on the duration of said first rolling time period; and in response to the occurrence of said first callback, updating said output data corresponding to said first rolling time period to no longer be based on said new data sample.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate internal match scores by considering data associated with an entity representation and external match scores by considering data external to the entity representation. The system and method uses the internal match scores and external match scores to make the delinking decisions.

Abstract: The present disclosure provides a method of statistical application in an OLTP environment to reduce the intensive computational load of invoking SQL statements for statistical calculations. The method introduces a time element into statistical records, and use the time element to determine the time status of previously computed statistical records. Upon receiving a query for a statistical record, the system first searches for an existing copy of the statistical record, and checks the time status of the statistical record if found. The system sends the statistical record to the inquirer if the record exists and is unexpired, and invokes an SQL statement to compute the statistical record only if the record does not exist or has expired. The statistical records may be placed in statistical table in a database and/or a cache of an application server. The disclosed strategy may also increase attack resistance of the system.

Abstract: A system, method, and computer-accessible medium are disclosed for maintaining data at a plurality of summary levels in a single table. Data may be summarized into a plurality of summary levels. Each of the summary levels may comprise summarized data over a respective one of a plurality of intervals of time. The plurality of summary levels may vary in granularity of the summarized data. The summarized data in the plurality of summary levels may be stored in a single table in a database.

Abstract: In the present invention, a matrix display area for displaying m×n elements arranged in matrix form and a graph display area for displaying a graph image are set on an identical display screen. The m×n statistics between m variates belonging to a first data group and n variates belonging to a second data group are computed and displayed as matrix elements arranged in n rows and m columns in the matrix display area. A graph image representing a relation between two variates, one of which belongs to the first data group and the other of which belongs to the second data group, and corresponding to one matrix element specified by the matrix element specification section, is formed and displayed in the graph display area on the display screen.

Abstract: Notification of a system incident is received at a first help desk system. In response, an incident record is generated and maintained for the system incident. The incident record includes incident data and a record identification (ID). The incident data and record ID are transmitted from the first help desk system to a second help desk system where a corresponding record is maintained. One of the help desks is assigned an exclusive status to process the system incident. Regardless of which help system is assigned the exclusive status to process the system incident, the incident record is closed at the first help desk system, which automatically triggers closing of the corresponding record in the second help desk system.

Abstract: Resources are typically stored in homogenous data structures by shredding resource data into database tables destroying a native format of the resources. Typical approaches to indexing the resources rely on users indicating properties that should be indexed, using full text searches to create resource index documents, and other such labor and computation intensive processes. Functionality can be implemented to dynamically generate the resource index documents based on resource properties with minimal user input. The resource index documents can be in a common format to facilitate access to resources stored in heterogeneous native resource formats.

Abstract: A system and method for automated database management are provided. Statistics relating to operation of a database may be collected, wherein the database comprises one or more database objects. Characteristics of the database objects may be determined, either automatically or by user intervention, using the collected statistics, one or more policies, and/or one or more definitions. The policies and definitions may be defaults or may be customized by a user. Actions to be performed on the database objects may be determined, either automatically or by user intervention, based on the characteristics of the database objects. A schedule for performing the actions on the database objects may be automatically determined. The actions may be performed on the database objects based on the schedule. The actions on the database objects may be confirmed. The results of the actions on the database objects may be analyzed or monitored. Policies and/or definitions may be reconfigured based on the results.

Abstract: A database system includes servers configured to receive requests from user systems. Each server includes a local and a global store. Each local store stores the number of requests received by its server. The system includes a processor configured to receive the number of requests from servers. The processor is configured to determine the number of requests received by all of the servers, and send this number of requests to each server. The global store stores the number of requests received from the processor. A given server is configured to compare the number of requests received by the servers with a threshold number. If this number is greater than the threshold number, then the given server is configured to send a message to the user systems that the number of threshold requests has been exceeded and/or the given server will discontinue accepting requests.

Abstract: A method and system for performing at least one transaction on at least one column of a table in a database system is disclosed. The method includes determining whether a first transaction of the at least one transaction fulfills all of at least one criteria. The method further includes ensuring that the at least one column is in a shared numeric lock if the first transaction fulfills all of the at least one criteria, wherein the shared numeric lock is a lock that allows at least a second transaction fulfilling all of the at least one criteria to access the same column concurrently with the first transaction without releasing the shared numeric lock between transactions, and wherein the shared numeric lock is released only after all of the transactions fulfilling all of the criteria have completed processing. The method further includes processing the first transaction.

Abstract: Methods, systems, and products characterize consistency of data in a stream warehouse. A warehouse table is derived from a continuously received a stream of data. The warehouse table is stored in memory as a plurality of temporal partitions, with each temporal partition storing data within a contiguous range of time. A level of consistency is assigned to each temporal partition in the warehouse table.

Abstract: An information presenting device for narrowing down information for users and stimulating interest in users from various viewpoints, and presenting the information to users in an easily ascertainable manner. Specifically, a content recommending device displays an image, a commonality map image includes a title image, a Venn diagram image, and a details button image. The Venn diagram in the commonality map image relating to all content is narrowed down to a Venn diagram about a set containing, as elements, content IDs of content having an attribute value, for example, “Mayumi Hamada” for an attribute “artist”. In the content recommending device, a multiple profile acquiring unit acquires viewing/listening history tables including content IDs of content viewed/listened to in player terminals, and a profile common relationship ascertaining unit calculates an extent of a common portion of the acquired viewing/listening history tables. The commonality is expressed as a Venn diagram.

Abstract: In embodiments of the invention, a system receives selections from a user based on a list of pre-defined monitoring categories and/or optionally receives custom category definitions from the user. The option for custom category definitions may be advantageous due to the flexibility provided to a system administrator or other user. In embodiments of the invention, the pre-defined and/or custom monitoring categories may be or include complex hierarchical behavior. Such an approach provides monitoring algorithms that can achieve improved accuracy compared to known methods. In embodiments of the invention, the order of computations used in resolving a monitoring category may be re-ordered, statically and/or dynamically, to improve the efficiency of monitoring operations.

Abstract: A device may receive a packet, obtain data from the packet, store the data in a memory, and send a request to match a portion of the data to a set of patterns, the request identifying the portion in the memory. In addition, the device may access the portion in the memory based on the request, compare the accessed portion to the set of patterns, generate a result by comparing the accessed portion to the set of patterns, and output the result.

Abstract: A computerized system, method and process allows telecommunications carriers to find, evaluate and select locations for equipment through direct access to end users, while providing citizens the opportunity to offer the use of their dwelling or other assets to carriers. The system and method further provides a computerized mechanism for (a) creating an inventory and marketplace for available properties for use in telecommunications networks, (b) providing quality and/or performance monitoring and control for wireless communication systems based on data in the clearinghouse, and (c) providing localized content over wireless networks using the clearinghouse.

Abstract: A search modeling tool is provided that can communicate with multiple enterprise applications to create object definitions describing searchable data stored in each application. The object definitions may be used to extract searchable data from the applications, thus allowing for manipulation of the data in formats usable for text searching, user presentation, and other applications. The search modeler may interface with each application using common protocols, allowing for generalization of object definitions and subsequent crawling across a variety of enterprise applications.

Abstract: Content recommendation apparatus and methods using a tag cloud provide a content recommendation service via a network. The apparatus includes a content tag cloud generating module configured to generate a content tag cloud by analyzing a tag assigned to each content and accumulating frequencies per tag of each content. The apparatus also includes a user tag cloud generating module configured to generate a user tag cloud by accumulating frequencies per tag of contents used by a user. The apparatus further includes a similarity computing module and a recommending module. The similarity computing module is configured to compute a similarity between users using the user tag cloud, and the recommending module is configured to recommend content by computing a probability that a target user will use a specific content based on the computed similarity between users.

Abstract: Embodiments of the invention enable application programs running across multiple compute nodes of a highly-parallel system to selectively migrate objects from one node to another. For example, when an object becomes too large, a node containing the object may migrate the object to another node, thereby freeing memory space. Whether a large object is migrated can be dependent on how frequently the object is used by the application. Because the memory used by such an object is freed for other uses by the application, overall application performance may be improved. On large parallel systems with thousands of compute nodes, even relatively small improvements in application performance an individual compute node may be magnified many times, resulting in dramatic improvements in overall application performance.

Abstract: A method, system and device for monitoring internal database log events in a computer database environment are described. As database updates are detected they are analyzed and used to determine which of several kinds of database maintenance are required. The database administrator is therefore presented with information to allow for more accurate maintenance scheduling and able to prevent unnecessary database maintenance outages.

Abstract: A method and an apparatus to provide chargeback data for data sets are presented. In one embodiment, the method includes allowing an administrator of a data storage system to define a data set having a plurality of storage objects and to associate the data set with a data management policy and an owner. The method includes generating a report allocating usage for billing (for example) for an owner of a data set by tracking the storage elements used to implement the defined data set according to the data management policy. The method may further include using a storage manager to manage and track the data set as a single unit according to the data management policy.

Abstract: A system, an article, and a computer program product for estimating a cardinality value for a set of data values. In one embodiment, the system includes means for initializing a data structure for representing an array of counts; means for obtaining a data value from said set of data values; means for transforming said data value into a transformed string; means for modifying said data structure with said transformed string; means for obtaining a summary statistic value from said modified data structure, wherein the summary statistic value is based on the array of counts; and means for generating said estimated cardinality value using said summary statistic value.

Abstract: A method and apparatus for rapid identification of column heterogeneity in databases are disclosed. For example, the method receives data associated with a column in a database. The method computes a cluster entropy for the data as a measure of data heterogeneity and then determines whether said data is heterogeneous in accordance with the cluster entropy.

Abstract: Various embodiments of the present invention relate to oblivious transfer protocols and to system for performing oblivious transfer. Embodiments of the present invention include a private data sampling protocol that is designed to balance the competing privacy interest of a database user and a database owner. Protocol embodiments enable the database user to obtain a fixed size random sample of the available data held by the database owner without the database owner learning which bits of data were accessed.

Abstract: A method for classifying a previously unclassified posting that includes extracting a plurality of terms from the previously unclassified posting on an application forum, calculating a term answer probability and a term comment probability for each term of the plurality of terms. The term answer probability defines a probability that the term is in an answer posting assigned to an answer class, and the term comment probability defines a probability that the term is in a comment posting assigned to a comment class. The method further includes performing a Bayesian analysis using the term answer probability and the term comment probability for each term of the plurality of terms to select a posting class for the previously unclassified posting. The posting class is either the answer class or the comment class. The posting class is assigned to the previously unclassified posting.

Abstract: Method and apparatus for associating at least one query expression to an original database table is described. In one example, a metadata table is added to a database, wherein at least one portion of the metadata table comprises the at least one query expression. Afterwards, the at least one query expression is associated to at least one value from at least one tuple belonging to a data table of the database.

Abstract: Methods, systems and software applications are provided for storing, updating and retrieving key figures. In accordance with one embodiment, a computerized method is provided for storing values of a variable key figure over time. The method comprises storing a value of the key figure in a first data field and assigning an end date to the first data field. Further, the method includes storing a delta value of the key figure in a second data field and assigning a start date to the second data field, wherein the start date is earlier than the end date.

Abstract: Some embodiments of a method and an apparatus to reduce memory required for prediction by partial matching (PPM) models usable in data compression have been presented. In one embodiment, statistics of received data are accumulated in a tree of dynamic tree-type data structures. The data is compressed based on the statistics. The tree of dynamic tree-type data structures may be stored in a computer-readable storage medium.

Abstract: Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method use a symmetric, transitive and reflexive function to allow for linking records and entity representations whose field values differ. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions.

Abstract: Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method utilize blended field weights to account for certain types of partial matches. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions.

Abstract: Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. Such parameters may be set as negative to account for fields that do not match. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions.

Abstract: A log managing apparatus includes a collecting unit that receives a log from at least one collecting object that acquires the log including time information, a management unit that manages log format information set for each the collecting object, and a conversion unit that converts the log with reference to the log format information and extracts time information from the log.

Abstract: A system analyzing apparatus analyzes a processing state of a computer system that includes a plurality of types of unit processing. The system analyzing apparatus includes a selecting unit that selects a plurality of representative unit processing based on similarities between individual units of the unit processing; and a grouping unit that groups each unit processing based on similarity between the each unit processing and each of representative unit processing selected by the selecting unit.

Abstract: Systems and methods have been developed for managing multiple catalogs of files on a network. The systems and methods may manage a catalog of files with rights for sale and a catalog of rights presented for free public use. The systems and methods may manage these multiple catalogs via determining when one file should be moved from one catalog into another. The systems and methods may manage rights presented in the files, including rights offered for sale, rights offered for free use, where the managing may include changing the classification of those rights based on data relating to the files. The systems and methods may provide the ability to a user to research whether rights in the file are for sale.

Abstract: Systems and methods for detecting instances of click fraud are disclosed. Click fraud occurs when, for example, a user, malware, bot, or the like, clicks on a pay per click advertisement (e.g., hyperlink), a paid search listing, or the like without a good faith interest in the underlying subject of the hyperlink. Such fraudulent clicks can be expensive for an advertising sponsor. Statistical information, such as ratios of unpaid clicks to pay per clicks, are extracted from an event database. The statistical information of global data is used as a reference data set to compare to similar statistical information for a local data set under analysis. In one embodiment, when the statistical data sets match relatively well, no click fraud is determined to have occurred, and when the statistical data sets do not match relatively well, click fraud is determined to have occurred.

Abstract: Whether a change in workload of a database system has occurred can be determined. Investigative queries are formulated. Each investigative query is adapted to test a different resource or a different combination of resources of the database system. The investigative queries are run when the database system is in an unloaded state to acquire unloaded performance metrics. The investigative queries are run when the database system is in a loaded state to acquire loaded performance metrics. Whether executing a current workload of the database system, using a current configuration of the database system, will likely result in a problem developing at a later point in time can also be determined. Simultaneously with actual execution of the current workload on the database system using the current configuration, a simulation of execution of the current workload using the current configuration is performed. The simulation is performed more quickly than the actual execution.

Abstract: Discrepancies in two sets of asset data for an organization are identified and automatically reconciled. One set of asset data may be compiled using automatic physical discovery software while the other set is from a financial system of the organization. Automatic reconciliation is performed according to user-configurable rules and corresponding user-configurable actions.

Abstract: Particular embodiments generally relate to displaying database time using a treemap. A set of database time values is determined for a set of dimensions. The database time values measure performance of one or more databases by the time the database takes to respond to a request. The set of database time values is correlated to a set of cells in the treemap. A size of the cell is determined based on the database time value associated with it. For example, the database time value is correlated to an area of the cell. A layout of the set of cells is determined and the treemap is displayed using the layout. For example, the largest values of database time may be shown with the largest sized cells. This makes it easier for an administrator to review and analyze the database performance across multiple dimensions and determine problem areas affecting the performance of the one or more databases.

Abstract: A method and system is provided for computing an approximation of the number of distinct results of a query over a relational data source. The approximation uses information about dependencies between fields of relations, in particular the number of distinct values of a field for each possible value of another field. This information can be obtained by analysis of the data stored in the relational data source, or may be specified as annotations to a database schema. An approximation of the number of results is and the dependencies between fields of each part of the query are computed. The approximation can be used to reorder parts of a query, by using the estimated size of parts to guide reordering. The approximation can further be used to determine which parts of a query are relevant to the evaluation of a subquery, which can be used to guide the magic sets transformation.

Abstract: The present invention generally provides systems, methods, and articles of manufacture for maintaining a data warehouse having a plurality of fields updated with data from one or more data sources. Rather than automatically update every field of data available in the warehouse, a limited subset of fields identified through their involvement in queries issued against the warehouse are updated. By limiting the fields that are updated, the network bandwidth required to transmit the updates to the data warehouse may be reduced. Further, by removing fields from the data warehouse that are not in use, the size of the data warehouse may be reduced.

Abstract: Algorithms and concepts for maintaining uniform random samples of streaming data and stream joins. These algorithms and concepts are used in systems and methods, such as wireless sensor networks and methods for implementing such networks, that generate and handle such streaming data and/or stream joins. The algorithms and concepts directed to streaming data allow one or more sample reservoirs to change size during sampling. When multiple reservoirs are maintained, some of the algorithms and concepts periodically reallocate memory among the multiple reservoirs to effectively utilize limited memory. The algorithms and concepts directed to stream joins allow reservoir sampling to proceed as a function of the probability of a join sampling operation. In memory limited situations wherein memory contains the sample reservoir and a join buffer, some of the stream join algorithms and concepts progressively increase the size of the sampling reservoir and reallocate memory from the join buffer to the reservoir.

Abstract: A system and method are disclosed for storing element information. A method incorporating teachings of the present disclosure may include, for example, creating a structured text object that includes information representing a collection of metrics for a tracked network node. The network node may be, for example, a computing device, a communication link, and/or an interface mechanism. In practice, the text object may be compressed into a binary element, and the binary element may be stored in a data store.

Abstract: Various methods and apparatuses are described that provide instrumentation and analysis of an electronic design having one or more bus interconnects. A relational database may have defined tables designed for interconnect analysis of transactions occurring between initiator intellectual property (IP) cores and target IP cores of the electronic design. A query tool may be configured to format input data to be stored in the defined tables, and have application programming interfaces to retrieve data from the defined tables based on performing a query. The query tool executes an algorithm based on the query to provide the interconnect analysis.

Abstract: A data management and archive method and apparatus, such as for implementation in an automated system to monitor and manage status, performance and configuration data for a plurality of networked storage components. Analysis and cross-correlation of data related to the plurality of storage components can be done individually, collectively and/or comparatively. A collection manager component of a workload analyzer is implemented to start and stop data collection in the context of a system comprising at least one storage component (or at least two networked storage components). The collection manager includes a command and control module that coordinates requests of data from at least one collection agent configured on at least one host connected to the storage component(s). The collection manager manages collection of data and effects file transfer of collected data according to a user specified policy, and maintains status of the data collected.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for validating queries. These mechanisms and methods for validating queries can enable embodiments to provide more reliable and faster execution of queries both in development and in production. In an embodiment and by way of example, a method for validating queries is provided. The method embodiment includes capturing a query that is directed to a multi-tenant database. A plan is determined by which the query will be applied to the database. The plan is statically analyzed for performance. Then a performance measure is applied to the query.