Abstract: A system and method of enabling row level security through security policies is disclosed herein. In this system and method, a computing device may be communicatively coupled to a storage device. The computing device may further be activated and maintain data that comprises a plurality of rows. When executed by the computing device, the system and method may process a data definition language statement comprising a security policy definition. Further, the system and method may receive a query language statement comprising a request to access a first column of a row from the plurality of rows. The system and method may process the request and determine if access may be granted to a user based on the security policy definition in the system.

Abstract: A system and method of enabling row level security through security policies is disclosed herein. In this system and method, a computing device may be communicatively coupled to a storage device. The computing device may further be activated and maintain data that comprises a plurality of rows. When executed by the computing device, the system and method may process a data definition language statement comprising a security policy definition. Further, the system and method may receive a query language statement comprising a request to access a first column of a row from the plurality of rows. The system and method may process the request and determine if access may be granted to a user based on the security policy definition in the system.

Abstract: A system and method of executing a spread order trade is provided. The system and method of the present invention provide a profit and loss neutral model configured to dynamically and iteratively rebalance the trades associated with a spread order based on changing market conditions. According to an embodiment of the present invention, a vector-based target volume ratio is maintained by rebalancing a plurality of trades associated with instruments (or legs) of the spread order, in view of changes in the underlying markets. Maintaining a target volume ratio allow the spread order to be traded according to a profit and loss neutral model.

Abstract: A system and method for processing database queries. An optimizer produces query plans based on queries. Query plans are stored in a persistent storage. In response to receiving a query, the system selectively retrieves a stored query plan corresponding to the query for execution. Optimization of the query may be selectively performed. A stored query plan or a new query plan may be executed. Based on metrics collected during execution, the system may automatically revert to a stored plan other than the one being executed. Based on metrics of a reverted to plan, the system may roll back to the first plan. The persistent storage enables the use of query plans after a system restart, transfer to another device, or other changes.

Abstract: The claimed subject matter provides a system and/or a method that facilitates paging and/or cursoring over the results of a query associated with a file storage system. An interface component can receive the query targeted to the file storage system including at least one key that relates to data. A query component can enable cursoring over a query operation on a query result utilizing the key in order to provide an extended set of query operators.

