Abstract: In the proposal system, sales performance information that is related to a device is acquired and information that is related to a usage situation of a device is accepted from a customer. A device to be a purchase target is inferred by a learned model based on the information that is related to the usage situation of the device and the sales performance information, and then a proposal information is outputted as a result of that inference.

Abstract: Index management for non-relational database systems may be automatically performed. Performance of queries to a non-relational database may be evaluated to determine whether to create or remove an additional index. An additional index may be automatically created to store a subset of data projected from the non-relational database to utilize when performing a query to the non-relational database instead of accessing data in the non-relational database.

Abstract: Techniques described herein can accelerate change data capture determinations such as stream reads, which show changes made to a table between two points in time. Three distinct row bitests that mark deleted, updated, inserted, rows in micro-partitions can be added as metadata for the table. These bitsets can be generated during DML operations and then stored as metadata of the new partition generated by the DML operations. The bitsets can then be used to generate streams showing the changes in the table between two points in time (changes interval).

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: Computer-implemented systems and methods are provided for processing a multi-dimensional data structure. For example, systems and methods are provided for processing the multi-dimensional data structure and allowing cell selection rules related to the multi-dimensional data structure to be resolved efficiently, so that computational cost associated with processing the multi-dimensional data structure can be saved.

Abstract: The present application is directed to an indexing system. In one example, the indexing system includes one or more processors, one or more electronic memories that provide random access memory, one or more mass storage devices that provide persistent data storage, and one or more indexing routines, executed by the one or more processors, that create and manage an index data structure comprising nodes that include key-values/reference pairs, the index data structure additionally including a sibling reference for each index-data-structure node stored in the one or more electronic memories, the one or more indexing routines removing, from the index data structure, the sibling references for index-data-structure nodes when transferring the index-data-structure nodes from the one or more electronic memories to the one or more mass storage devices.

Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.

Abstract: An integrated circuit includes a search unit configured to access an input vector including a number of bits, and to find a first and a second instance of a predetermined bit value such as a logic zero or a logic one, for example. The search unit may be further configured to generate an output that includes an indication of a bit position of the first instance of the predetermined bit value within the input vector, and an indication of a bit position of the second instance of the predetermined bit value within the input vector.

Abstract: A database query optimization method is provided for database queries that include predicates, the queries being directed to at least one database table having data in rows and columns. The method includes associating a lineage bit set with each row of the database table, the lineage bit set providing a binary predicate state indication whether each predicate is met or are not met by data in the row. A dependency bit set is established to provide a binary indication of the predicates that are included in each query. Queries are applied against the database table by a logical operation between the lineage bit set and the dependency bit set. A database query optimization data structure includes a lineage bit set associated with each row in the database table. The lineage bit set provides a binary predicate state indication whether each predicate is met or are not met by data in the row.

Abstract: Disclosed herein are an apparatus and method for managing the index information of high-dimensional data. The apparatus for managing the index information of high-dimensional data includes a plurality of data service devices and a control unit. Each of the plurality of data service devices is configured such that user data and index information used to search the user data are allocated thereto. The control unit is configured to extract high-dimensional index data from a large amount of input data and to allocate the extracted index data to the plurality of data service devices by mapping the extracted index data to the plurality of data service devices as the index information.

Abstract: A system, method, and computer-readable medium that facilitate the optimization of frequently executed queries via automated index creation are provided. Standard optimizer strategies for dynamic index creation are utilized with query frequency information taken from a system's request cache. The described mechanisms provide a process of determining what indexes would be beneficial to query performance based on decisions and information from the optimizer that is ultimately responsible for the choice of index usage. Further, the plan cache is utilized in a manner that provides reliable information about the historical and anticipated frequency of specific queries.

Abstract: A system for automatically installing and managing devices in a home network implements automated configuration and maintenance of devices and peripherals. A service platform facilitates automated discovery and deployment of home networks and devices that interact with the network. The system includes a monitoring and learning processes for automatic issue detection and alerting. Activity of users and devices within the home are monitored, usage patterns are learned and applied back to the system to improve the digital performance of the home. This system leverages data center, service node, and agent software in the devices to access a knowledge base storing data regarding home entities. A hierarchical index model is used to assign intelligence levels to these entities based on certain parameters. The indices are used to direct alert messages, take an action, and implement a targeted facility for providing communications from network managers or service providers.

Abstract: In an example embodiment, a method is illustrated to determine multi-column indexes, the method including receiving one or more structured query language (SQL) queries, the one or more SQL queries defining a workload. A database index analysis tool may be used to determine a plurality of index configurations for executing the workload. Further, leading index configurations may be determined, leading index configurations including a subset of the plurality of index configurations. Also, a statistics database may be updated with complete statistics for the leading index configurations.

Abstract: Provided are a system and a method for indexing high-dimensional data in parallel in a cluster environment. The system for indexing high-dimensional data in parallel in a cluster environment includes a Spill-tree creation means for creating a Spill-tree using an sampled N-dimensional feature vector, a feature vector division storage means for distributedly storing the N-dimensional feature vector in a terminal node of the Spill-tree, and a local signature creation means for creating and managing a local signature for the N-dimensional feature vector dispersed into each node of the Spill-tree.

Abstract: A technique for accessing a subject multi-dimensional database stored on a data store connected to the computer. An index is created for the subject multi-dimensional database, wherein the index comprises another multi-dimensional database. Then, the subject multi-dimensional database is accessed using the index.

Abstract: One embodiment of the present invention provides a system for masking index values in a database. During operation, the system receives a request to mask a column in a database, wherein the column is an index-column. Next, the system retrieves a tree which is used to index the column, wherein the tree provides a sorted representation of values in the column. The system then locates the root-node of the tree. Then, for each child-node in the tree, the system determines if the child-node is a leaf-node. If so, the system masks a node-value for the leaf-node without resorting the tree. If not, the system leaves the node-value unmasked.

Abstract: Described is a technology by which high dimensional data may be efficiently analyzed, including by filtering, grouping, aggregating and/or sorting operations to provide an analysis result. For efficiency in the analysis, an inverted index may be built (e.g., as part of filtering), and/or a hash structure (e.g., as part of grouping). Analysis parameters specify dimensions, on which union and/or intersection operations are performed to provide a final dataset. The analysis tool provides a user interface for inputting analysis parameters and outputting information corresponding to an analysis result. The analysis tool may sort the information corresponding to the analysis result, e.g., to output the topmost or bottommost results.

Abstract: The present invention relates to a system for extracting a specific portion of content. When a desired portion is extracted so that a content service can be provided, a plurality of users extract a beginning time and an ending time of a specific frame in the case of moving picture content and carry out a temporal indexing operation. When searching for the specific portion after extracting a beginning point and an ending point of the specific portion in case of still picture content and carrying out a spatial indexing operation, the plurality of users retrieve and display the specific portion from an indexed database. Therefore, the plurality of users can carry out the indexing operation for one file to organize a search database without correcting an original file and can extract the specific portion of content. Moreover, because the specific portion of content can be extracted and the extracted specific portion can be displayed and edited, all file formats can be controlled irrespective of file format.