Abstract: Architecture that eliminates the need for on-disk full backups of data retaining only changes that have occurred, in a separate table. Thus, the architecture provides for incremental recovery of incremental changes in a relational database (e.g., SQL). The architecture provides improved recovery time and recovery point objectives. By using the incremental capture of changed data (e.g., in an XML format), the capability is provided to capture schema changes, query the incremental change data and efficiently restore user data to an earlier point-in-time state. Changes (e.g., insert, update and delete operations) are tracked (e.g., continuously) by a set of triggers and the incrementally captured changed rows are inserted in a data capture table (a differential change “delta” table) in a human-readable format (e.g., XML). Rollback is also provided.

Abstract: The subject innovation provides a system and/or a method that facilitates developing schemas for a file storage system. A type definition component can provide a schema grammar, wherein a generator component can employ the schema grammar to build the schema for the file storage system. The schema grammar can describe information types stored in the file storage system that are represented as instances of complex types that are part of a type system that supports inheritance. The schema grammar can support a declaration of an association between types, versioning specifications, and/or content indexing specifications.

Abstract: Architecture that eliminates the need for on-disk full backups of data retaining only changes that have occurred, in a separate table. Thus, the architecture provides for incremental recovery of incremental changes in a relational database (e.g., SQL). The architecture provides improved recovery time and recovery point objectives. By using the incremental capture of changed data (e.g., in an XML format), the capability is provided to capture schema changes, query the incremental change data and efficiently restore user data to an earlier point-in-time state. Changes (e.g., insert, update and delete operations) are tracked (e.g., continuously) by a set of triggers and the incrementally captured changed rows are inserted in a data capture table (a differential change “delta” table) in a human-readable format (e.g., XML). Rollback is also provided.

Abstract: Systems and methods that supply a sort order for strings with defined digit and non-digit tokens, via employing a normalization procedure that assigns numeric values to the digit based tokens, and that further leverages on existing database collations. As such, plugging a particular collation into the sort engine determines a weight for the various characters relative to each other, and in conjunction with the normalization procedure, provides an intuitive sort order for the strings.

Abstract: Aspects of the subject matter described herein relate to creating, maintaining, and using relationships between items. In aspects, items such as files, folders, and other objects may be stored in a data store. A user may desire to form a relationship between two items that provides additional semantic information regarding the relationship. To do so, an instance of an item reference is created and populated with data that associates the item reference with a source item and optionally a target item. The item reference is part of a type hierarchy and inherits properties from ancestor types. These types are included in a payload of the item reference and may be exposed to programs that seek to obtain information about the relationship indicated by the item reference. An item reference may be added without changing other data about the referenced items.

Abstract: Systems and methodologies for integration of an anti virus AV Plug In(s) as part of an Item Store. The semantics for operation of the AV Plug In(s) are provided by the relational Item Store, via employing a metadata component and a scanning component associated with the Item Store. The metadata component can supply a signature value being associated with the Item Store that can represent the time of scanning of data, and outcome for every scanned item. The scanning component can provide for a queuing of items in the data store in a synchronous and/or asynchronous mode for both scanning and cleaning by the AV Plug In supplied by vendors.

Abstract: A system for automatic statistics creation comprises a query optimizer which automatically generates statistics derived from data in a database and selects an executable procedure from a plurality of procedures that operate on data in a database using the automatically generated statistics. A counter is maintained of updates made to each statistic that has been automatically generated. If the counter breaches a threshold, the automatically generated statistic is removed from the database.

Abstract: A framework for data change notification includes a notification queue storing event notifications. Client applications can request event information regarding various data change events. For example, a client application can subscribe, via one or more APIs, to receive event information. The framework allows for session specific event notification mechanisms as well as durable event notification mechanisms that can be preserved across client sessions as well as server restarts. Innovative aspects of this invention include guaranteed delivery of event notifications, APIs to allow applications get summary of past events on the subscribed objects, automatic garbage collection/cleanup of notifications when a client session terminates.

Abstract: A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.

