Abstract: A method and system generate an inferential network. Records of searches of a network of linked nodes are stored. Each of the nodes is connected to another one of the nodes by a link. Further, each of the records includes: 1) search terms used in a corresponding search; and 2) results of the corresponding search. The results correspond to nodes of the network. The stored records are analyzed to infer relationships between pairs of nodes of the network. Each of the relationships is inferred from the behavior of one of the nodes of a pair of nodes relative to the other node of the pair of nodes. Inferential nodes corresponding to the nodes of the pairs of nodes are generated, and inferential links between the inferential nodes are generated. The inferential links correspond to the inferred relationships.

Abstract: A system and method for analyzing and reporting data from multiple sources is provided. The system is a foundation for an analytical platform that covers not only traditional relational data, but also a new generation of extensible data formats designed for the web, such as those based on XML (FIXML, FpML, ebXML, XBRL, ACORD, etc.), as well as HTML, E-mail, Excel, PDF, and others. In a preferred embodiment, the eXtensible on-line analytical processing (XOLAP), is a scalable client/server platform that allows the multi-dimensional analysis of modern data types, as well as traditional relational data, by bringing them all into an internal common XML-based model, without the time and expense of creating a data warehouse.

Abstract: A database controller for a database of data items distributed across a plurality of storage units. The database controller configured to store an ordered list comprising, for each of the data items individually, the identifying information of the storage unit upon which the data item is stored. The database controller configured to maintain a frequency record, recording the values of prefix portions of the data items and the number of data items having each prefix portion. Wherein, the ordered list and the frequency record are ordered by applying the same ordering metric to the prefix portions. The database controller being configured to receive a range query specifying a search prefix portion, to use the frequency record to calculate where to find in the ordered list the identifying information of storage units storing the data items having the search prefix, and using that identifying information to retrieve query results.

Abstract: Disclosed is a method for updating an inverted index of a flash solid state disk (SSD). The method including: storing postings of a term that is present in only an in-memory inverted index in a block of an output buffer and reading postings of a last block of each posting list to be updated from an on-disk inverted index to be stored in each block of an input buffer, by scanning the on-disk inverted index and the in-memory inverted index; moving postings of the input buffer to the blocks of the output buffer for each block and attaching new postings of the in-memory inverted index to the block corresponding to the output buffer; and updating the on-disk inverted index by using the postings of each block of the output buffer.

Abstract: A desired object stored on a computer system is retrieved by retrieving one or more objects based on an object attribute to produce initial search results, selecting an object from the initial search results, where the selected object is associated with one or more other attributes, and retrieving one or more additional objects based on one or more of the other attributes of the selected object to expand the initial search results and provide the desired object. The objects are linked to one or more tree structures each associated with an object attribute, such that the retrieving one or more additional objects includes traversing the tree structures linked to the selected object and associated with the one or more other attributes to identify the one or more additional objects.

Abstract: A system for analyzing performance data associated with a mail processing device includes a reporting module operable to receive, over a network, first data related to the operation of a mail processing device at one of a plurality of mail processing sites, wherein each of the plurality of mail processing sites is associated with a database accessible over the network, store the first data in a database associated with the mail processing site of the mail processing device, receive, over the network, second data identifying filter criteria for the first data, filter, using a processor, the first data with the second data, generate, using a processor, a report based on the filtered first data, and communicate the report over the network.

Abstract: A method, system, and computer product for hardening a snapshot in a journal based replication environment comprising a production and replication site, the replicated environment running in production side protection mode, the method comprising sending notification of a start of the check from the production site to the replication site, receiving the notification at the replication site, and recording the start of the check, running a check on the replication environment, associating the check with one or more snapshots, upon completion of the check, and storing the results of the check on the replication site.

Abstract: While speculatively executing a given one of a plurality of transactions concurrently executing on a computer, carry out write operations in a local data block, and automatically create an entry in a checkpoint log when reading from a shared memory. Continuously conflict check during read and tentative commit operations, and carry out a partial rollback upon detection of a conflict. The partial rollback is based upon the checkpoint log.

Abstract: A system includes an application programming interface, an indexer, a security unit and at least one search engine. The application programming interface uploads user-selected custom content from a first user. The indexer indexes the custom content to produce a first search index. The security unit authenticates a user and the at least one search engine receives a search query from the user, searches the first search index based on the search query, and searches a second search index based on the search query and based on results of the user authentication, where the second search index is different than the first search index.

Abstract: A computer implemented method for matching data records from multiple entities comprising providing respective transaction logs for the entities representing actions performed by or in respect of the entities, determining a matching score using the transaction logs for respective pairs of the entities and for predetermined combinations of merged entities by generating a measure representing a gain in behavior recognition for the entities before and after merging, and using the gain as a matching score.

