Abstract: In accordance with embodiments, there are provided mechanisms and methods for query optimization in a database system. These mechanisms and methods for query optimization in a database system can enable embodiments to optimize OR expression filters referencing different logical tables. The ability of embodiments to optimize OR expression filters referencing different logical tables can enable optimization that is dynamic and specific to the particular tenant for whom the query is run and improve the performance and efficiency of the database system in response to query requests.

Abstract: A system for preparing data, operable with a server computer system having a store for a first file comprising data (e.g. audio data) and a plurality of sets of lossy data generated from the data in the first file. The system comprises a requesting component for requesting at least two sets of the plurality of sets of lossy data; a receiving component for receiving the at least two sets; and a combining component for combining the at least two sets in order to generate a second file. The data in the second file is of reduced lossiness with respect to the data in the first file.

Abstract: A computer-based system for accessing content. The system includes a database in which the content is included in a plurality of content nodes. Each content node is uniquely identified by an identifier in a database table. The table is configured recursively to represent the content nodes. A browser uses one of the identifiers to format a table of contents (TOC) node referring to the corresponding content node. The browser inserts the TOC node into a TOC for accessing one or more of the content nodes. The TOC is recursively configurable in accordance with at least a portion of the table configuration.

Abstract: A method and system for discovering a control event from electronically published documents is provided, in which a control program on a computer identifies electronically published documents stored in a plurality of network servers which potentially contain control events relevant to the control of goods and/or services, the control events being identified by reference to a user interest database containing user interest identifiers. Identified documents are analyzed by a classification program to determine whether control events are present, referring to a control event database. A control event classification is assigned to documents determined to contain at least one discovered control event, the assigned control event classification and information identifying the associated document is stored in a classification database, and a report of discovery of documents containing control events is be provided to a user.

Abstract: In response to a search query having a search term received from a client, a current language locale is determined. A state machine is built based on the current language locale, where the state machine includes one or more nodes to represent variance of the search term having identical meaning of the search term. Each node of the state machine is traversed to identify one or more postings lists of an inverted index corresponding to each node of the state machine. One or more item identifiers obtained from the one or more postings list are returned to the client, where the item identifiers identify one or more files that contain the variance of the search term represented by the state machine.

Abstract: A method of backing up a backup space includes splitting a complete backup of the backup space into a number of rolling backups, and backing up a portion of unchanged files and all changed and new files on each of the rolling backups.

Abstract: Systems and methods are disclosed for using a first deduplicating store to update a second deduplicating store with information representing how data objects change over time, said method comprising: at a first and a second deduplicating store, for each data object, maintaining an organized arrangement of temporal structures to represent a corresponding data object over time, wherein each structure is associated with a temporal state of the data object and wherein the logical arrangement of structures is indicative of the changing temporal states of the data object; finding a temporal state that is common to and in temporal proximity to the current state of the first and second deduplicating stores; and compiling and sending a set of hash signatures for the content that has changed from the common state to the current temporal state of the first deduplicating store.

Abstract: Methods and apparatus, including computer program products, for business intelligence data extraction on demand. In general, a first request is sent from a first system to a second system for a query of a data structure to include indications of updates at the second system to data at both the first and second systems. An indication of an update at the second system is received in response to the first request, where the indication includes an identification of updated data. A second request is sent to a database data structure of the second system for data corresponding to the updated data. The updated data is received at the first system in response to the second request. Data is updated at the first system in accordance with the updated data in response to the receiving the updated data.

Abstract: Systems and methods are disclosed for forming deduplicated images of a data object that changes over time using difference information between temporal states of the data object. The method includes organizing the content of the data object for a first temporal state as a plurality of content segments and storing the content segments in a data store; creating an organized arrangement of hash structures to represent the data object in its first temporal state; receiving difference information for the data object; forming at least one hash signature for the changed content; and storing the changed content that is unique in the data store as content segments, whereby a deduplicated image of the data object for a second temporal state is stored without requiring reception of a complete image of the data object for the second temporal state.

Abstract: Systems and methods are disclosed for performing garbage collection to identify content segments no longer referenced in a deduplicating storage system in which redundant mark operations in a mark-and-sweep technique are avoided. An organized arrangement of hash structures is created for each data object, wherein each structure includes a hash signature for a corresponding content segment and is associated with a reference to the corresponding content segment, and the logical organization of the arrangement represents the logical organization of the content segments as they are represented within the data object. Additionally, for each data object, temporal states are maintained over time. Garbage collection iterates over the temporal structures and, for each temporal structure, marks the garbage collection state for the associated content segments for only the content segments that have changed relative to an immediately prior temporal state of the data object.

Abstract: A method for transparently navigating through exported file system namespaces on a server using a single mount. When an exported file system is mounted onto a client, the client creates a file system ID structure for the exported file system, wherein the file system ID structure is populated with unique properties of the exported file system, and wherein the unique properties include a file system ID. The client also creates an internal virtual file system structure for the exported file system ID structure, wherein the internal virtual file system structure includes a virtual file system ID. Once the file system and virtual file system structures are created, the client links the file system objects created within the mount to the file system ID structure until a user moves from one exported file system to a second exported file system and a new file system ID is detected.

