Abstract: Technologies are presented for data deduplication that operates at relatively high throughput and with relatively less storage space than conventional techniques. Building upon content-dependent chunking (CDC) using Rabin fingerprints, data may be fingerprinted and stored in variable-size chunks. In some examples, data may be chunked on multiple levels, for example, two levels, variable size large chunks in the first level and fixed-size sub-chunks in the second level, in order to prevent sub-chunks common to two or more data chunks from not being deduplicated. For example, at a first level, a CDC algorithm may be employed to fingerprint and chunk data in content-dependent sizes (variable sizes), and at a second level the CDC chunks may be sliced into small fixed-size chunks. The sliced CDC chunks may then be used for deduplication.

Abstract: In an example embodiment, a demand signal management system is configured to coordinate data harmonization among a plurality of entities. The demand signal management system may obtain unharmonized data through third party entities. Global records based on internal master records and taxonomy information may be distributed to the entities. In some embodiments certain entities may have authority to create new global records. In other embodiments, some entities may have authority to approve proposed new global records. In still other embodiments, some entities may not have authority to create new global records. Unharmonzied data sent to the entities for harmonization in accordance with the global records. The entities may accept or reject the harmonization request. If accepted, the entity may return an updated global record, a proposed new global record, and/or a new global record depending on the unharmonized data, the global records and the entities' authority.

Abstract: According to one aspect, the subject matter described herein includes a method for dynamically selecting questions to be presented in a survey. The method includes providing for assignment of priorities to potential survey questions. The method further includes determining a selection probability for each question based on the assigned priorities. The method further includes storing questions in a database embodied in a non-transitory computer readable medium. The method further includes dynamically selecting, from the database and based on the selection probabilities, questions to be included in surveys to be presented to a plurality of individuals such that different individuals are presented with different sets of questions.

Abstract: Methods and systems of performing data mining may include receiving a plurality of web log records and a plurality of call log records; associating one or more web log records with a call log record, wherein the associated user for each of the associated one or more web log records and the call log record are the same; identifying one or more patterns among the web log records for the plurality of call log records, wherein each pattern comprises one or more web accesses, a time stamp at which each of the one or more web accesses is performed and the call topic for the call log record; identifying one or more web log records associated with a new call, and predicting a call topic for the new call based on at least one pattern and the one or more web log records.

Abstract: The present invention is directed to recording and providing media files based on a location. Such systems and methods maybe transacted by a client application or a processor in communication with one or more electronic devices. In accordance with some embodiments of the present invention, methods may include receiving from a first device: a media file; data comprising information identifying a location associated with the media file; storing the media file and data in a database; receiving from a second device information identifying a location of the second device; determining a geographic radius of the second device based upon user selection; determining if one or more media files stored in the database are associated with a location in the geographic radius of the second device; and sending the one or more media files to the second device.

Abstract: A system including a processor and a memory storing instructions that, when executed, cause the system to: receive a stream of content including a plurality of content items; retrieve a plurality of related content items; identify a topic for at least one of the plurality of the related content items; rank the topics by relevance to the user and one of the plurality of items; associate the topic to the content item in the stream of content where the topic is ranked as being relevant to the content item; generate a marker for the topic; generate an interface including the marker associated with the content item in the stream of content; and provide the interface for display.

Abstract: A system for migrating first data objects from a first repository product to a second repository product exports the first data objects from the first repository product into a schema. The schema describes a logical model of the first data objects. The system maps the first data objects to second data objects of the second repository product. The system trims the first data objects. Trimming comprises performing data modification on the first data objects so that the first data objects can be migrated to the second repository product. The system also creates placeholders for the first data objects for later deployment binding.

Abstract: Query optimizer accuracy is tested by measuring the actual execution times on a database of each of a plurality of alternative query plans for each of a plurality of queries, first ranking the plans by the actual execution times, then ranking the plans by estimated execution times, and correlating the two rankings by computing a rank correlation metric. The rank correlation metric is normalized so that different optimizers can be objectively compared.

