Abstract: Systems and methods for a search based specification for data synchronization are described. In some embodiments, a method to synchronize information of a client device from a server includes, at a client, receiving a communication from a server to synchronize information between the client device and the server, wherein the information is selected from all application data on the server by a search mechanism in accordance with one or more one or more search criteria, and the information is arranged in an order prior to transmission from the server; and performing operations to synchronize application data on the client in accordance with at least portions of the information received from the server. Other embodiments are also described.

Abstract: Methods, systems, and apparatus, including computer program products, for establishing preferences for sites that are explicitly identified by a user by either a textual input or an acceptance in response to a recommendation, and adjusting the presentation of search results based on these preferences.

Abstract: A method autonomically refreshes a materialized query table (MQT) in a computer database to improve database performance and utility. In preferred embodiments, the query optimizer autonomically initiates a refresh of MQT depending on an estimated time for the query to access the base tables. In other preferred embodiments, the query optimizer estimates the time for the query to access the base tables and compares it to the estimated time to refresh the MQT to determine whether to refresh the MQT and run the query over the MQT rather than the base tables.

Abstract: A method and system disclosed herein can be used to determine relationships between objects, determining which of those relationships are significant for a specific action, and determining physical dependencies between the objects. The method and system can be used to perform actions consistent with integrity constraints, and therefore, performs the actions in the correct order with a reduced likelihood of errors. The method and system are highly beneficial in that they can significantly enhance content management and can be implemented without having to write new or edit existing applications. Also, existing content data and applications may be used without any changes. Accordingly, the method and system can be advantageously useful in deploying or otherwise pushing out new content to existing content systems.

Abstract: In embodiments, methods and systems for improving a query in a database system are provided. These method and system embodiments can enable greater contextual knowledge about the types and use of data in tables underlying a relational database to be employed to improve query efficiency. By employing contextual information, embodiments can provide improved queries and/or make recommendations to a query optimizer of a database system to improve its operation based upon knowledge of the data and/or application gathered. Embodiments can be useful in improving query performance in multi-tenant database systems.

Abstract: Disclosed are methods and systems for indexing or retrieving materials accessible through computer networks.

Abstract: A system and method for efficiently creating a backup volume that is also efficient to recover is described. The backup volume may be created with one save set per media record by utilizing record level multiplexing rather than chunk level multiplexing. Through the use of multiple circular buffers, with each buffer associated with a respective save set, save sets written to storage media are contiguous and individual save set chunks are not separated by chunk headers within the respective media record. Recovery is therefore more efficient since the step of reading chunk headers and locating all the chunks for a save set is no longer required.

Abstract: A file format that includes a constant section and a varying section. The constant section provides a referencing scheme that references the various components that comprise the scene, as well as a listing of attributes of the scene that are modifiable. Within the same file format, the varying section provides an overriding mechanism to modify the attributes that are available to be modified. Accordingly, the disclosed file format can access cached animated geometry directly and/or aggregate other files via the aforementioned referencing and sparse override semantics. This allows the same set of inspection, manipulation, and rendering tools to be used throughout the rendering pipeline, from asset creation to final rendering.

Abstract: A method and system is provided for maintaining customer data in a data store system utilizing a scalable partitioning framework. More specifically, the data store of a customer service system is partitioned (divided) into multiple partitions by a partitionable key of customer data so that each partition owns a subset of the customer data. By maintaining several partitions that store a subset of the customer data exclusive to each other, blackout or brownout problems can be local to one partition and, thus, the availability for the entire system will be increased. Moreover, a set of partitionable keys, a minimal unit to be moved between partitions, is grouped and associated with a partition. By eliminating direct dependencies between the partitions and the partitionable keys, the system can have great flexibility with regard to migrating customer data between partitions and adding a new partition.

Abstract: A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.

Abstract: The described implementations relate to recursive streaming queries. One technique processes a recursive streaming query through a query graph. The technique also detects when output produced by executing the query graph advances to a specific point.

