Abstract: An apparatus having a computer-implemented database controller module, a computer-implemented database module, and a computer-implemented database query module. Software and/or firmware that is/are included in computer-implemented database controller module is/are configured to enter baseline data into the computer-implemented database module and to enter changes into the computer-implemented database module using an extensible multidimensional effectivity method of recording only an indicated change with its effectivity parameters. The computer-implemented database query module is configured to retrieve answers to queries relating to the baseline data and the changes and to return the answers in response to the queries.

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: A system and method for facilitating data organization, for example in the organization of data in management of intellectual property records, is disclosed herein. Further, the present invention particularly provides a contextualization of information objects so that a full value of research and development (R&D) efforts can be accumulated by an organization. The system as disclosed herein collects information (raw) objects from a plurality of sources. Then, based on inferred context and user input, the system classifies each object in multiple dimensions according to needs of the application; and finally creates a high value, layer rich database embodying a context as well as a result to add value to a research process.

Abstract: The present invention extends to methods, systems, and computer program products for performing memory compaction in a main memory database. The main memory database stores records within pages which are organized in doubly linked lists within partition heaps. The memory compaction process uses quasi-updates to move records from a page to the emptied to an active page in a partition heap. The quasi-updates create a new version of the record in the active page, the new version having the same data contents as the old version of the record. The creation of the new version can be performed using a transaction that employs wait for dependencies to allow the old version of the record to be read while the transaction is creating the new version thereby minimizing the effect of the memory compaction process on other transactions in the main memory database.

Abstract: Embodiments of the invention dynamically vary the number of replicas based on certain conditions to protect users from data loss. The size of the database is one condition that can be used to determine the number of replicas required. A database system may create three replicas. When the database size exceeds a first threshold, a fourth replica may be created. The fourth replica is maintained as long as the database size is above a second threshold that is smaller than the first threshold. However, when the database shrinks below the second threshold, then the fourth replica is deleted. Using two different thresholds in this manner prevents the system from frequently cycling between three and four replicas.

Abstract: Various embodiments include methods, apparatus, and systems for assigning a plurality of version number values to instances of a logical entity of a memory device. Each version number value of the plurality version number values may be separately assigned to one of the instances of the logical entity. The version number values may be recycled after the plurality of version number values are assigned. Other embodiments including additional methods, apparatus, and systems are disclosed.

Abstract: A method and system for detecting plagiarism of software source code is disclosed. In one embodiment, a database exists of program elements that have previously been found to be matching within the source code for two different programs. This embodiment searches the Internet for occurrences of these matching program elements to determine how many times they appear and thus whether they are commonly used or not. The elements and their associated number of hits are placed in a spreadsheet for further observation and manipulation. One of skill in the art will see that this invention also applies to other kinds of text documents.

Abstract: A method is used in managing updating of metadata of file systems. Changes in metadata of a file of a file system are stored in a journal upon receiving an I/O request for the file of the file system. The I/O request results in update of metadata of the file of the file system. The journal includes metadata transactions upon the file system. Changes to metadata of the file are stored in a volatile memory of a data storage system upon receiving subsequent I/O requests resulting in update of metadata of the file of the file system. Metadata of the file of the file system is updated with information derived from metadata changes stored in the journal.

Abstract: A description of types of metadata can provide, in one embodiment, an index to the types of metadata in a time based metadata track that can be associated with a time based media track having audio or video or both. The description can be non-time based and be separate from the metadata track, and the description can be examined to determine whether a particular type of metadata exists in the time based metadata track without having to search through the track to determine whether the particular type of metadata exists.

Abstract: Systems and methods according to embodiments provide elasticity for complex event processing (CEP) systems. Embodiments may comprise at least the following three components: (1) incremental query optimization, (2) operator placement, and (3) cost explanation. Incremental query optimization allows avoiding simultaneous computation of identical results by performing operator-level query reuse and subsumption. Using automatic operator placement, a centralized CEP engine can be transformed into a distributed one by dynamically distributing and adjusting the execution according to unpredictable changes in data and query load. Cost explanation functionality can provide end users with near real-time insight into the monetary cost of the whole system, down to operator level granularity. Combination of these components allows a CEP system to be scaled up and down.

Abstract: A cost monitoring system can monitor a cost of queries executing in a complex event processing system, running on top of a pay-as-you-go cloud infrastructure. Certain embodiments may employ a generic, cloud-platform independent cost model, multi-query optimization, cost calculation, and/or operator placement techniques, in order to monitor and explain query cost down to an operator level. Certain embodiments may monitor costs in near real-time, as they are created. Embodiments may function independent of an underlying complex event processing system and the underlying cloud platform. Embodiments can optimize a work plan of the cloud-based system so as to minimize cost for the end user, matching the cost model of the underlying cloud platform.

