Abstract: An enhanced process query framework, including receiving a user input defining behavioral and static aspects of a target process artifact, and automatically defining a query specification including an axiom component expressing the static aspect using a logical expression, and a process definition component expressing the behavioral aspect using ontologized ?-calculus. The process further includes querying a process artifact library using the automatically defined query specification, and outputting a candidate process artifact matching the defined behavioral and static aspects, based on querying the process artifact library.

Abstract: A two-level cache to facilitate resolving resource path expressions for a hierarchy of resources is described, which includes a system-wide shared cache and a session-level cache. The shared cache is organized as a hierarchy of hash tables that mirrors the structure of a repository hierarchy. A particular hash table in a shared cache includes information for the child resources of a particular resource. A database management system that manages a shared cache may control the amount of memory used by the cache by implementing a replacement policy for the cache based on one or more characteristics of the resources in the repository. The session-level cache is a single level cache in which information for target resources of resolved path expressions may be tracked. In the session-level cache, the resource information is associated with the entire path expression of the associated resource.

Abstract: To achieve high speed document search, an inverted index is compressed at high compressibility by an encoding method decodable in a high process speed. In compressing an identification number of a document to obtain a byte sequence by the variable byte method, w bits are used to represent the number of occurrences of the indexing term in the document, and x bits are used to represent additional information of the posting, where x and w are integers given as parameters. When the number of occurrences cannot be represented within w bits, a certain value indicating a numeric value that cannot be represented by w bits is stored is written to the said w bits, and anther byte sequence that represents the value by the variable byte method follows. Additionally provided is a means for reading a compressed posting from any position of a list of postings called inverted lists, allowing a binary search on an inverted list.

Abstract: According to one embodiment, a storage device includes an interface, a first and second memory blocks and a controller. The interface receives a content search request. The first memory block stores files and inverted files corresponding to contents included in the files. The second memory block stores a file search table. The controller creates the inverted file for each content included in the files and stores IDs of the files including the content in the inverted file. The controller obtains, by search of the content, a corresponding inverted file from the inverted files stored in the first memory block and stores, in the file search table, the IDs of the files included in the obtained inverted file. The controller outputs the IDs of the files stored in the file search table from the interface as a search result for the content search request.

Abstract: Described embodiments provide coherent processing of hash operations of a network processor having a plurality of processing modules. A hash processor of the network processor receives hash operation requests from the plurality of processing modules. A hash table identifier and bucket index corresponding to the received hash operation request are determined. An active index list is maintained for active hash operations for each hash table identifier and bucket index. If the hash table identifier and bucket index of the received hash operation request are in the active index list, the received hash operation request is deferred until the hash table identifier and bucket index corresponding to the received hash operation request clear from the active index list. Otherwise, the active index list is updated with the hash table identifier and bucket index of the received hash operation request and the received hash operation request is processed.

Abstract: Methods and apparatuses for searching network data for one or more predetermined strings are disclosed. In one embodiment, the string search is a multi-stage search where the stages of the search are performed by different hardware components. In one embodiment in a first search stage, a first processor performs a comparison of blocks of incoming data to determine whether the blocks potentially represent the beginning of one of the predetermined strings. If a potential predetermined string is identified, a second processor performs a further search to determine whether the string matches one of the predetermined strings. Because the first processor searches only for the beginning of the predetermined strings, the first stage comparison can be performed quickly, which improves network performance as compared to more detailed searching. The second stage is performed by second processor, which allows the first processor to search for potential matching strings.

Abstract: A system and method of performing risk assessment of a dataset de-identified from a source database containing information identifiable to individuals is provided. The de-identified dataset is retrieved comprising a plurality of records from a storage device. A selection of variables from a user is received, the selection made from a plurality of variables present in the dataset, wherein the variables are potential identifiers of personal information. A selection of a risk threshold acceptable for the dataset from a user is received. A selection of a sampling fraction wherein the sampling fraction define a relative size of their dataset to an entire population is received. A number of records from the plurality of records for each equivalence class in the identification dataset for each of the selected variables. A re-identification risk using the selected sampling fraction is calculated. The re-identification risk meets the selected risk threshold is determined.

Abstract: A search query is received. Personal information for a user is then determined. A search is performed in a general subdomain of general content using the search query. For example, the general subdomain of general content may be a WWW search. Then, a vertical subdomain is determined based on the personal information. A search is then performed in the vertical subdomain of specialized content using the search query. The search performed in the general subdomain and the search performed in the vertical subdomain generate general search results and vertical search results. The results may be combined and outputted to a client.

Abstract: A method, apparatus and computer program product for providing removal of replicated objects based on garbage collection is presented. Data objects are replicated from a primary source to a backup device. A notification is received from a garbage collection process for at least one data object replicated from the primary source to the backup device, the notification indicating that the data object should be deleted. The data object having the notification is deleted from the backup destination.

Abstract: A reply conforming to applied search criteria is generated using data obtained by a search based upon the search criteria. A reply generating server includes a storage unit storing a plurality of items of basic data; a search unit for searching and retrieving basic data, which is in line with search criteria that has been input by the user of a terminal device, from the storage unit; a reply generating unit which, in a case where a plurality of items of basic data in line with the search criteria exist, generates anew a reply conforming to the search criteria by utilizing the plurality of items of basic data; and a reply transmitting unit for transmitting the reply to the terminal device.