Abstract: A device may receive information that identifies a source database and a destination database, and may receive information that identifies an entity instance included in the source database. The device may determine a base data structure, included in the source database, that is associated with the entity instance, and may generate a dependency graph that identifies a dependency between the base data structure and another data structure. The device may receive an instruction to perform an operation associated with the destination database, and may determine an evaluation order for traversing the dependency graph to generate code for performing the operation. The device may traverse the dependency graph in the evaluation order, and may generate code corresponding to respective data structures identified by the dependency graph. The device may cause execution of the code, based on the evaluation order, which may cause the operation to be performed.

Abstract: A method and system for managing a media advertising enterprise including process and workflow capabilities for enterprise data matching. An EDM (Enterprise Data Management) module can be configured to include a set of rules at an enterprise level to manage disparate and disconnected records associated with an entity. A number of unmatched and enterprise entities that matches with respect to an active entity can be returned based on a fuzzy logic. A matching process can then be performed to accurately match the active entity and the unmatched entities with respect to a parent enterprise entity. The unmatched entity can be put on hold if additional information is required for performing a right match after assigning the parent enterprise entity. A note can also be added in order to place the unmatched entity on hold. Such an optimization mechanism can interactively manage and report records at the enterprise level in a simple and efficient manner.

Abstract: Data may be retrieved from databases using various types of code, functions and programs. To insure that the code, functions and programs comply with privacy requirements and regulations, the code and programs may be audited. In one example, an activity log may be queried to identify code that was executed to retrieve and display database information. A system may then determine whether an unauthorized entity was able to retrieve and/or view the database information. If so, the code or program may be labeled as non-compliant. Alternatively or additionally, a system may parse data retrieval code to determine whether privacy protection code is included therein. If not, the code may be deemed non-compliant. Reports may be generated identifying the non-compliant data retrieval code or function and, in some arrangements, specifying compliance statistics.

Abstract: A method and system for expanding a template tree. A received search request includes (i) a search query and (ii) path information specifying at least one path of data nodes of the template tree. The template tree is a hierarchically organized data structure of data nodes. Each specified path in the path information includes a sequence of data nodes of the template tree. The data nodes in each sequence in each specified path are traversed. Each traversed data node that does not have a child node in the template tree is expanded to form in the template tree one or more child nodes corresponding to each expanded data node. Any other data node of the template tree is not expanded. Each formed one or more child nodes is instantiated with data values by retrieving the data values, in accordance with the search query, from at least one data source.

Abstract: The ranking quality of a ranked list may be evaluated. In an example embodiment, a method is implemented by a system to access log data, ascertain which entries of a ranked list are skipped, and determine a ranking quality metric from the skipped entries. More specifically, log data that reflects user interactions with a ranked list having multiple entries is accessed. The user interactions include at least indications of which of the multiple entries are selected entries. It is ascertained which entries of the multiple entries of the ranked list are skipped entries based on the selected entries. The ranking quality metric for the ranked list is determined responsive to the skipped entries.

Abstract: Mechanisms are provided for performing efficient compression and deduplication of data segments. Compression algorithms are learning algorithms that perform better when data segments are large. Deduplication algorithms, however, perform better when data segments are small, as more duplicate small segments are likely to exist. As an optimizer is processing and storing data segments, the optimizer applies the same compression context to compress multiple individual deduplicated data segments as though they are one segment. By compressing deduplicated data segments together within the same context, data reduction can be improved for both deduplication and compression. Mechanisms are applied to compensate for possible performance degradation.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for controlling access to a multi-tenant database system using a virtual portal. These mechanisms and methods for controlling access to a multi-tenant database system using a virtual portal can enable embodiments to provide great flexibility to a tenant of the architecture to select the content that may be perceived by the tenant users while allowing the owner of the architecture control over the content.

Abstract: A system searches a first search index based on a search query to obtain first search results and searches a second search index based on the search query to obtain second search results. The system further ranks the first search results using a first ranking algorithm and one or more first ranking parameters to produce ranked first search results, and ranks the second search results using a second ranking algorithm and one or more second ranking parameters to produce second search results, where the one or more first ranking parameters are different than the one or more second ranking parameters and where the one or more second ranking parameters include at least one of previous user feedback associated with custom content that corresponds to the second search index, annotations of the custom content provided by a user, or usage patterns associated with users previously accessing and searching the custom content. The system also provides the ranked first and second search results to a user.

Abstract: The present invention provides a text searching method including the steps of: extracting initials of corresponding words in a text to be searched according to a predetermined extracting rule to form an initial character string; creating mapping relation between the extracted initial character string and the text to be searched; performing matching between the initial character string and an abbreviation character string to be searched for; and determining an expanded phrase corresponding to the abbreviation character string to be searched for and a location of the expanded phrase in the text to be searched according to a result of the matching and the mapping relation. The invention further provides a text searching device for implementing the method and a text processor including the text searching device.

Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities.