Abstract: Example resource management systems and methods are described. In one implementation, a processing device is to: provide a plurality of virtual processors, each virtual processor comprising a cache memory to cache a portion of database data accessed from a storage platform; receive a query referencing the database data stored in the storage platform; determine at least one task to process the received query; and allocate the at least one task to a subset of the plurality of virtual processors to process the at least one task. The allocation may be based at least in part on the respective portions of the database data that are cached within the respective cache memories of the subset of the plurality of virtual processors.

Abstract: Systems and computer program products for relating facts stored in healthcare databases are provided. At least two fact tables stored in a healthcare database including data meeting a criteria of interest are located. An identification key is assigned to the at least two fact tables including the located data meeting the criteria of interest. The identification key provides access to a dimension table including a list of subjects associated with the at least two fact tables including the located data meeting the criteria of interest so as to allow future identification of the subjects meeting the criteria of interest.

Abstract: A method, computer program, and system-model converter for converting system model. The method includes the steps of: receiving input of a conversion processing description about a structure of a multi-dimensional data model and extraction queries, where the multi-dimensional data model and the extraction queries extract at least one element from a plurality of model elements; and generating a hierarchical multi-dimensional data model from a graph model stored in a graph model storage unit on the basis of the inputted conversion processing description, where the hierarchical multi-dimensional data model includes dimensions having a hierarchical relationship.

Abstract: An OLAP query processing method oriented to a database and Hadoop hybrid platform is described. When OLAP query processing is performed, the processing is executed first on a main working copy, and a query processing result is recorded in an aggregate result table of a local database; when a working node is faulty, node information of a fault-tolerant copy corresponding to the main working copy is searched for through namenode, and a MapReduce task is invoked to complete the OLAP query processing task on the fault-tolerant copy. The database technology and the Hadoop technology are combined, and the storage performance of the database and the high expandability and high availability of the Hadoop are combined; the database query processing and the MapReduce query processing are integrated in a loosely-coupled mode, thereby ensuring the high query processing performance, and ensuring the high fault-tolerance performance.

Abstract: Techniques are described for optimizing a multi-fact star schema query to retrieve data from two or more fact tables of a database. The optimization techniques may include internally transforming a received multi-fact star schema query into a group of single-fact sub-queries, thereby reducing or eliminating certain constraints during query processing. The group of sub-queries may be enumerated to determine a query execution plan. The multi-fact star schema query may be executed according to the query execution plan to retrieve the data from the two or more fact tables of the database.

Abstract: According to one aspect of systems and methods for dynamic recreation of multidimensional analytical data, lost sets of calculation scenarios that provide multidimensional analytical data results after aggregations and transformations of the multidimensional analytical data are recreated in the volatile storage of an in-memory computing engine. A multidimensional analytical data view (MDAV) compiler is triggered to read the MDAV metadata stored in an intermediate buffer in the MDAV compiler. The read MDAV metadata is compiled into a calculation scenario including calculation view metadata. The calculation view metadata is stored in the intermediate buffer. The recreated set of calculation scenarios is deployed on the in-memory computing engine.

Abstract: A set of sensors can capture raw data that geospatially corresponds to a real world volumetric space. The raw data can include point cloud data encoded in a light detecting and ranging (LiDAR) information format, imagery and video data, and elevation data encoded in a digital elevation model (DEM) or digital surface model (DSM) format. The real-world volumetric space can be segmented into a set of volumetric units, wherein datum of the raw data is indexed against the volumetric units. Each of the volumetric units of the real-world volumetric space can be mapped to a voxel in a storage volumetric space of a voxel database. The raw data can then be stored and fused in the voxel database such that each voxel in the voxel database represents a combination of volumetrically stored data for all source products that includes providing point cloud data, imagery data, and elevation data.

