Abstract: A garbage collection system that needs to meet real-time requirements with guaranteed space bounds uses a mostly non-copying hybrid collector that performs defragmentation with limited copying of objects. The garbage collection and the real-time application are interleaved on a time-based schedule. An interval for the interleaving is selected based upon a garbage collector processing rate, a garbage generation rate and a memory allocation rate of the real-time application. An amount of memory for the real-time application and the garbage collection process is selected based upon the maximum excess memory requirement of the garbage collection process and the maximum memory requirement for the application. Defragmentation is only performed when an amount of available memory falls below a predetermined level.

Abstract: A system is provided for allocating combinations of search results, types of space, and/or other information from different sources (e.g., search engines) in which a type of space, search results, and/or other information from at least one source or type or from each source or type, for example, are optimized to obtain an optimum commercial value. Using the example of a search, a commercial metric and a user satisfaction metric are established for search terms and used in the optimization process. In calculating the commercial value and the user satisfaction value for a set of search results, the weight given to the commercial value and the user satisfaction value of a search result is different depending on its source. Optionally, keeping the user satisfaction value above a certain threshold is treated as a constraint while optimizing the commercial value. Alternatively, a tradeoff may be allowed between the minimum threshold for the user satisfaction and a better commercial value.

Abstract: The present invention provides systems and methods that employ a statistical distributional analysis to improve content search engine search results. In particular, a substring and/or a string sequence distributional algorithm can be applied to a set of queries to generate a distributional characteristic (e.g., a profile) for the set of queries, wherein the set is selected from a plurality of queries stored on a query log. Typically, the queries are selected based on a substring of interest and/or an identification of a user initiating searches. The distributional characteristic can then be employed to determine a distributional similarity measure that can be utilized in connection with a search to facilitate search results via providing a mechanism to determine synonymous search terms, spelling corrections/variations, and facilitate collaborative filtering, for example. Thus, the present invention employs a novel technique that mines and employs previous queries to enhance the query search results.

Abstract: The present invention relates to the use of search fusion methods for querying multimedia databases and more specifically to a method and system for constructing a multi-modal query of a multimedia repository by forming multiple uni-modal searches and explicitly selecting fusion methods for combining their results. The present invention also relates to the integration of search methods for content-based retrieval, model-based retrieval, text-based retrieval, and metadata search, and the use of graphical user interfaces allowing the user to form queries fusing these search methods.

Abstract: A database replication function for a local object and one or more destination objects, where one or more local applications make requests to the source objects is disclosed. A request logging function records requests sent by the one or more local applications into a memory log. An update propagation function determines which source object states must be propagated to one or more destination objects based on information quality of service accuracy requirements.

Abstract: A content search circuit for determining whether an input string matches one or more of a plurality of regular expressions, the content search circuit including an instruction memory for storing a plurality of microprograms, each microprogram embodying a corresponding one of the regular expressions, a control circuit having an input to receive the input string, and having a number of outputs, and a plurality of search engines, each having a first input coupled to a corresponding output of the control circuit and having a second input coupled to the instruction memory, wherein each search engine is selectable to execute any of the microprograms stored in the instruction memory to search the input string for any of the regular expressions embodied in the microprograms.

Abstract: Various embodiments of the present invention are directed to a method for manipulating a plurality of discrete units of information (“Items”) in a hardware/software interface system for a computer system, said method comprising interconnecting said Items with a plurality of Relationships and managing said Relationships at the hardware/software interface system level. Each Relationship constitutes, at the hardware/software interface system level, a mapping between a pair of Items that said Relationship interconnects. Moreover, each Relationship may have properties of its own distinct and separate from the properties of the Items it interconnects.

Abstract: The present invention relates to a system and methodology to facilitate automated retrieval and classification of information. A system and associated methods are provided that facilitate generation of code and/or documents. The system includes a component that receives data relating to at least one of a user's request for desired code functionality and one or more desired documents. A mapping component correlates parsed subsets of the data to specific functional objects respectively located remote from the user, wherein a generator employs the functional objects to form at least one of the desired code and the documents.

Abstract: An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.

Abstract: Methods, articles of manufacture, and systems for reducing network traffic for database transactions between a requesting client and a database server are provided. For some embodiments, the client may access statistical information regarding the data, such as that commonly contained in indexes (e.g., encoded vector indexes), conventionally generated for use by a query optimizer. For some embodiments, based on the statistical information regarding the data, the client may request that the server send small byte-code representations of data from the database, rather than the actual data. The small byte-code representations may be significantly smaller than the actual represented data, thus reducing network traffic between the client and server. The client may then retrieve the actual represented data from a corresponding data representation record.