Abstract: A method for efficient logging in a control system is provided. A temporary history record corresponding to a message transaction placed onto a message queue data structure is generated. A total processing time for the received message transaction is determined. The total processing time is compared with a previously determined peak processing time value. In response to determining that the total processing time exceeds the previously determined peak processing time value, the temporary history record corresponding to the received message transaction is stored in an event log.

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: New data points are added to a streaming window of data points and existing data points are removed from the window over time. Each data point has a value for each of one or more dimensions. Each time a given new data point is added to the window or a given existing data point is removed from the window, one or more outlier detection data structures are updated. Each outlier detection data structure encompasses the data points within the streaming window for a corresponding dimension. The outlier detection data structures are used to detect outlier data points within the window over selected one or more dimensions.

Abstract: Approaches, techniques, and mechanisms are disclosed for maintaining a set of baseline query plans for a database command. Except in rare circumstances, a database server may only execute a command according to a baseline plan, even if the database server predicts that a different plan has a lower cost. The set of baseline plans are plans that, for one reason or another, have been determined to provide acceptable actual performance in at least one execution context. When the database server receives a request to execute a particular command, the database server, if possible, always executes the command according to the lowest predicted cost baseline plan. The database server may evolve the plan baseline to include additional plans by generating and testing new plans in response to new requests to execute the database command, or as part of a query optimization or tuning process.

Abstract: Methods and systems are provided for identifying data transactions satisfying a streaming query and providing data corresponding to those data transactions to subscribed client devices. One exemplary method involves a server initiating a data transaction for a database entry in a database in response to input data received from a client device, determining whether the data transaction satisfies a streaming query, and indicating an association between the database entry and the streaming query when the data transaction satisfies the streaming query.

Abstract: While testing a software application that is associated with a database during a testing technique, a computer system may take over transaction scopes of transactions with the database so that data generated by the software application during the testing and communicated to the database is not persisted in the database (even though this data may be persisted in the database during normal operation). Furthermore, after the testing is completed, the computer system may restore the database to an initial state prior to the testing by rolling back the data which was not persisted.

Abstract: This disclosure relates to a system and method for distributed catalog processing, data caching, and indexing to create an efficient, scalable, secure, high availability, disaster recovery enabled backup and storage system.

Abstract: Some embodiments provide a file system for purging content based on a single traversal of the file system that identifies the directory containing the content without performing a secondary traversal within the directory to target the operation to only the file that are associated with content such that other files contained in the directory are unaffected. The file system supplements traditional directory structures with file-level directories. Each file-level directory is created to contain a root file associated with particular content, different variants of the particular content, and supporting files. Consequently, the file system can complete an operation targeting particular content by performing that operation on the file-level directory containing the particular content, thereby eliminating the need to conduct a file-by-file traversal of the containing directory as a prerequisite to identifying the files associated with the particular content and performing the operation on the files individually.

Abstract: In one of many possible implementations, an exemplary system includes a plurality of data subsystems configured to store local data associated with an external party, the data subsystems configured to be maintained by an internal party. The system further includes a data integration subsystem configured to store global data and a defined mapping of the global data to the local data, the global data including a global data record mapped to a local data record having a first data schema type, recognize a migration event in the local data, the migration event including migration of the first schema type local data record to a second schema type local data record, and associate a smart mapping record with the global data record, the smart mapping record configured to selectively map the global data record to one of the first schema type local data record and the second schema type local data record.

Abstract: Database processing using columns to present to a processing unit decompressed column data without changing the underlying row-based database architecture. For some embodiments, a database accelerator is used to efficiently process the columns of a database and output tuples to a processing unit's memory, such that the columns can be quickly processed (with the advantages of a column-based architecture) to create tuples of requested data, but without having to depart from a row-based architecture at the processing unit level or having decompressed data scattered throughout the processing unit's memory.

Abstract: An information delivery method and system. The method includes receiving by a computer processor a video file, an audio file, associated data files, and associated message files The computer processor stores the video file in a first layer of a multimedia file, the audio file in a second layer of the multimedia file, the data files in first additional layers of the multimedia file, and the message files in second additional layers of the multimedia file. The computer processor stores the multimedia file on a computer readable storage medium.

Abstract: The invention is a system and method for generating a file system model at a selected point in time without requiring sequential generation of file system models for each point in time prior to the selected point in time. Present data modeling require that data be generated using some initial point, then passed through time intervals in order to simulate the data at a later point in time. The invention does not require sequential data generation. Instead, any arbitrary point in time may be selected, and the data may be modeled at that selected timepoint. The invention stores a compact representation of file system data for each timepoint. Whenever a user wants to simulate data at some timepoint, the proper compact representation is selected and expanded to produce a simulation of the data at that timepoint.