Abstract: A voxel database can store and manage a set of voxel records in a voxel table. Each of the records can have a unique voxel identifier. Each voxel record can include a set of different sensory attributes. The sensory attributes can include visual attributes, spectral signature attributes, olfaction attributes, audition attributes, gustation attributes, somatsensory attributes, and material composition attributes. Uniquely defined voxels of voxel database can be a volume unit on a grid (regular or non-regular) in three dimensional space, which is a voxel space. A correspondence can exist between voxels in the voxel space and volume units of a real world volumetric space from which geospatial data was directly gathered and encoded within the voxel database. Voxel space can be mapped to simulation space. Thus, simulators can consume data of the voxel space to generate three dimensional immersive environments having multisensory output.

Abstract: A multidimensional object, such as a language-integrated query (LINQ) object, can be generated based upon a grouping set operator and zero or more key selectors. The object can be utilized to query over a non-relational data source. The object can include a sequence of functions corresponding to each grouping related to the grouping set operator in order to provide multidimensional grouping representation. Furthermore, the object includes nested structures for optimized execution of the grouping set operator.

Abstract: A method includes providing a source report for display that includes a first plurality of data values each associated with a first context, the first context comprising an intersection of dimensions of a multidimensional database. The method includes receiving a selection of a first data value of the first plurality, and providing a drill-through report for display generated based at least in part on the selected data value. The drill-through report includes a second plurality of data values each associated with a second context comprising an intersection of at least one dimension of the first context and at least one other dimension not in the first context. The method includes receiving an indication of a relationship between the selected data value and the drill-through report, updating the source report to include a graphical representation of the relationship, and providing the updated source report having the graphical representation for display.

Abstract: An enterprise business intelligence system includes a data access service. In one example, a method comprises receiving, with a data access service, a query and a report specification from an application, wherein the data access service is positioned between the application and a data source; creating a run tree that comprises a sequence of executable decoration nodes; executing the query on the data source, thereby providing a query result set comprising query results drawn from the data source that are responsive to the query; and executing the sequence of decoration nodes on the query result set. The decoration nodes modify the query result set, thereby producing a decorated result set based on the query result set and the decoration nodes. Producing the decorated result set comprises associating members or values in the query results with corresponding positions or calculated members in the report specification.

Abstract: Embodiment of the disclosure may includes systems, methods, and devices for providing multidimensional search results on a plurality of search planes. Such systems, methods, and devices may: (i) receive one or more search terms from one or more user interfaces of the system; (ii) perform a search of one or more informational repositories to obtain a list of search results wherein the informational repositories may include the Internet and one or more databases; (iii) process the list of search results to classify each search result in one of a plurality of categories; (iv) cause a presentation of the search results in a plurality of search planes on the display of the system such that each search plane corresponds to one of the plurality of categories. In addition, the software applications may include a sorting software application that groups the list of search results into one of a plurality of categories.

Abstract: A method for selecting a perceptually optimal HRTF in a database according to morphological parameters. A first database includes the HRTFs of subjects M, a second database includes the morphological parameters of the subjects, and a third database corresponds to a perceptual classification of the HRTFs. The N most relevant morphological parameters are sorted by correlating the second and third databases. A multidimensional space is created, which optimizes the spatial separation between the HRTFs according to the classification thereof in the third database to obtain an optimized space. An optimized projection model MPO is calculated for correlating K optimal morphological parameters with the corresponding position of the HRTF filters in the optimized space. For any user whose HRTF is not included in the database, at least one HRTF can be selected from the database BD1 according to the parameters K of the user and the optimized projection model MPO.

Abstract: An apparatus and method for calculating the selectivity of a range query for multidimensional data using a multidimensional histogram are provided. A data space may be partitioned into one or more sub-spaces based on a sum of skew values of the one or more sub-spaces, a space-partitioning tree may be generated for the data space, and a multidimensional histogram may be generated for the data space based on the space-partitioning tree. A range query for multidimensional data may be processed based on the multidimensional histogram.

Abstract: A process, system and computer software are provided to facilitate at least one recommendation to one or more users and/or one or more applications using multidimensional data. In particular, a multidimensional space is defined, wherein each dimension is capable of providing variable information. At least one dimension corresponds to user profiles. The multidimensional space is filled with multidimensional data corresponding to dimensions of the multidimensional space. Then, information from the multidimensional space is retrieved. Further, the recommendation is generated based on the retrieved information. In addition, it is possible to generate a recommendation-specific query. This can be performed by generating the recommendation-specific query to access a multidimensional cube and retrieve data stored therein. Then, the recommendation can be issued based on the data retrieved from the multidimensional cube.