Abstract: The present invention describes an efficient and fast framework for implementing table-valued functions (TVF's) in a relational database server. The framework provides desirable extensibility properties and has the ability to minimize performance degradations by integrating tightly with the optimization infrastructure in a query processor. The present invention also enables a managed execution environment (MEE) such as the Common-Language-Runtime (CLR), to efficiently and dynamically extend the logic of the database engine with user-supplied code.

Abstract: A system and method for facilitating secure access to database(s) is provided. The system relates to authorizing discriminatory access to relational database data. More particularly, the invention provides for an innovative technique of defining secured access to rows in relational database tables in a way that cannot be spoofed while preserving various optimization techniques. The invention affords a persistent scheme via providing for a security architecture whereby discriminatory access policies on persistent entities can be defined and enforced while preserving set based associative query capabilities. A particular aspect of the invention relates to the specification of such policies and the technique by which those policies are enforced. With respect to one particular implementation of the invention, creation, modification and deletion of access control lists called security descriptors is provided.

Abstract: Implementations of various technologies for compiling a query. In one implementation, the memory consumption of the query may be monitored. If the amount of memory consumed by the query exceeds one or more gateway thresholds, then the query may be processed to acquire one or more gateways. The query may then be compiled as having acquired the one or more gateways.

Abstract: A system and method for facilitating secure access to database(s) is provided. The system relates to authorizing discriminatory access to relational database data. More particularly, the invention provides for an innovative technique of defining secured access to rows in relational database tables in a way that cannot be spoofed while preserving various optimization techniques. The invention affords a persistent scheme via providing for a security architecture whereby discriminatory access policies on persistent entities can be defined and enforced while preserving set based associative query capabilities. A particular aspect of the invention relates to the specification of such policies and the technique by which those policies are enforced. With respect to one particular implementation of the invention, creation, modification and deletion of access control lists called security descriptors is provided.

Abstract: A system and method for facilitating secure access to database(s) is provided. The system relates to authorizing discriminatory access to relational database data. More particularly, the invention provides for an innovative technique of defining secured access to rows in relational database tables in a way that cannot be spoofed while preserving various optimization techniques. The invention affords a persistent scheme via providing for a security architecture whereby discriminatory access policies on persistent entities can be defined and enforced while preserving set based associative query capabilities. A particular aspect of the invention relates to the specification of such policies and the technique by which those policies are enforced. With respect to one particular implementation of the invention, creation, modification and deletion of access control lists called security descriptors is provided.

Abstract: A method for performing asynchronous statistics updates in a database management system includes receiving a first query against the database, determining if present statistics related to the first query are stale and entering on a queue a request to acquire updated statistics if the present statistics are stale. The queue jobs are executed asynchronously with respect to the query request. As a result, a first query plan may be developed using the present statistics related to the first query. Thus, no delay in processing the query due to statistics updates is incurred. The first query plan may be executed and results given to the requester. At some later time, the request to acquire updated statistics related to the first query is processed asynchronously from the query request. If subsequent queries are received, the queue can delete duplicate requests to update the same statistics. Those subsequent queries can benefit from the updated statistics.

Abstract: The claimed subject matter provides a system and/or a method that facilitates paging and/or cursoring over the results of a query associated with a file storage system. An interface component can receive the query targeted to the file storage system including at least one key that relates to data. A query component can enable cursoring over a query operation on a query result utilizing the key in order to provide an extended set of query operators.

Abstract: Systems and methods for extension of a query language for defining a simple formulation of joins by capturing the semantics of an existing linkage between a plurality of tables, via employing a reference join. Such reference join enables a compiler to exploit existing relationships in a data base, and employ existing knowledge about referential constraints for an unambiguous transformation of the reference join expression into the equivalent INNER JOIN on the columns involved. Accordingly, a simpler query syntax and semantics can be provided to express multi-table join navigation over primary key/foreign key relations, for example.

Abstract: The subject invention relates to systems and methods that automatically create, update, and use statistics over complex objects within a database query processor. A system is provided that facilitates employment of statistics in connection with database optimization. The system includes a component that receives information relating to database performance and an optimization component that automatically identifies, from the information, a minimal set of statistics to employ in a query. A loader dynamically loads and employs the set of statistics during a query optimization process. The optimization component can employ the statistics over computed columns, whereby the columns can be computed from persisted and non-persisted data.

Abstract: Database management systems allow modification of existing table rows through update statements or other data modification commands. For example, a user may specify, via a command statement, the table to update, the columns to modify and their respective new value(s), and qualify the rows to be updated. Optimized constraint and index maintenance for data modification statements and commands is provided where the new value being assigned to the columns is actually the same as the current value, e.g., update commands that actually leave the columns unchanged.

Abstract: Efficient hierarchical searching is based on object type. By pre-computing additional information and storing it in a fast-lookup structure, it is possible to quickly identify objects that satisfy an object retrieval request. Furthermore, it is also possible to use this technique to avoid object hydration for operations in the store. Moreover, it is possible to leverage database statistical structures such as histograms to estimate the number of qualifying objects without having to examine each object.

Abstract: Efficient hierarchical searching is based on object type. By pre-computing additional information and storing it in a fast-lookup structure, it is possible to quickly identify objects that satisfy an object retrieval request. Furthermore, it is also possible to use this technique to avoid object hydration for operations in the store. Moreover, it is possible to leverage database statistical structures such as histograms to estimate the number of qualifying objects without having to examine each object.

Abstract: A system and method for facilitating secure access to database(s) is provided. The system relates to authorizing discriminatory access to relational database data. More particularly, the invention provides for an innovative technique of defining secured access to rows in relational database tables in a way that cannot be spoofed while preserving various optimization techniques. The invention affords a persistent scheme via providing for a security architecture whereby discriminatory access policies on persistent entities can be defined and enforced while preserving set based associative query capabilities. A particular aspect of the invention relates to the specification of such policies and the technique by which those policies are enforced. With respect to one particular implementation of the invention, creation, modification and deletion of access control lists called security descriptors is provided.

Abstract: The present invention describes an efficient and fast framework for implementing table-valued functions (TVF's) in a relational database server. The framework provides desirable extensibility properties and has the ability to minimize performance degradations by integrating tightly with the optimization infrastructure in a query processor. The present invention also enables a managed execution environment (MEE) such as the Common-Language-Runtime (CLR), to efficiently and dynamically extend the logic of the database engine with user-supplied code.

Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.