Abstract: A decoder is disclosed that can reduce power consumption at different stages of a decoding process. At a first stage where the decoder calculates residual values, the decoder can reduce power consumption by calculating residual values using less than a full set of division circuits. A reduced number of division circuits may be sufficient to successfully calculate residuals associated with the codeword to complete the decoding process. Division circuits that are not used may be disabled to reduce power consumption. At another stage of the decoding process where the decoder generates coefficients that are used to identify locations of errors in the codeword, the decoding process can limit power consumption by reducing the number of iterations of a polynomial generator by incorporating termination decision circuitry.

Abstract: A controller (e.g., a memory controller) includes initial error analysis logic (e.g., a section of a Reed Solomon or BCH codeword decoder) that determines an error count for a data element. The data element may be data stored in the memory of a memory device (e.g., a flash memory device) that incorporates the controller. Comparison logic in the controller determines when the error count exceeds a power control threshold. When the error count exceeds the power control threshold, control logic in the controller reduces the operational speed of subsequent error analysis logic (e.g., a different section of the Reed Solomon or BCH codeword decoder) for the data element. For example, the subsequent error analysis logic may be error locator logic, such as Chien search logic, that determines where the errors exist in the data element.

Abstract: Systems and method for creating multidimensional data cubes containing data domains for analyzing large amounts of data are provided. Data domains may be included in the major object of a multidimensional data cube. Further embodiments of the present invention provide methods for querying multidimensional data cubes having data domains. Embodiments of the present invention provide for defining data domains by any object in the major object model and for defining parent and child data domains.

Abstract: A decoder is disclosed that can reduce power consumption at different stages of a decoding process. At a first stage where the decoder calculates residual values, the decoder can reduce power consumption by calculating residual values using less than a full set of division circuits. A reduced number of division circuits may be sufficient to successfully calculate residuals associated with the codeword to complete the decoding process. Division circuits that are not used may be disabled to reduce power consumption. At another stage of the decoding process where the decoder generates coefficients that are used to identify locations of errors in the codeword, the decoding process can limit power consumption by reducing the number of iterations of a polynomial generator by incorporating termination decision circuitry.

Abstract: The subject invention pertains to the integration of an object model and a multidimensional database query language such as MDX. In particular, multidimensional declarative query language entities can be exposed through objects in an object model. The object model enables generation and employment of procedural language functions, routines, or procedures that interact with multidimensional database data. This effectively provides an extension for multidimensional query languages. For example, procedures can be stored and invoked from a declarative language query. Furthermore, the object model disclosed herein can expose a context object to enable conditional procedures based on the context of execution.

Abstract: Provided are systems and methods that facilitate direct write back in a multi-dimensional database. The system includes a delta cache component that receives a user request to change an original cell value and determines a delta value based at least in part upon the changed cell value. Also included is a write back partition component that selectively updates a data cell based at least in part upon the delta value without updating corresponding data cell values. The system and methods allow attributes to be added to any dimension of a cube without affecting the write back data. Adding, modifying or removing a hierarchy has no affect on write back data nor does deleting a dimension that is not referenced by a write back.

Abstract: A system, method, and related techniques are disclosed for processing data across a distributed network to a plurality of machines. The method may include receiving a first user-supplied transform and generating a first package based on the first user-supplied transform. The method may further include receiving a designated key and generating a second package based on the key. Furthermore, the method may include receiving a second user-supplied transform and generating a third package based on the second user-supplied transform. Moreover, the method may include distributing the first, second, and third packages to a plurality of machines using a cluster API.

Abstract: The subject invention pertains to systems and methods for interacting with fact dimensions. In particular, systems and methods are disclosed that optimize performance and scalability with respect to processing queries that involve fact dimensions. Furthermore, queries involving fact dimensions can be evaluated in distinct manners. For instance, queries can be processed such that regular dimensions restrict the scope of the data and only fact dimension members that are relevant to that scope are exposed.

Abstract: A simple interface may be provided that enables the user to define parameters for aggregation of a semi-additive measure. The interface may enable the user to designate a measure as a semi-additive measure and to pair the measure with an additive aggregation function. The interface may also enable the user to select non-additive dimensions and to pair each non-additive dimension with a corresponding aggregation function. One such aggregation function is a by account aggregation function, which enables each account in an account dimension to be aggregated across a corresponding non-additive dimension according to an associated account type.

Abstract: The subject invention relates to systems and methods that extend the network data access capabilities of mark-up language protocols. In one aspect, a network data transfer system is provided. The system includes a protocol component that employs a computerized mark-up language to facilitate data interactions between network components, whereby the data interactions were previously limited or based on a statement command associated with the markup language. An extension component operates with the protocol component to support the data transactions, where the extension component supplies at least one other command from the statement command to facilitate the data interactions.