Abstract: Methods, apparati, and computer-readable media for performing computerized data searches. In a method embodiment of the present invention, a server (2) receives a search request from a user (14). The server (2) accesses at least one computerized database (22), and searches the database(s) (22) along at least two dimensions. The server (2) then conveys the search results to the user (14) in a manner that preserves the multi-dimensional information.

Abstract: The various embodiments of the invention provide software and metadata structures for a data processing system and method, for applications such as marketing campaign management, speech recognition and signal processing. An exemplary system embodiment includes a first data repository adapted to store a plurality of entity and attribute data; a second data repository adapted to store a plurality of entity linkage data; a metadata data repository adapted to store a plurality of metadata modules, with a first metadata module having a plurality of selectable parameters, received through a control interface, and having a plurality of metadata linkages to a first subset of metadata modules; and a multidimensional data structure.

Abstract: XBRL instance data configured according to a given XBRL hypercube specification (or an extension thereof) may be automatically mapped to a multidimensional database configured according to the given XBRL hypercube specification. Such a multidimensional database may be configured for analytical processing of multi-dimensional analytical queries related to the XBRL instance data and/or for analytical processing by a business intelligence tool. Multidimensional data from a multidimensional database may also be automatically mapped to an automatically-generated XBRL hypercube specification structured according to the multidimensional database.

Abstract: A method and a system for analyzing a data value of interest in a multidimensional database. The data value of interest is first identified in a structured report. The data source for the structured report is retrieved. A context for the data value of interest in the data source is collected, for example, by extracting a slicer from the structured report, by extracting members of master-detail pages, or by extracting a default measure from the structured report. An analysis specification based on the collected context is then built, and the data value of interest is analyzed using the analysis specification. The result from analyzing the data value of interest may be presented in an analysis view.

Abstract: A method of constructing a general mixture model of a dataset includes partitioning the dataset into at least two subsets according to predefined criteria, generating a subset mixture model for each of the at least two subsets, and then combining the mixture models from each subset to generate a general mixture model.

Abstract: Data acquisition is facilitated by way of an intermediate representation of a query expression. The intermediate representation can be generated and subsequently transmitted to, and employed by, a plurality of execution environments with respect to query execution. More particularly, the intermediate representation can be transformed into a locally executable query expression. Furthermore, numerous factors can shape the created and transmitted intermediate representation.

Abstract: An image search apparatus has: a dimension reducing unit for reducing dimensions of multidimensional feature data to be produced as approximate data; an approximate-data storing unit for storing the produced approximate data with corresponding to the multidimensional feature data before the dimension reduction; a search request receiving unit for receiving an identifier which identifies multidimensional feature data of a person to be searched, at least as a search key; an approximate-space searching unit for calculating distances between approximate data corresponding to the received search key, and plural approximate data stored in the approximate-data storing unit, and for arranging the distances in order of similarity; and a real-space final ranking unit for again performing a distance calculation with using the multidimensional feature data before the dimension reduction, on a group of results in which the similarity is high, and for determining final rankings.

Abstract: A device receives, from multiple user devices, event information associated with the multiple user devices, where the event information includes one or more actions, user information, content information, and one or more attributes. The device stores the event information in a database, and analyzes one or more portions of the event information stored in the database. The device also recommends, based on the analyzed event information, one or more adjustments to a network that delivers content to the multiple user devices.

Abstract: Storage media, systems and methods are disclosed herein for analyzing data streams in real time. More particularly, storage media, systems and methods are presented for processing data streams to calculate results for prospective queries. The results may be advantageously computed prior to the formulation of the specific query, for example, based on a pre-established framework of potential query parameters. More particularly, a universe of potential queries may be extrapolated from the pre-established framework of potential query parameters. Results for each of the potential queries may them be tracked in real time. For example, results for each of the potential queries may be continuously updated based on real-time processing of events in a data stream.

Abstract: The subject disclosure is directed towards making cube data highly available and efficient to access by separating the read cube server from the processing cube server, on different physical machines. The read cube server may be mirrored, and the write cube server may be mirrored. When the primary read cube server is not operational (e.g., has failed) or is having its read cube synchronized, the read queries are handled by the mirror read cube server. When a processing cube server (or its write cube) is not operational, its mirror processing cube server takes over and performs cube processing operations via its mirror write cube.

Abstract: The invention relates to a method for the automatic combination of multi-dimensional data depending on manipulations at the level of their dimensions in a computer environment that comprises computer equipment capable of accessing multi-dimensional data sources.

Abstract: A method includes preparing a character string management table for managing character strings, a character string field, and a numerical field corresponding to the character string field in hierarchy structure data of a MOLAP, generating, in response to character string data being input into the character string field, a unique character string ID for a character string of the character string data and storing the character string ID into the numerical field, storing the character string ID and the character string data into the character string management table, calculating an aggregated value of the numerical fields by the numerical aggregation calculation of the MOLAP at a higher hierarchy layer of the hierarchy structure data, resolving the aggregated value into separate character string IDs at the higher hierarchy layer, and referring to the character string management table to obtain and display character string data corresponding to the resolved character string IDs.

Abstract: Improved method of and apparatus for aggregating data elements in multidimensional databases (MDDB). In the preferred embodiment, the apparatus is realized in the form of a high-performance stand-alone (i.e. external) aggregation server which can be plugged-into conventional MOLAP systems to achieve significant improvements in system performance. In accordance with the principles of the present invention, the stand-alone aggregation server contains a scalable MDDB and a high-performance aggregation engine that are integrated into the modular architecture of the aggregation server. The stand-alone aggregation server of the present invention can uniformly distribute data elements among a plurality of processors, for balanced loading and processing, and therefore is highly scalable.

Abstract: Technologies are described herein for defining the scope of a sub-cube based upon a database query. A request is received to perform a query of a multi-dimensional database, such as a cube, stored at a server computer. In response to the request, the scope for a sub-portion, called a sub-cube, of the multi-dimensional database is determined based upon the query. The scope of the sub-cube may be determined by identifying the minimum sub-portion of the cube necessary to perform the query. Once the scope has been determined, the sub-cube is generated at the server computer and transmitted to a client computer. The client computer stores the sub-cube locally and performs the requested database query on the sub-cube stored at the client computer. A user interface may be provided through which a user can modify the scope of the sub-cube determined based upon the query.

Abstract: Systems and computer program products that identify data that is related to and associated with data that has been selected from a multidimensional database. The overwhelming amount of data in a multidimensional database that may be viewed by a user, such as a data analyst, is reduced to the selected and associated data by use of index data and related index data, according to the present invention. The views of selected data and related data may be highlighted and formatted for presentation to the user. Further, irrelevant data is filtered out and not presented to the user. Existing systems have not been able to efficiently and adequately identify data that is related to and associated with selected data in a multidimensional database.

Abstract: A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets.

Abstract: [Object] To provide a system model conversion method, a computer program, and a system model converter which facilitate analysis and editing of the system model by using information indicating a hierarchical relationship. [Solving Means] A model converter 1 includes a graph model storage unit 2 storing therein a graph model which is the system model having a graph-type data structure and including a plurality of model elements. A conversion processing description input unit 6 receives input of a conversion processing description including a description about a structure of a multi-dimensional data model and extraction queries that each extract any of the model elements. A data converter 4 generates a table 32 of the multi-dimensional data model in which dimensions have a hierarchical relationship, from the graph model 20 stored in the graph model storage unit 2, on the basis of the inputted conversion processing description.

Abstract: Described herein is a technology for visualizing data. In accordance with some implementations, dimension metadata is automatically extracted from multiple documents. The extracted dimension metadata may be used to populate one or more relation dimensions. Based on the dimension metadata, one or more relations between the documents are determined along the one or more relation dimensions. A relation graph is presented to represent the documents interconnected by the one or more relations.