Abstract: The subject invention provides a system and/or a method that facilitates mapping a data base model to a database object. A type storage system can utilize a storage mapping of a file storage data model. The mapping can describe the database object created based at least in part upon a schema and how instances of the type described in the schema are stored and/or accessed. Furthermore, a query can be provided to find at least one of an item, a document, and/or a contact that satisfy at least one criterion. The type storage system can receive data, wherein the data is at least one of a schema, a data model, a type, a query, and query criteria via an interface to provide the storing and querying. Additionally, the type storage system can generate a view that exposes at least one instance of the type.

Abstract: Aspects of the subject matter described herein relate to creating, maintaining, and using relationships between items. In aspects, items such as files, folders, and other objects may be stored in a data store. A user may desire to form a relationship between two items that provides additional semantic information regarding the relationship. To do so, an instance of an item reference is created and populated with data that associates the item reference with a source item and optionally a target item. The item reference is part of a type hierarchy and inherits properties from ancestor types. These types are included in a payload of the item reference and may be exposed to programs that seek to obtain information about the relationship indicated by the item reference. An item reference may be added without changing other data about the referenced items.

Abstract: The subject invention provides a system and/or a method that facilitates providing a compact representation of a file path associated to a file storage system. A path component can provide seamless integration and/or transition between the file path associated to the file storage system and an item and/or item ID within the data storage system. The path component can utilize a tabular format, wherein such tabular format allows the cross-reference between the file path and item. The compact representation can facilitate at least one of storing, renaming, and searching.

Abstract: The present invention is directed a logical consistency checker (LCC) working alone or in conjunction with a physical consistency checker (PCC) and/or a data reliability system (DRS) for a database files system of a hardware/software interface system. Logical data correction pertains to logical data corruptions for entities (e.g., items, extensions, and/or relationships in an item-based operating system, where an item-based operating system is one example of an item-based hardware/software interface system). In this regard, a LCC analyses and corrects logical damage to entities representatively stored in the data store in order to ensure that all such entities in said data store are both consistent and conform to the data model rules.

Abstract: A base table is scanned with a delete marker and an insert marker. The delete marker identifies a last change committed to the base table as part of a transaction prior to execution of a statement, and the insert marker identifies a last change committed to base table as part of the transaction during execution of the statement. The results of the delete marker scan are filtered with deletions stored in a delta table, and a delete table is populated with the filtered rows. The results of the insert scan are filtered with insertions stored in the delta table, and an insert table is populated with the filtered rows.

Abstract: A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.

Abstract: A system for automatic statistics creation comprises a query optimizer which automatically generates statistics derived from data in a database and selects an executable procedure from a plurality of procedures that operate on data in a database using the automatically generated statistics. A counter is maintained of updates made to each statistic that has been automatically generated. If the counter breaches a threshold, the automatically generated statistic is removed from the database.

Abstract: A system and method allowing for optimization of query execution in database environments is provided. In an illustrative implementation, a database having distributed partitioned views is provided such that queries may initiate at any of the participating data stores. In operation, an offered query is analyzed to determine if it has predicate expression and/or sub-queries. Using this information the expressions and/or sub-queries are analyzed and processed to determine if appropriate start-up filters are available for the offered query. The start-up filters are applied to the query such that during compile and/or run time, redundant partitions in the distributed partitioned database environment are eliminated during query execution.

Abstract: A system and method allowing for optimization of query execution in database environments is provided. In an illustrative implementation, a database having distributed partitioned views is provided such that queries may initiate at any of the participating data stores. In operation, an offered query is analyzed to determine if it has predicate expression and/or sub-queries. Using this information the expressions and/or sub-queries are analyzed and processed to determine if appropriate start-up filters are available for the offered query. The start-up filters are applied to the query such that during compile and/or run time, redundant partitions in the distributed partitioned database environment are eliminated during query execution.

Abstract: A system for automatic statistics creation comprises a query optimizer which automatically generates statistics derived from data in a database and selects an executable procedure from a plurality of procedures that operate on data in a database using the automatically generated statistics. A counter is maintained of updates made to each statistic that has been automatically generated. If the counter breaches a threshold, the automatically generated statistic is removed from the database.

Abstract: A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.