Abstract: A system that facilitates analyzing content of a multi-dimensional structure comprises a calculation component that receives statements in a declarative language relating to one or more of an assignment and calculation and executes such statements against a multi-dimensional structure. A pass generation component creates a pass in order to maintain content of the multi-dimensional structure as it existed prior to execution of the statement, the pass is accessible upon reference to such pass.

Abstract: A system that facilitates one or more of querying and updating a multi-dimensional structure comprises a component that receives a statement in a declarative language relating to a typed object associated with a multi-dimensional structure. A conversion component analyzes context associated with the statement and automatically converts the object to a disparate type as a function of the analysis. For example, an execution engine can comprise the conversion component, and the execution engine can be an Online Analytical Processing (OLAP) engine.

Abstract: Systems and methods for storing and retrieving data items in multidimensional databases are provided. Data partition templates are generated for grouping data partitions that are similar to one another, that is, that contain information specified according to particular common characteristics (for instance, time, product, geography, etc.). The data partition template includes one or more rules concerning how the data stored in partitions associated with the data partition template should be processed. A template object having the rule(s) associated therewith is generated for the data partition template. Once a data partition template is generated, a plurality of partitions are generated in accordance therewith. Each of the plurality of partitions utilizes the template object associated with the data partition template. In this way, the overhead associated with managing the partitions is significantly decreased.

Abstract: The ability to link dimensions and measure groups in one analysis database to a second database is provided. This feature enables the use of the dimension or measure group without physically creating and managing the contents of the cube so defined.

Abstract: A data model for accessing data in a relational database in an OLAP system utilizes a multiple-hierarchy dimension. The dimension includes a set of attributes. Each attribute is bound to a column in the relational database. A logical structure is defined, indicating the relationships between the attributes. Hierarchies are defined. Each hierarchy includes a sequence of attributes. A hierarchy provides a common drill-down path that a database user can utilize to access the database. A hierarchy can include a single attribute or a combination of attributes. Both the relationships between the attributes and the sequence of attributes in a hierarchy are defined independent of any restrictions associated with the database.

Abstract: Systems and methods for generating distributed dataflow graphs and processing data elements in parallel utilizing the distributed dataflow graphs are provided. A sequential dataflow graph is formed from incoming data elements, and a variety of heuristics is applied to the sequential dataflow graph to determine which of the data transformation steps within the graph are capable of being processed multiple times in parallel. Once determined, the sequential dataflow graph is divided into subgraphs, which are then replicated, e.g., based on available resources and.or external constraints. The resulting subgraphs are connected, based on the semantics of each vertex, and a distributed dataflow graph is generated, which can efficiently process data elements, for instance, for data warehousing and the like.

Abstract: Systems and method for creating multidimensional data cubes containing data domains for analyzing large amounts of data are provided. Data domains may be included in the major object of a multidimensional data cube. Further embodiments of the present invention provide methods for querying multidimensional data cubes having data domains. Embodiments of the present invention provide for defining data domains by any object in the major object model and for defining parent and child data domains.

Abstract: Computer-readable media, systems, and methods for building a multidimensional data cube having one or more high-cardinality attributes are described. In embodiments, data is extracted from one or more databases. It is determined that one or more instances of the data are fact data and one or more instances of the data are dimension data. Each member of the fact data is one instance of a dimension and each instance of the dimension data includes an attribute for grouping the fact data. Moreover, in embodiments it is determined that one or more instances of the dimension data are high-cardinality attributes. The one or more high-cardinality attributes are processed with fact data and stored in fact tables on a computer storage medium.

Abstract: A fiber optic sensor for sensing the presence of an analyte has a plurality of optical fibers each of which has an analyte sensing segment and the fibers are deployed so that the analyte sensing segments are arranged in sequential offset relationship over a distance such that each segment is available for detecting the analyte over a part of the distance. This has the advantage that detection of an analyte can be spatially resolved to the location of the one or more segments that have responded to the presence of the analyte. It also has the advantage that the high attenuation of sensing segments is reduced due to the smaller distance traversed by each sensing segment. Also multiple sets of such fibers may be deployed in order to detect multiple analytes, each set being constructed for a particular analyte. Also a fiber carrying structure is shown that allows the sensing segments to be available for detection of analytes and to conduct lead portions of the fibers to and from the sensing segments.

Abstract: Custom grouping for dimension members of an On-Line Analytical Processing (OLAP) cube is facilitated by an interface component that receives a grouping from a user. A modification component alters an attribute of a session OLAP data cube or a virtual OLAP multi-dimensional data cube so that the change becomes readily available without the time-consuming delay associated with rebuilding or reprocessing the underlying structure. A data scheme generation component produces a data definition language (DDL) definition of a user defined attribute executed by an execution component to affect the change to a data cube. Custom groupings can provide an intermediate dimension level for drill down and/or drill up or roll-up between a level with few members and a level with numerous members. A separate dimensional attribute or level can be created and a group defined comprising or mapping a set or collection of discrete members.