Abstract: A system, processor, and method for processing multiple dimension data. A single rectangular data array having a single data port may store a set of data elements representing a multi-dimensional pixel array. A load/store unit may receive the set of data elements and store them divided among a plurality of individually addressable data arrays each having separate address ports. Each individually addressable data array may include at most a single row that stores data elements from a sub-set of the set of data elements representing a multi-dimensional sub-array of the pixel array. A processor may simultaneously access the single row of each of the plurality of individually addressable data arrays by accessing the corresponding respective address ports for each individually addressable data array to retrieve the complete sub-set of data elements in a single computational cycle. An execution unit may execute instruction(s) on the sub-set of data elements.

Abstract: Date-warehouse systems are populated using an enhanced Extraction-Load-Transform (ETL) process and system by employing three ideas: Out-of-order-fill ETL, relative-ordering index (ROI), and dependent queries. Out-of-order-fill ETL allows a data warehouse to accept the loading of data files in any order, and does not require the loading of any previous backup data files in order to provide some functionality to end users under the view that some functionality or data access is better than none at all. Dependent queries are processes that use defined data structures for use in constructing, extracting, and validating each record to be written in said data-warehouse system in order to ensure that referential integrity is maintained and that no orphaned data is pushed into the data warehouse. Finally, ROI is a process wherein a value is determined, based on the constraints of the source data, which indicates the relative newness of the data.

Abstract: A method includes storing a first value for one or more measures in a block of data for the cube of data. The first value is a value where the state of the cube is that no changes are applicable to the block of data. A second value is stored for the one or more measures in the block of data. The second value is a delta value representing changes made to the block of data based on the first value. A change is received to the block. A computer processor then calculates a new second value based on the change to the block. The new second value is stored in place of the second value previously stored while the first value remains the same. The second value represents the cumulative changes to the measure since the frozen value was determined.

Abstract: The invention relates to a method for supplying a multimedia content proxy. According to the invention, the method comprises: the step of receiving at least one instance of at least one model of a profiled multimedia scene adapted to a predetermined profile of users having at least one common parameter and from a loom server; the step of storing in said content proxy said at least one instance of said at least one model of profiled multimedia scene.

Abstract: A computer-implemented method for generating and sharing dataset segment schemes of a multidimensional dataset at a client device is disclosed. The client device displays a first filter definition template and an attribute list. Upon detecting a user selection of a first attribute, the client device displays the first attribute and one or more candidate filter conditions in the first filter definition template. Upon detecting a user selection of a first filter condition in the first filter definition template, the client device submits a segment scheme generation request to the server system and receives from the server system a first segment identifier; and displays a first segment link at the client device, the first segment link including the first segment identifier.

Abstract: A computer-implemented method for accessing content items in a content store are described. In one embodiment, the computer-implemented method includes maintaining a text index of content items in a content store to enable a keyword search on the content items, receiving a query having a keyword and generating a hit list from the text index using the keyword, and extracting frequent phrases from text within content items of the hit list. The computer-implemented method also includes assigning a relative relevance to the frequent phrases and grouping content items into topics based on presence of relevant phrases within the content items of the hit list. The hit list includes one or more content items of the content store. The frequent phrases having a relatively high relevance are relevant phrases.

Abstract: Provided is a technology capable of efficiently saving data generated at an intermediate stage of an analysis processing and reusing intermediate data. Data generated at the intermediate stage of the analysis is saved, quantified feedback information for the saved data is received as an evaluation value, and the intermediate data that has not been given an evaluation value is preferentially deleted while the analysis processing for similar data is performed with regard to the intermediate data that has received a particularly high evaluation value, thereby performing automatic management of the intermediate data by a background processing so that the analysis of data to be subjected to a comparison and a derivatively-assumed analysis can be performed at high speed.

Abstract: One embodiment is a method that builds a model of multi-dimensional sequence data in real-time with cuboids that aggregate the multi-dimensional sequence data over both patterns and dimensions. The model provides search results for a query.

Abstract: A method of processing a stream of raw data from a plurality of distributed data producing devices includes reducing the raw data to a plurality of representative synopsis coefficients, organizing the synopsis coefficients into a data structure with at least three dimensions, including a time window dimension and an accuracy dimension. Responsive to a detected anomaly in the data structure, at least one of a predetermined autonomous action and an action directed by a user is performed.