Abstract: A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.

Abstract: The present invention concerns coding an XML-type structured document. The structured document includes values to be coded. The coding uses at least one indexing dictionary which includes entries. At least one entry value of the dictionary linked to the value to be coded is identified, by matching between at least part of one of the values and a subpart of the other value. The value to be coded is coded by reference, according to the matching, to at least the identified entry of the dictionary.

Abstract: A method for data transfer in a data processing system, and corresponding system and machine-readable medium. One method includes receiving by the data processing system a request for a data structure from a calling process, and splitting the data structure into a plurality of substructures by the data processing system. That method includes transferring the plurality of substructures to the calling process by the data processing system, wherein at least two of the substructures are transferred in parallel, and maintaining a transfer state for each substructure in the data processing system.

Abstract: Altering tables in a database system may be difficult because the tables may only be altered when all connection to the tables have been released. A free resources parameter may be set on in a management system for the database system to specify that resources should be attempted to be released. Connections to the database may be closed earlier than conventionally closed. For example, connections that are idle may be released. Once the connections have been released the database may be altered and the free resources parameter turned off. The free resources parameter notifies the database system of a pending alteration and allows the database to gracefully close connections to provide an opportunity for the alteration to occur.

Abstract: Several local databases may be linked together to form a large database. Each database may share a common type definition, but may contain only a portion of the large database. When a local database queries information from another database, the result may be stored locally using the type system. Across the entire database, items may be identified as their local or home database along with an identifier provided by that database. Cached information may be stored locally and may refer to the source for that information through the identifier. Once the cached information is present, queries that reference the record may be satisfied by the cached information. The cached information may be refreshed from the source database or may expire to avoid stale or changed data in the cache.

Abstract: Business Process Execution Language (BPEL) engines and Enterprise Service Buses (ESBs) often connect to adapters to integrate backend packaged applications with a process flow by invoking web services using Java Connector Architecture (JCA) and Simple Object Access Protocol (SOAP) bindings. The Web Service Description Language (WSDL) files for the web services that interact with the adapters can be introspected to harvest adapter integration and transformation information into a service metadata repository. This permits dependency and impact analysis to extend from services to adapters and transformations.

Abstract: Methods and apparatuses for improving performance of database searches are disclosed herein. For example, in some implementations, the methods and apparatuses use a data node structure that prevents the need to duplicate data nodes shared by a plurality of data trees. Additionally, the methods and apparatus facilitate improved database lookup times by implementing an adaptive presence detection system based on the Bloom Filter, performance characteristics of the computing device evaluated at run time and status of the database.

Abstract: A computer-implemented method for variable-length chunking may include 1) identifying a first data stream subject to deduplication, 2) identifying a predetermined chunk of the first data stream that starts at a first location and ends at a second location within the first data stream, 3) identifying a second data stream with a matching chunk for the predetermined chunk that starts at a third location and ends at a fourth location within the second data stream, 4) identifying a subsequent chunk within the second data stream that starts at the fourth location and ends at a fifth location within the second data stream, 5) calculating a candidate boundary offset within the first data stream based on exceeding the second location by a difference between the fifth location and the fourth location, and 6) performing a boundary test at the candidate boundary offset. Various other methods, systems, and computer-readable media are disclosed.

Abstract: A search method is provided. The method comprises, building a first plurality of collectors, associating a first plurality of index entries with the first plurality of collectors, wherein each index entry comprises a search target and is associated with at least one of the first plurality of collectors based on a similarity between the search target of the index entry and the at least one collector, selecting a second plurality of collectors from among the first collectors based on a similarity between a search term and each of the second plurality of collectors, selecting a second plurality of index entries from among the index entries associated with the second plurality of collectors based on a similarity between the search term and the search target of each of the index entries associated with the second plurality of collectors, and presenting information related to the second plurality of index entries.