Abstract: An IP address look-up device is for looking up an IP address of an IP packet in order to forward the IP packet. The device includes a ternary CAM including pairs of data string and mask string, with the data string having a prefix of an IP address and the mask string representing a length of the prefix, and having routing entries stored in physical segments, respectively, without regard to order of prefix length, the ternary CAM functioning to compare a search key as a destination address of the IP packet to be forwarded, with the routing entries, set a match line of a matching routing entry, and output a mask string of the matching routing entry; and a priority encoder functioning to compare prefix lengths of mask strings outputted in correspondence to set match lines when at least one match line is set in the ternary CAM, determine, as an LPM entry, a routing entry corresponding to a longest mask string, and output a physical address of the LPM entry on the basis of a match line of the LPM entry.

Abstract: A technique for ranking records of a database is disclosed. In one particular exemplary embodiment, the technique may be realized as a method for ranking records of a database located during a search of an index to the database performed in response to a query, wherein the index has a plurality of index entries, and wherein each index entry has a weight.

Abstract: Documents are indexed in accordance with a process that separates the filtering and word breaking portions of the process so that they are performed under a restricted security setting. When a document is requested by an indexer, the document is retrieved and then passed to the higher security process. The document is then filtered one or more filters and tokenized by one or more wordbreakers under the restricted security setting before being passed to the indexer. The restricted security setting prevents security vulnerabilities from being exploited during the filtering and word breaking processes.

Abstract: A multi-dimensional database query to be sent to a data source may be split into multiple smaller queries by a mid-tier solution and sent individually to the data source(s) for calculation and retrieval of data. This may be accomplished by creating row and column tree structures representing title and header rows and header columns in the query grid. The operation to be performed by the query may then be performed on these tree structures. The grid may then be split based on the resulting tree structures, and forwarded independently to one or more data servers. The results may be merged to generate the complete result or cursored. This allows the system to pass multiple smaller grids to data servers.

Abstract: An image processing apparatus, a method of creating a Web page, an image processing system, an information processing apparatus, and an information processing system are disclosed. The image processing apparatus includes a reception control part receiving a request for a Web page from a terminal connected to the image processing apparatus via a network, first storage means for storing a plurality of compressed document form information files, a decompression part decompressing at least one of the plurality of compressed document form information files in the first storage means into at least one document form data item, second storage means for storing the at least one document form data item, a Web page creation part using a document form data item in the second storage means to create the Web page, and a transmission control part sending the created Web page to the terminal.

Abstract: A method of accessing a shareable computer file includes receiving a request to access the shareable computer file, retrieving a file ID from a stub file corresponding to the shareable computer file, retrieving a file name from a database corresponding to the file ID, accessing the shareable computer file if a user has not modified the shareable computer file, and accessing a modified copy of the shareable file stored in the stub file if the user has modified the shareable computer file. A database is generated in operating system space or accessed using the operating system, and includes file IDs and their corresponding file names for shareable computer files. The stub file is generated locally to correspond to the shareable computer file, and includes a modified copy of the shareable computer file if the shareable computer file has been modified, and a link to the shareable computer file if the shareable computer file has not been modified.

Abstract: A data storage facility for transferring data from a data altering apparatus, such as a production data processing site to a remote data receiving site. The data storage facility includes a first data store for recording each change in the data generated by the data altering apparatus. A register set records each change on a track-by-track basis. A second data store has first and second operating modes. During a first operating mode the second data store becomes a mirror of the first data store. During a second operating mode the second data store ceases to act as a mirror and becomes a source for a transfer of data to the data receiving site. Only information that has been altered, i.e., specific tracks that have been altered, are transferred during successive operations in the second operating mode. Commands from the local production site initiate the transfers between the first and second operating modes.

Abstract: A technique for processing input data is provided. Multiple input rows to beloaded into a first structure are received. Each input row of the multiple input rows is processed to classify each input row as one of an insert row and an update row, wherein input duplicates are stored in the first structure and index entries for the input duplicates are stored in a second structure. After the multiple input rows have been processed, the input duplicates are automatically re-applied to the first structure and the index entries stored in the second structure are processed.

Abstract: When plural copy groups including pairs exist, remote copying for pairs belonging to copy groups is suspended selectively on a copy group-to-copy group basis, instead of suspending remote copying in all the copy groups at once. A computer system has a host computer, plural first storage systems comprising plural first logical disks, and plural second storage systems comprising plural second logical disks. A first logical disk and a second logical disk paired with the first logical disk, and each pair belongs to either a first copy group or a second copy group. To selectively suspend remote copying on a copy group-to-copy group basis, one of the copy groups is specified first and then pairs belonging to this copy group are designated. The first storage systems comprising first logical disks of the designated pairs suspend remote copy processing for the designated pairs.

Abstract: A technique is provided for loading input data in one or more hierarchical format input files into a data store. Parallel processing of one or more input files is performed to output data. The data is serially loaded into the data store while enforcing the order of the data in the one or more input files. Each input file may be a physical file or a logical file.