Abstract: A computer readable storage medium for performing a transform of a multidimensional matrix in a distributed memory network by: storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The medium further receives results of the calculation of the transform of the matrix by the nodes.

Abstract: A data warehouse comprises a multidimensional data storage area to store multidimensional data and a transactional data storage area to store underlying transactional data from which the multidimensional data is generated. The data warehouse also comprises a multidimensional query processor to provide one or more interfaces to issue a first set of queries conforming to one or more multidimensional query languages to retrieve the multidimensional data from the multidimensional data storage area. Furthermore, the data warehouse comprises a dynamic query engine to provide an additional interface to issue a second set of queries that bypass the interfaces provided by the multidimensional query processor to retrieve the transactional data from the transactional data storage area, wherein the second set of queries do not conform to any of the one or more multidimensional query languages.

Abstract: According to some embodiments, a system, method, means, and/or computer program code are provided to facilitate use of a spreadsheet application to access information stored in a multidimensional data source. Some embodiments include receiving, at an analyzer module, a change indication from the spreadsheet application. The change indication may be, for example, associated with a spreadsheet formula of the spreadsheet application entered by a user into a spreadsheet cell. In response to the change indication, the spreadsheet formula may be translated into a multidimensional expression calculation associated with the multidimensional data source. The spreadsheet formula in the spreadsheet cell may then be automatically replaced with information associated with the multidimensional expression calculation.

Abstract: A method of generating a multi-dimensional model comprises receiving data defining multiple resource types, receiving metadata defining a hierarchical organisation for one or more resource types, a hierarchical resource type for a respective resource type defining multiple levels of aggregation, and composite resource types for one or more groups of resource types, a composite resource type defining a composition of resource types, and generating the multi-dimensional model from the received data and received metadata, the generating comprising creating a multi-dimensional function for each resource type and for each composite resource type.

Abstract: Methods and apparatus to determine statistical dominance point descriptors for multidimensional data are disclosed. An example method disclosed herein comprises determining a first joint dominance value for a first data point in a multidimensional data set, data points in the multidimensional data set comprising multidimensional values, each dimension corresponding to a different measurement of a physical event, the first joint dominance value corresponding to a number of data points in the multidimensional data set dominated by the first data point in every dimension, determining a first skewness value for the first data point, the first skewness value corresponding to a size of a first dimension of the first data point relative to a combined size of all dimensions of the first data point, and combining the first joint dominance and first skewness values to determine a first statistical dominance point descriptor associated with the first data point.

Abstract: A system in accordance with the invention may include a data memory storing a multi-dimensional (e.g., a two-dimensional) data structure. An address generation unit is provided to calculate real addresses in order to access the multi-dimensional data structure in a desired pattern. The address generation unit may be configured to calculate real addresses by moving across the multi-dimensional data structure between pairs of end points. The pairs of end points (as well as parameters such as the step size between the end points) may be pre-programmed into the address generation unit prior to accessing the multi-dimensional data structure. A processor, such as a vector processor, may be configured to access (e.g., read or write data to) the data structure at the real addresses calculated by the address generation unit.

Abstract: An apparatus, system, and method in accordance with the invention may include providing a multi-dimensional data structure and providing an address generation unit configured to calculate real addresses in order to access the multi-dimensional data structure in a desired pattern. The address generation unit may be configured to calculate the real addresses by executing a series of nested loops pre-programmed into the address generation unit prior to accessing the multi-dimensional data structure. The address generation unit may receive as inputs a set of parameters defining the characteristics of the nested loops. The method may then include accessing the data structure at the real addresses calculated by the address generation unit.

Abstract: Performance metrics data in a multi-dimensional structure such as a nested scorecard matrix is transformed into a flat structure or de-normalized for efficient querying of individual records. Each dimension and header is converted to a column and data values resolved at intersection of dimension levels through an iterative process covering all dimensions and headers of the data structure. A key corresponding to a tuple representation of each cell or a transform of the tuple may be used to identify rows corresponding to the resolved data in cells for further enhanced query capabilities.