Abstract: Provided are a method, system and article of manufacture for verifying a record as part of an operation to modify the record. A search request is received to determine whether a record matches a value. A first component executes the search request to determine if the record matches the value. The first component sends a verify request to a second component that did not execute the search request to execute the search request to determine whether the record matches the value. A result of the first and second components executing the search request is logged.

Abstract: In a virtual machine, Java Virtual Machine, or other runtime environment, a system and a method for improving the garbage collection times of the virtual machine memory. The JVM, or a garbage collector operating therein, can estimate, for an area of the memory space, the sum of the pause times for garbage collection of the software objects within the area, and control the garbage collection process so that the sum of the pause times for garbage collection will be lower than a target pause time limit, with a high degree of probability. A preselected compaction area can be pre-compacted to keep the compaction time within the target limit. The garbage collector can also predict the time required for final marking and repeat precleaning until the predicted final marking time is within the limits for pause times, and can improve pause times by redirecting application worker threads to do garbage collector work when entering or leaving the memory subsystem.

Abstract: A system and method are disclosed for identifying a keyword that is a novel concept or anomaly based on prior search results for the keyword. Advertisements may be sold for the keyword, or the keyword may be purchased or recommended for purchase based on anticipation of increased future searches on the keyword.

Abstract: A method and system for reinserting a chain into a hash table of a computer system are described. The chain includes a plurality of keys. The hash table includes a key fields and link fields associated with the key fields. The hash table utilizes an initial collision resolution scheme that precludes coalescing of chains. The method and system include providing a binary tree including nodes corresponding to the keys of the chain. The nodes include a root node corresponding to a root key and at least one child node corresponding to at least one child key. The method and system also include storing a pair of child keys in two empty adjacent key fields and storing a first empty adjacent key value of one of the two empty adjacent key fields in the home link field if the root node is the parent node of more than one child node.

Abstract: An apparatus and method to store data are disclosed. The method provides a data storage system comprising a fossilized data management apparatus interconnected with one or more data storage devices. The method provides to the fossilized data management apparatus information and meta data associated with that information, wherein the meta data comprises a format field, a context field, a retention field, a data management field, and a storage management field. The fossilized data management apparatus instructs the one or more data storage devices to write the information to the one or more data storage devices based upon the meta data format field.

Abstract: There are provided a method and system for determining the validity of a command, which includes: a first step of receiving a command including a predetermined query from a terminal of a user; a second step of generating log information associated with the command, in which the log information includes at least one of the query included in the command, input time point information on a time point of inputting the command, and a network address of the terminal; a third step of recording the log information in a log database; a fourth step of calculating a first determination result with respect to the validity of the command according to a predetermined first determination standard; a fifth step of including identification information determined according to the first determination result in the log information and recording in the log database; a sixth step of periodically searching for log information recorded for a first period with reference to the log database; and a seventh step of determining again the

Abstract: A model repository is provided for storing selected data models generated by a data mining application. The model repository may include one or more index data structures for storing attributes of the models within the model repository. A user may then search through the one or more indexes in order to find a model that suits his or her needs.

Abstract: An apparatus, system, and method are disclosed for detecting entity changes in a storage area network. A discovery module probes a plurality of entities of the storage area network to detect an event in response to a policy, stores attributes of the probed entities, and reports the event with a probe event reference. A monitor module receives a self-announced event reference of the event if an entity communicates the event. A configuration module records the event as an initiated event reference if the event is initiated by an administrator. An event manager synthesizes a report of the event from the event references.

Abstract: A method for translating a stock keeping unit (SKU) hierarchy in a customer order to a type-model-feature (TMF) structure in a vendor's order fulfillment system. A translation table relating the SKU hierarchy and TMF structure is defined. The SKU hierarchy includes SKU numbers that identify a configurable part and configurable options that specify a product. An initial order for the product includes the SKU hierarchy. Using the translation table, the SKU numbers are translated into an instance of the TMF structure. A multi-value characteristic is populated with values that include the SKU numbers and subline identifiers. A second order for the product is created that includes the instance of the TMF structure and subline values associated with the SKU number that identifies the configurable part.

Abstract: A method and system for locating and eliminating orphan files within a secondary storage device. The method includes identifying a secondary file on a secondary storage device, the secondary file being associated with file identification data, identifying a placeholder file on a primary storage device, the placeholder file being associated with an offline reference, and determining if the offline reference of the placeholder file validly references the secondary file.

Abstract: An apparatus and methodology are provided for obtaining data from a data source and providing the data to a data consumer, as well as for providing data from a data provider to an interface. The method provides for sending an origin request message to a data provider, receiving an origin response message having a presentation schema and data, and rendering the data to an interface by providing a presentation language representation of the data according to the presentation schema.

Abstract: Methods for detecting regularly appearing pattern without excessive memory. The method comprises providing a matrix, and each row of the matrix comprises a location index and a count value. The count value is associated with the location index for indicating the number of the predetermined value that appears at certain locations. After a symbol is received, a current location index representing a current location is translated. A comparing row is picked from the matrix. The matrix is arranged in a circular manner such that the first row is a preliminary comparing row. The count value of the first row is incremented when the current location index equals the location index of the comparing row and the received symbol equals the predetermined value. The received symbol is determined as a regularly appearing pattern according to the count values in the matrix.

Abstract: Embodiments of a classification pipeline disclosed herein have the ability to both collect data as it occurs and dynamically redact it, allowing ongoing statistics to be gathered and maintained while simultaneously constraining the total amount of storage capacity that must be dedicated to such a purpose. Various types of information can be extracted from or obtained on the object through the classification pipeline. In one embodiment, the classification pipeline comprises a plurality of layers implemented as a set of services available to network clients through a Web interface or an Applications Programming Interface (API). Each client can subscribe to one or more layers of the classification pipeline at their leisure and tailor their classification pipeline configuration through the interface. The classification pipeline can be configured to collaborate with other software to provide a consistent snapshot of the state of a network environment based on data collected at the time.

Abstract: Embodiments of a data representation system for describing specific data sets, such as documents, web pages, or search engine queries, based on data tokens, such as words or n-grams, contained in a collection of documents are described. Such a system can be used in any type of information retrieval application, such as a document, web page, or online advertisement serving process, based on an information request, such as a query executed through an Internet search engine. For example, when a search is performed at a search engine, a content provider uses the system to represent the search query and compares the query representation against representations of a set of content in order to identify, retrieve and aggregate the content from the set most relevant to the search query, in the form of a web page or other data unit for display or access through the web browser.

Abstract: In a data search system, a user interface is implemented which can present results of data search in a human-recognizable fashion. The data search system includes an image processing unit for displaying a data search result based on a certain search criterion, as a set per search criterion, as well as converting each set into a polygonal Venn diagram, e.g. a dodecagon, having an area corresponding in magnitude to the number of elements in each set. The system also includes a display control unit for causing each Venn diagram to be displayed on a predetermined display device. Each of the multiple Venn diagrams is displayed on the same display screen while keeping its relative relationship with other Venn diagrams based on their search criteria.

Abstract: A generalized axiomatic definition of information-theoretic similarity is provided for taxonomies that are structured as directed acyclic graph form which multiple terns may be used to describe an object. The definition is adaptable in the presence of ambiguity, as introduced by an evolving taxonomy or classifiers with imperfect knowledge, and two new similarity measures are introduced based on the definitions. A pragmatic implementation is also provided for similarity measures that arc tightly integrated with an object-relational database and scales to large taxonomies and large datasets.