Abstract: Systems and methods for performing an updating process to an in-memory index are provided. Upon receiving notice of document modifications covered by an inverted index associated with a search engine, in the form of an update file, a representation of the modification is published onto various index serving machines. Each index serving machine receiving the update file determines if the modifications are applicable to the index serving machine. If an index serving machine determines that it contains mapping information corresponding to the modified documents, the index serving machine utilizes the update file and associated mapping information to update an in-memory index. In embodiments, the in-memory index is used to provide results to user queries in tandem with the inverted index. In some embodiments, an extra in-memory index is maintained that is revised with constantly incoming metadata updates and the existing in-memory index is periodically swapped with the revised in-memory index.

Abstract: Systems and methods for applying user behavior data to improve search query result ranking are provided. Upon receiving an update file indicating that recent, significant user behavior data is available for a document associated with an inverted index, the update file is published periodically and frequently to an index server. After filtering out the relevant update information from the update file, the index server extracts identifiers of the documents having the associated user behavior data. The update file and the identifier of the documents are utilized to update an in-memory index containing representations of metadata indicative of the user behavior. The in-memory index is continuously updated and utilized to serve search query results in response to user search queries. Search query results from the in-memory index are ranked using the user behavior data prior to serving. Thus, results associated with recent, significant user-behavior metadata receive prominent placement on the search results page.

Abstract: Methods, systems and computer program products for reducing database workload volume. Methods include collecting a sequence of database commands directed to a single database record in a database. The sequence of database commands are reduced to a net result by combining database commands within the sequence of database commands. The net result is written to an output entity when the net result includes a database command.

Abstract: An information retrieval system stores and retrieves documents using particles and a particle-based language model. A set of particles for a collection of documents in a particular language is constructed from training documents such that a perplexity of the particle-based language model is substantially lower than the perplexity of a word-based language model constructed from the same training documents. The documents can then be converted to document particle graphs from which particle-based keys are extracted to form an index to the documents. Users can then retrieve relevant documents using queries also in the form of particle graphs.

Abstract: A user interface may be generated from an XML schema. For a data object definition in an XML schema, a user interface object may be defined, and a memory store for the data object may be created and bound to the user interface object. The user interface component may be defined in the XML schema, as a separate file, or within an XML document. A user interface object may be selected based on the data type, and various limits and display mechanisms and input devices may be configured based on the schema. When bound, the data stored in the memory store may be reflected in the user interface component, and changes to the user interface component may be reflected in the memory store.

Abstract: A system and method for maintaining version information. An identifier (“ID”) that identifies a collection of associated files is obtained. An index is generated that specifies the contents of the collection of associated files. The ID may be saved along with the index in a target version file to convey version information about the collection of associated files. Subsequently, the index may be extracted from the target version file to compare with a corresponding index extracted from a reference version file. The result of the comparison may be used to determine whether the contents of the collection of associated files match a reference.

Abstract: A traceability link establishing method and system. The method includes retrieving by a computing system, mapping data comprising data associating elements of a source model to elements of a target model. The computing system retrieves the target model and elements of the target model. The computing system processes an element of the elements. The computing system retrieves first traceability links from the element. The computing system processes the traceability links. The computing system retrieves supplier data associated with the traceability links. The supplier data comprises data associated with a first supplier. The computing system verifies if the supplier comprises a valid supplier. The computing system stores results of the verifying process. The results indicate if the supplier comprises a valid supplier.

Abstract: Disclosed are a method and framework for mapping data from a data source to a data destination. The method comprises the step of providing a plurality of components for performing defined functions to map the data from the source to the destination. These plurality of components perform the steps of (i) reading data from the source, (ii) processing the read data according to a set of rules, and (iii) loading the processed data into the destination. Preferably the plurality of components perform the further steps of (iv) verifying the integrity of the read data, and (v) logging results into a file. Each of the components operates independently of the other of the components.

Abstract: A computer readable storage medium tangibly embodying machine-readable digital data arranged to facilitate expedited searching. The data includes a plurality of words residing in a table having rows and columns, each word residing in a different row and each letter of the word occupying a different column in that row. Each continuous run of same letters in a column forms an interval. The words are positioned relative to each other to maximize lengths of the intervals, and/or optimize efficiency of compression of the columns by run length encoding.

Abstract: In an information/call center where calls are received, requesting information concerning entities, goods and services, directions to a given destination, etc., data is collected in processing such calls. In accordance with the invention, the collected data is analyzed to generate dynamic data to supplement and/or improve the traditional databases, typically searched by an operator for responses to the information requests. In providing a public information assistance service, such dynamic data may concern, e.g., the most popular movies, restaurants, requested categories, etc. In providing a personalized information assistance service, such dynamic data may concern, e.g., previous telephone connections made for a subscriber, the most popular telephone connections requested by a subscriber, etc. In addition, based on the past search behavior, “fuzzy” logic is developed for correlating between search terms.