Abstract: According to one aspect of the invention, in response to one or more terms to be indexed, each of the terms is indexed in a regular index. In addition, for each of the terms having multiple characters, at least one prefix portion of the term is indexed in a prefix index, where the regular index is used for regular searches and the prefix index is used for prefix searches without having to combine a plurality of postings lists of the regular index at the point in time.

Abstract: A lookup is performed using multiple levels of compressed stride tables in a multi-bit Trie structure. An input lookup key is divided into several strides including a current stride of S bits. A valid entry in a current stride table is located by compressing the S bits to form a compressed index of D bits into the current stride table. A compression function logically combines the S bits to generate the D compressed index bits. An entry in a prior-level table points to the current stride table and has a field indicating which compression function and mask to use. Compression functions can include XOR, shifts, rotates, and multi-bit averaging. Rather than store all 2S entries, the current stride table is compressed to store only 2D entries. Ideally, the number of valid entries in the current stride table is between 2D?1 and 2D for maximum compression. Storage requirements are reduced.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for distributed nearest-neighbor search for image retrieval are disclosed. An example distributed image retrieval system includes a root server and a plurality of leaf servers. The root server controls the clustering of images in the image corpus, and determines the assignment of image clusters to a collection of leaf servers. Each leaf server is independently configured to perform a two-stage nearest-neighbor search in a locality-sensitive hash space for a received query image within the leaf server's assigned images clusters. Thus, the distributed image retrieval system is modular and amendable to tuning, modifications, duplication, and replacement on a per-server basis. In addition, the design of the image retrieval system allows flexible load balancing among the leaf servers.

Abstract: Systems and techniques for providing a master data framework. The framework receives user input and automatically generates, in accordance with the input, a persistent definition of a business object type. The input can be simple declarations and need not be provided in any particular programming language. Definitions generated by the framework adhere to a same data model, regardless of the business object type they are defining. The framework allows the user to create a definition of a business object type by associating two or more definitions of other business object types. The framework provides services that can be applied, without further customization, to any definition of business object types generated by the framework. These services, for example, can be used by a calling application to instantiate business objects or to change a state of a business object instance.

Abstract: An approach is provided that receives a file request and maintains a set of file versions of the requested file on a network-accessible storage media. The file versions are retrieved from the network accessible storage media along with expected hash values corresponding to each of the file versions. The retrieved file versions are stored in a second nonvolatile storage media, such as a local nonvolatile storage. File versions are selected from newest to oldest. When a file version is selected, a hash value is computed for the file and this hash value is compared to the expected hash value that corresponds to the selected file version. The first (newest) file version with a hash value that matches the expected hash value is selected and returned to the requestor.

Abstract: A database updating application for updating through a one-way data link a remote database in accordance with a change in a reference database is disclosed, which comprises a database trigger client associated with the reference database for generating a database update message in the form of a file or a data packet corresponding to the change in the reference database and sending the database update message to a send node interconnected to a receive node by the one-way data link, and a database trigger server associated with the remote database for receiving the database update message transmitted across the one-way data link and replicating the change on the remote database in accordance with the database update message. The present invention provides database update through a one-way data link that may be implemented efficiently in real time and with a mechanism for verifying the integrity and operability of the one-way data link for the purpose of database update.

Abstract: A computer readable medium encoded with a computer program for handling transaction messages in asynchronous data replication in a database system is disclosed. The computer program provides a high speed parallel apply of transactional changes to a target node such that the parallel nature of the application of changes does not compromise the integrity of the data. The computer program detects, tracks, and handles dependencies between transaction messages to be applied to the target node. If a transaction message has a dependency on one or more preceding transaction messages whose applications have not yet completed, that transaction message is held until the application completes. In addition, the computer program requires significantly less overhead than conventional approaches.

Abstract: A new conversion database associated with information to be finally stored in a host information database is stored in a RAM along with a previous conversion database. Each processing unit refers to the new conversion database to identify data to be held in the host information database of the processing unit itself and refers to the previous conversion database to identify the processing unit which currently holds the data thus identified. The processing unit further relocates the data to be held in the processing unit itself from the processing unit thus identified.

Abstract: A plurality of database hosts hold subscriber information in a distributed manner. A retrieval server processes inquires (host retrieval requests) on which of the database hosts has desired subscriber information stored therein. The retrieval server includes a plurality of processors, and the plurality of processors performs processing in parallel. Therefore, inquiries can be processed at a high speed. Further, a conversion information database and a host information database are provided as in-memory databases, which allow inquiry processes to be processed at a high speed. A call control server can efficiently acquire subscriber information from the database host based on the result of an inquiry made to the retrieval server.