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:
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:
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:
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:
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:
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:
A system for automatically maintaining database statistics 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 the database using the automatically generated statistics. The query optimizer maintains counters of changes made to the data and automatically updates statistics derived from the data when the counters exceed a threshold. A statistic schema version is maintained for each statistic and incremented when the underlying data is updated. If the statistic schema version changes from that value with which the execution plan was generated, the execution plan is discarded and a new execution plan developed.