Abstract: The invention identifies and caches query plans in a shared-nothing distributed data store that are unlikely to become invalid because they do not reference objects that are likely to be changed or deleted. Plans that are likely to become invalid and are not cached are those plans that reference data that is partitioned across segment/query execution nodes of the data store, plans that are complex, and plans that reference objects that are not “built-in” (primitive) objects. The effect is that most plans which are generated on a query dispatch (master) node are not cached, whereas most plans generated on an execution (segment) node are cached.

Abstract: Disclosed are various embodiments for context-aware durability of variants of files. A first data store is associated with a first level of data durability, and a second data store is associated with a second level of data durability that is lower than the first level of data durability. A data object is stored in the second data store when the data object is a derivative of another data object stored in the first data store. A data object is stored in the first data store when the data object is not a derivative of another data object stored in the first data store.

Abstract: A method for managing storage functions in a data replication environment is disclosed. In one embodiment, such a method includes continually monitoring for changes to a storage configuration at a secondary site. Upon detecting changes to the storage configuration at the secondary site, the method transmits remote metadata describing the changes to the primary site and stores the remote metadata at the primary site. The method then initiates a storage management function at the primary site which is mirrored to the secondary site. In order to perform the storage management function, the method reads the remote metadata at the primary site to determine the storage configuration at the secondary site. The method then performs the storage management function at the primary site in a way that takes into account the storage configuration at the secondary site. A corresponding apparatus, system, and computer-readable medium are also disclosed and claimed herein.

Abstract: A method for managing storage functions in a data replication environment is disclosed. In one embodiment, such a method includes continually monitoring for changes to a storage configuration at a secondary site. Upon detecting changes to the storage configuration at the secondary site, the method transmits remote metadata describing the changes to the primary site and stores the remote metadata at the primary site. The method then initiates a storage management function at the primary site which is mirrored to the secondary site. In order to perform the storage management function, the method reads the remote metadata at the primary site to determine the storage configuration at the secondary site. The method then performs the storage management function at the primary site in a way that takes into account the storage configuration at the secondary site.

Abstract: A method of acquiring data and performing calculations on the data using a provider service. A provider ticket service (PTS) receives tickets from one or more clients. Each ticket includes a calculation identifier and a payload. The calculation identifier identifies a calculation to be performed using information in the payload. The PTS associates a unique ticket identifier with each ticket. A ticket manager submits a selected ticket from the PTS to a provider host service (PHS), which determines which provider is to perform the calculation identified by the selected ticket by inspecting provider identification information in the selected ticket. The PHS launches a provider host thread (PHT) that invokes the provider determined to perform the calculation identified by the calculation identifier of the selected ticket. The provider performs the calculation and returns its result to the PHS, which passes the result back to the PTS, which returns the result to the requesting client.

Abstract: Systems, methods and computer-storage media are provided for identifying low-match search queries and determining comparable item matches to suggest to the user in response to a low-match query. “Low-match queries” are queries for which an insufficient number of exact item matches are available. In embodiments, exact and/or comparable item matches may be determined via semantic analysis. Also provided are systems, methods and computer-storage media for informing the user, by way of a presented indicator, or the like, that a presented item was selected for presentation based upon a similarity metric rather than being determined an exact match for the input query.

Abstract: Techniques for data migration of a storage system are described herein. According to one embodiment, a candidate index is generated to store information identifying a plurality of segments associated with one or more candidate files of a source storage tier to be migrated to a target storage tier of a storage system. Segments of the one or more candidate files are then migrated from the source storage tier to the target storage tier according to a sequential order, and based on the candidate index.

Abstract: Techniques for data migration of a storage system are described herein. According to one embodiment, a list of files stored in a source storage tier is identified as candidate files to be migrated to a target storage tier based on a migration policy. One of a regular data movement method and a bulk data movement method is selected based on a characteristic of the candidate files. The candidate files are then migrated from the source storage tier to the target storage tier using the selected data movement method.

Abstract: A database table is provided. The database table includes several column tuples. A column is selected in the database table. The column tuples of the selected column are partitioned into several bins. Each bin includes a range of tuples and associated metadata. The associated metadata includes at least one of: a minimum tuple value for the tuples in the bin, a maximum tuple value for the tuples in the bin, a minimum tuple identifier for the bin and a maximum tuple identifier for the bin. The bins are sorted based on the tuple values to provide an approximate index for the database.