摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.
摘要:
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.
摘要:
The claimed subject matter provides a system and/or a method that facilitates configuring at least one radio frequency identification (RFID) device. An RFID network can include at least one device associated with a device group, wherein the device group corresponds to a characteristic. An organizational manager can uniformly configure the at least one device based at least in part upon membership of the device group.
摘要:
The claimed subject matter provides a system and/or a method that facilitates ensuring reliable data within a radio frequency identification (RFID) infrastructure. A radio frequency identification (RFID) network can include at least one device that receives data from a tag. A distribute component can initiate a reliable transaction with the received data to ensure at least one subscribing RFID process utilizes such data.
摘要:
The claimed subject matter provides a system and/or a method that facilitates verifying data within a radio frequency identification (RFID) business process. A radio frequency identification (RFID) business process can include at least one component that can receive an event from a logical source. A strong typing module can employ strong typing of the component to define at least one of an event type for the component, an input event type for the component, or an output event type for the component.
摘要:
A computer-implemented method is disclosed for encouraging an accurate chronological organization of radio frequency identification (RFID) tag data gathered from distributed servers. The method includes limiting the processing of RFID tag data based at least in part on the operational status of a plurality of sources of RFID tag data.